Premium
Application of parallel genetic algorithms to generation expansion planning using parallel processors
Author(s) -
Fukuyama Yoshikazu,
Ueki Yoshiteru
Publication year - 1995
Publication title -
electrical engineering in japan
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.136
H-Index - 28
eISSN - 1520-6416
pISSN - 0424-7760
DOI - 10.1002/eej.4391150608
Subject(s) - computer science , parallel computing , interval (graph theory) , algorithm , genetic algorithm , decimal , dynamic programming , coding (social sciences) , parallel algorithm , mathematical optimization , mathematics , arithmetic , statistics , combinatorics
This paper presents an application of parallel genetic algorithms (PGA) to the optimal long‐range generation expansion planning. The problem can be formulated as a combinatorial optimization problem that determines the order of introduced generation units at each interval of the year. The proposed method considers introduced power limits of each technology, maximum loads at each interval, and load duration curves at each interval. Appropriate string representation for the problem is presented. Binary and decimal coding and three selection methods are compared. The method is developed on a transputer that is one of the parallel processors. The feasibility of the proposed method is demonstrated using a typical expansion problem with four technologies and five intervals. The method is then compared with conventional dynamic programming and a simple genetic algorithm with promising results.