An evolutionary programming solution to the unit commitment problem

被引:389
作者
Juste, KA [1 ]
Kita, H [1 ]
Tanaka, E [1 ]
Hasegawa, J [1 ]
机构
[1] Hokkaido Univ, Div Syst & Informat Engn, Sapporo, Hokkaido, Japan
关键词
unit commitment; evolutionary programming;
D O I
10.1109/59.801925
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The present 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.
引用
收藏
页码:1452 / 1459
页数:8
相关论文
共 26 条
[1]  
[Anonymous], 1958, EC OPERATION POWER S
[2]  
Back T, 1996, EVOLUTIONARY ALGORIT
[3]   An Overview of Evolutionary Algorithms for Parameter Optimization [J].
Baeck, Thomas ;
Schwefel, Hans-Paul .
EVOLUTIONARY COMPUTATION, 1993, 1 (01) :1-23
[4]  
BALDWIN CJ, 1959, AIEE T 3, V78, P1272, DOI DOI 10.1109/AIEEPAS.1959.4500539
[5]  
Fogel D.B., 1995, EVOLUTIONARY COMPUTA
[6]  
Fogel D. B, 1997, IEEE T EVOLUT COMPUT, V1, P1, DOI DOI 10.1109/TEVC.1997.585887
[7]  
FOGEL DB, 1993, P 2 ANN C EV PROGR, P23
[8]  
Fogel L. J., 1966, ARTIFICIAL INTELLIGE, DOI DOI 10.1109/9780470544600.CH7
[9]  
HOLLAND JH, 1992, ADAPTATION NATURAL A
[10]   A genetic algorithm solution to the unit commitment problem [J].
Kazarlis, SA ;
Bakirtzis, AG ;
Petridis, V .
IEEE TRANSACTIONS ON POWER SYSTEMS, 1996, 11 (01) :83-90