Abstract
This paper presents a parallel genetic algorithm for solving the long-range generation expansion planning, which is a combinatorial optimization problem that determines the order of newly introduced generation units at each interval of the planning years. The method is implemented on a transputer that is one of the practical parallel processors. The effectiveness of the proposed method is demonstrated using a typical expansion problem with four technologies and five intervals and compared favorably with the conventional dynamic programming method and genetic algorithm. The numerical results reveal the speed and effectiveness of the proposed algorithm for solving the problem.
| Original language | English |
|---|---|
| Pages (from-to) | 49-56 |
| Number of pages | 8 |
| Journal | International Journal of Engineering Intelligent Systems for Electrical Engineering and Communications |
| Volume | 4 |
| Issue number | 1 |
| Publication status | Published - 1996 Dec 1 |
| Externally published | Yes |
Keywords
- Combinatorial optimization problem
- Generation expansion planning
- Parallel genetic algorithm
ASJC Scopus subject areas
- Control and Systems Engineering
- Computer Science Applications
- Electrical and Electronic Engineering