Parallel genetic algorithm for generation expansion planning

Yoshikazu Fukuyama, Yosuke Nakanishi, Hsaio Dong Chiang

Research output: Contribution to journalArticle

1 Citation (Scopus)

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 languageEnglish
Pages (from-to)49-56
Number of pages8
JournalInternational Journal of Engineering Intelligent Systems for Electrical Engineering and Communications
Volume4
Issue number1
Publication statusPublished - 1996
Externally publishedYes

Fingerprint

Parallel algorithms
Genetic algorithms
Transputers
Planning
Combinatorial optimization
Dynamic programming

Keywords

  • Combinatorial optimization problem
  • Generation expansion planning
  • Parallel genetic algorithm

ASJC Scopus subject areas

  • Engineering(all)
  • Electrical and Electronic Engineering

Cite this

Parallel genetic algorithm for generation expansion planning. / Fukuyama, Yoshikazu; Nakanishi, Yosuke; Chiang, Hsaio Dong.

In: International Journal of Engineering Intelligent Systems for Electrical Engineering and Communications, Vol. 4, No. 1, 1996, p. 49-56.

Research output: Contribution to journalArticle

@article{b7b44fa802354243bd6c857b6c279512,
title = "Parallel genetic algorithm for generation expansion planning",
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.",
keywords = "Combinatorial optimization problem, Generation expansion planning, Parallel genetic algorithm",
author = "Yoshikazu Fukuyama and Yosuke Nakanishi and Chiang, {Hsaio Dong}",
year = "1996",
language = "English",
volume = "4",
pages = "49--56",
journal = "International Journal of Engineering Intelligent Systems for Electrical Engineering and Communications",
issn = "0969-1170",
publisher = "CRL Publishing",
number = "1",

}

TY - JOUR

T1 - Parallel genetic algorithm for generation expansion planning

AU - Fukuyama, Yoshikazu

AU - Nakanishi, Yosuke

AU - Chiang, Hsaio Dong

PY - 1996

Y1 - 1996

N2 - 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.

AB - 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.

KW - Combinatorial optimization problem

KW - Generation expansion planning

KW - Parallel genetic algorithm

UR - http://www.scopus.com/inward/record.url?scp=0030104111&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0030104111&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0030104111

VL - 4

SP - 49

EP - 56

JO - International Journal of Engineering Intelligent Systems for Electrical Engineering and Communications

JF - International Journal of Engineering Intelligent Systems for Electrical Engineering and Communications

SN - 0969-1170

IS - 1

ER -