Abstract

Using PMU data, the fault location algorithm has gradually been trended in the literature. Besides the optimality of the algorithm, the fault location application should directly receive the data of the faulty line from the PMU devices to have the best performance; using state estimation to create the input data of fault location algorithm not only wastes the golden time, but it also decreases the reliability. Given, it is not possible to install PMU devices in all buses of the system, it is better to install them for the lengthy lines having the most probability of the failure. Although various approaches have been presented in the literature to solve optimal PMU placement (OPP), the fault location observability has less been considered in OPP formulation Accordingly, this paper considers a new index, named fault location observability (FLO), as a second objective function in its OPP formulation. Using this index, in addition to minimizing PMU installation cost, the number of lengthy lines being directly observable are also maximized. Using the ɛ-constraint method, the multi-objective problem has been solved several times as single-objective optimizations. Given the constraints and objective functions are linear, the work presents a mixed integer linear programming (MILP) formulation for the placement problem. Using the GAMS under CPLEX solver, the global optimal solutions of MILP model corresponding to the various ɛ-constraints yields to a Pareto optimal front. The simulation results, next, implements the proposed method on the IEEE 300 bus test system as well as the practical OMAN grid to prove the effectiveness of the proposed method.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.