By Topic

Nondominated sorting genetic algorithm for optimal phasor measurement placement

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)

The paper considers a phasor measurement unit (PMU) placement problem requiring simultaneous optimization of two conflicting objectives, such as minimization of the number of PMUs and maximization of the measurement redundancy. The objectives are in conflict, since the improvement of one of them leads to the deterioration of another. Instead of unique optimal solution, it exists a set of best trade-offs between competing objectives, the so-called Pareto-optimal solutions. A specially tailored nondominated sorting genetic algorithm (NSGA) for PMU placement problem is proposed as a methodology to find these Pareto-optimal solutions. The algorithm is combined with the graph-theoretical procedure and a simple GA to reduce initial number of the PMU's candidate locations. The NSGA parameters are carefully set by performing a number of trial runs and evaluating the NSGA performances based on the number of distinct Pareto-optimal solutions found in the particular run and the distance of the obtained Pareto front from the optimal one. Illustrative results on the 39-bus and 118-bus IEEE systems are presented.

Published in:

Power Engineering Society General Meeting, 2003, IEEE  (Volume:2 )

Date of Conference:

13-17 July 2003