By Topic

Generation expansion planning based on an advanced evolutionary programming

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

4 Author(s)
Young-Moon Park ; Sch. of Electr. Eng., Seoul Nat. Univ., South Korea ; Jong-Ryul Won ; Jong-Bae Park ; Dong-Gee Kim

This paper proposes an efficient evolutionary programming algorithm for solving a generation expansion planning (GEP) problem known as a highly-nonlinear dynamic problem. Evolutionary programming (EP) is an optimization algorithm based on the simulated evolution (mutation, competition and selection). In this paper, some improvements are presented to enhance the efficiency of the EP algorithm for solving the GEP problem. First, by a domain mapping procedure, yearly cumulative capacity vectors are transformed into one dummy vector, whose change can field a kind of trend in the cost value. Next quadratic approximation technique and tournament selection are utilized. To validate the proposed approach, these algorithms are tested on two cases of expansion planning problems. Simulation results show that the proposed algorithm can provide successful results within a reasonable computational time compared with conventional EP and dynamic programming

Published in:

Power Systems, IEEE Transactions on  (Volume:14 ,  Issue: 1 )