Application of NSGA-II Algorithm to Generation Expansion Planning

This paper describes use of a multiobjective optimization method, elitist nondominated sorting genetic algorithm version II (NSGA-II), to the generation expansion planning (GEP) problem. The proposed model provides for decision maker choice from among the different trade-off solutions. Two different problem formulations are considered. In one formulation, the first objective is to minimize cost; the second objective is to minimize sum of normalized constraint violations. In the other formulation, the first objective is to minimize investment cost; the second objective is to minimize outage cost (or maximize reliability). Virtual mapping procedure is introduced to improve the performance of NSGA-II. The GEP problem considered is a test system for a six-year planning horizon having five types of candidate units. The results are compared and validated.

[1]  Mo-Yuen Chow,et al.  A review of emerging techniques on generation expansion planning , 1997 .

[2]  Kalyanmoy Deb,et al.  Simulated Binary Crossover for Continuous Search Space , 1995, Complex Syst..

[3]  Jong-Bae Park,et al.  An improved genetic algorithm for generation expansion planning , 2000 .

[4]  Jose L. Ceciliano Meza,et al.  A Model for the Multiperiod Multiobjective Power Generation Expansion Problem , 2007, IEEE Transactions on Power Systems.

[5]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[6]  Kalyanmoy Deb,et al.  Multi-objective optimization using evolutionary algorithms , 2001, Wiley-Interscience series in systems and optimization.

[7]  Jong-Bae Park,et al.  Generation expansion planning based on an advanced evolutionary programming , 1999 .

[8]  S. Kannan,et al.  Application and comparison of metaheuristic techniques to generation expansion planning problem , 2005, IEEE Transactions on Power Systems.

[9]  P. Jirutitijaroen,et al.  Reliability and cost tradeoff in multiarea power system generation expansion using dynamic programming and global decomposition , 2006, IEEE Transactions on Power Systems.

[10]  X. Wang,et al.  Modern power system planning , 1994 .

[11]  Kalyanmoy Deb,et al.  Muiltiobjective Optimization Using Nondominated Sorting in Genetic Algorithms , 1994, Evolutionary Computation.

[12]  Richard A. Watson,et al.  Reducing Local Optima in Single-Objective Problems by Multi-objectivization , 2001, EMO.

[13]  P. S. Neelakanta,et al.  Integrated resource planning using segmentation method based dynamic programming , 1999 .

[14]  K. Deb.  An Efficient Constraint Handling Method for Genetic Algorithms , 2000 .

[15]  Eckart Zitzler,et al.  Evolutionary algorithms for multiobjective optimization: methods and applications , 1999 .

[16]  David Corne,et al.  The Pareto archived evolution strategy: a new baseline algorithm for Pareto multiobjective optimisation , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[17]  Chandra Prakesh Gupta.  Book Review: Programming Models for the Electricity Industry , 1997 .