A GENETIC ALGORITHM-BASED APPROACH TO THERMAL UNIT COMMITMENT OF ELECTRIC-POWER SYSTEMS

被引：45

作者：

MA, X

ELKEIB, AA

SMITH, RE

MA, H

机构：

[1] Department of Electrical Engineering, The University of Alabama, Tuscaloosa

来源：

ELECTRIC POWER SYSTEMS RESEARCH | 1995年 / 34卷 / 01期

关键词：

UNIT COMMITMENT; OPTIMIZATION TECHNIQUES; GENETIC ALGORITHMS;

D O I：

10.1016/0378-7796(95)00954-G

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

This paper presents a new approach based on genetic algorithms to solve the thermal unit commitment problem of electric power systems. Genetic algorithms (GAs) are general search techniques based on the biological metaphor and are very suitable for solving combinatorial optimization problems. Because of its nonconvex and combinatorial nature, the unit commitment problem is difficult to solve by conventional programming methods. However, it is well suited for the application of the GAs. A key to the success of the implementation of the proposed algorithm is a newly developed knowledge-augmented mutation-like operator, named here the forced mutation. It was found to improve, significantly, the efficiency of the GA in solving the unit commitment problem. Two different coding schemes were devised and tested. In addition, the effects of GAs' control variables on convergence were extensively studied. The approach was tested on a ten-unit system. Test results clearly reveal the robustness and promise of the proposed approach.

引用

页码：29 / 36

页数：8

共 27 条

[1]

Baldwin, Dale, Dittrich, A study of the economic shutdown of generating units in daily dispatch, Trans. AIEE Part 3, 78, pp. 1272-1284, (1959)

[2]

Happ, Johnson, Wright, Large scale hydrothermal unit commitment method and results, IEEE Trans. Power Appar Syst., PAS-90, pp. 1373-1383, (1971)

[3]

Pang, Sheble, Albuyeh, Evaluation of dynamic programming based methods and multiple area representation for thermal unit commitment, IEEE Transactions on Power Apparatus and Systems, pp. 1212-1218, (1981)

[4]

Van den Bosch, Honderd, A solution of the unit commitment problem via decomposition and dynamic programming, IEEE Transactions on Power Apparatus and Systems, pp. 1684-1690, (1985)

[5]

Hobbs, Hermon, Warner, Sheble, An enhanced dynamic programming approach for unit commitment, IEEE Trans. Power Syst., 3, pp. 1201-1205, (1988)

[6]

Dillon, Integer programming approach to the problem of optimal unit commitment with probabilistic reserve determination, IEEE Transactions on Power Apparatus and Systems, pp. 2154-2164, (1978)

[7]

Cohen, Yoshimura, A branch-and-bound algorithm for unit commitment, IEEE Transactions on Power Apparatus and Systems, pp. 444-451, (1983)

[8]

Tong, Shahidehpour, Combination of Lagrangian relaxation and linear-programming approaches for fuel constrained unit commitment problems, IEE Proc. C, 136, pp. 162-174, (1989)

[9]

Cohen, Wan, A method for solving the fuel constrained unit commitment problem, IEEE Transactions on Power Systems, 3, pp. 608-614, (1987)

[10]

Virmani, Anderian, Imhof, Mukherjee, Implementation of a Lagrangian relaxation based unit commitment problem, IEEE Trans. Power Syst., 4, 4, pp. 1373-1379, (1989)

← 1 2 3 →