A New Hybrid Approach for Unit Commitment Using Lagrangian Relaxation Combined with Evolutionary and Quadratic Programming

被引:0
作者
Bavafa, M. [1 ]
Monsef, H. [1 ]
Navidi, N. [2 ]
机构
[1] Univ Tehran, Tehran, Iran
[2] Univ Naein, Tehran, Iran
来源
2009 ASIA-PACIFIC POWER AND ENERGY ENGINEERING CONFERENCE (APPEEC), VOLS 1-7 | 2009年
关键词
unit commitment; Lagrangian relaxation; Ant Colony search algorithm (ACSA); quadratic programming; evolutionary programming; RAMP-RATE LIMITS; TRANSMISSION; CONSTRAINTS;
D O I
暂无
中图分类号
TE [石油、天然气工业]; TK [能源与动力工程];
学科分类号
0807 ; 0820 ;
摘要
This paper proposes an approach which combines Lagrangian relaxation principle with evolutionary programming and quadratic programming (LREQP) for short-term thermal unit commitment. Unit commitment is a complex combinatorial optimization problem which is difficult to be solved for large-scale power systems. This paper presents a hybrid method for ramp rate constrained unit commitment (RUC) problem. Hybrid LREQP minimizes the total supply cost subject to the power balance, generation ramp limit constraints, on/off line minimum level constraints, minimum up and new down time constraints and generator operating constraints. The proposed solution method solves unit commitment problem with two coordination procedures. In the first procedure, an evolutionary programming algorithm is used to improve a solution obtained by the Lagrangian relaxation method: Lagrangian relaxation gives the starting point for a evolutionary programming procedure. In the second procedure, economic dispatch (ED) by quadratic programming (QP) is performed 24 hours to simultaneously dispatch output subject to all constraints and unit decommitment is carried out. Hybrid LREQP is tested on the 26 unit IEEE reliability test system. The proposed algorithm takes the advantages of both methods and therefore it can search a better solution within short computation time.
引用
收藏
页码:2134 / +
页数:3
相关论文
共 30 条
  • [1] A practical resource scheduling with OPF constraints
    AbdulRahman, KH
    Shahidehpour, SM
    Aganagic, M
    Mokhtari, S
    [J]. IEEE TRANSACTIONS ON POWER SYSTEMS, 1996, 11 (01) : 254 - 259
  • [2] [Anonymous], 1979, IEEE T POWER AP SYST, V98, P2047, DOI 10.1109/TPAS.1979.319398
  • [3] [Anonymous], 1992, GENETIC ALGORITHMS D, DOI DOI 10.1007/978-3-662-03315-9
  • [4] ATTAVIRIYANUPAP P, P 12 ANN C POW EN SO
  • [5] DAILY GENERATION SCHEDULING OPTIMIZATION WITH TRANSMISSION CONSTRAINTS - A NEW CLASS OF ALGORITHMS
    BATUT, J
    RENAUD, A
    [J]. IEEE TRANSACTIONS ON POWER SYSTEMS, 1992, 7 (03) : 982 - 989
  • [6] Dekrajangpetch S, 1999, IEEE T POWER SYST, V14, P82, DOI 10.1109/59.744488
  • [7] INTEGER PROGRAMMING APPROACH TO THE PROBLEM OF OPTIMAL UNIT COMMITMENT WITH PROBABILISTIC RESERVE DETERMINATION
    DILLON, TS
    EDWIN, KW
    KOCHS, HD
    TAUD, RJ
    [J]. IEEE TRANSACTIONS ON POWER APPARATUS AND SYSTEMS, 1978, 97 (06): : 2154 - 2166
  • [8] Optimal scheduling of spinning reserve - Reply
    Gooi, HB
    Mendes, DP
    Bell, KRW
    Kirschen, DS
    [J]. IEEE TRANSACTIONS ON POWER SYSTEMS, 1999, 14 (04) : 1492 - 1492
  • [9] The IEEE reliability test system - 1996
    Grigg, C
    Wong, P
    Albrecht, P
    Allan, R
    Bhavaraju, M
    Billinton, R
    Chen, Q
    Fong, C
    Haddad, S
    Kuruganty, S
    Li, W
    Mukerji, R
    Patton, D
    Rau, N
    Reppen, D
    Schneider, A
    Shahidehpour, M
    Singh, C
    [J]. IEEE TRANSACTIONS ON POWER SYSTEMS, 1999, 14 (03) : 1010 - 1018
  • [10] AN ENHANCED DYNAMIC-PROGRAMMING APPROACH FOR UNIT COMMITMENT
    HOBBS, WJ
    HERMON, G
    WARNER, S
    SHEBLE, GB
    [J]. IEEE TRANSACTIONS ON POWER SYSTEMS, 1988, 3 (03) : 1201 - 1205