An evolutionary programming solution to the unit commitment problem

Author

Juste, K.A. ; Kita, H. ; Tanaka, E. ; Hasegawa, J.

Author_Institution

Div. of Syst. & Inf. Eng., Hokkaido Univ., Sapporo, Japan

Volume

14

Issue

4

fYear

1999

fDate

11/1/1999 12:00:00 AM

Firstpage

1452

Lastpage

1459

Abstract

The work was conducted with the aim of finding a general method for solving the unit commitment (UC) problem. The proposed algorithm employs the evolutionary programming (EP) technique in which populations of contending solutions are evolved through random changes, competition, and selection. In the subject algorithm an overall UC schedule is coded as a string of symbols and viewed as a candidate for reproduction. Initial populations of such candidates are randomly produced to form the basis of subsequent generations. The practical implementation of this procedure yielded satisfactory results when the EP-based algorithm was tested on a reported UC problem previously addressed by some existing techniques such as Lagrange relaxation (LR), dynamic programming (DP), and genetic algorithms (GAs). Numerical results for systems of up to 100 units are given and commented on

Keywords

evolutionary computation; power generation scheduling; contending solutions competition; contending solutions random changes; contending solutions selection; evolutionary programming solution; unit commitment; unit commitment schedule coding; Dynamic programming; Economic forecasting; Genetic algorithms; Genetic programming; Lagrangian functions; Power system dynamics; Power system reliability; Power system security; Systems engineering and theory; Testing;

fLanguage

English

Journal_Title

Power Systems, IEEE Transactions on

Publisher

ieee

ISSN

0885-8950

Type

jour

DOI

10.1109/59.801925

Filename

801925