A new approach for GenCos profit based unit commitment in day-ahead competitive electricity markets considering reserve uncertainty

被引:47
作者
Yamin, H. Y. [1 ]
El-Dwairi, Q.
Shahidehpour, S. M.
机构
[1] Yarmouk Univ, Hijjawi Fac, Dept Power Engn, Irbid 21163, Jordan
[2] Jordan Univ Sci & Technol, Dept Anat, Irbid, Jordan
[3] IIT, Dept Elect & Comp Engn, Chicago, IL 60616 USA
关键词
competitive electricity markets; unit commitment; generation; spinning and non-spinning reserves; fuel and emission constraints; probability; ANN; Lagrangian relaxation and evolutionary programming;
D O I
10.1016/j.ijepes.2006.09.004
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper presents a new approach for GenCos Profit Based Unit Commitment (GPBUC) in day-ahead competitive electricity markets. Generation, spinning and non-spinning reserves are considered in the proposed formulation. The estimated probability that spinning and non-spinning reserves are called and generated is also considered in the formulation to simulate the reserve uncertainty. The artificial neural network (ANN) is applied for forecasting the reserve probability considering line limits, line and generator outages, market prices, bidding strategy, load and reserves patterns. Fuel and emission constraints are included in the model. A hybrid method between Lagrangian relaxation (LR) and evolutionary programming (EP) is applied to solve the proposed GPBUC problem. The proposed approach is applied to a 36 unit test system and the results are compared with those obtained from other approaches. (c) 2007 Elsevier Ltd. All rights reserved.
引用
收藏
页码:609 / 616
页数:8
相关论文
共 22 条
  • [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] Allen E.H., 1997, P N AM POW C SEPT 19, P105
  • [3] Reserve markets for power systems reliability
    Allen, EH
    Ilic, MD
    [J]. IEEE TRANSACTIONS ON POWER SYSTEMS, 2000, 15 (01) : 228 - 233
  • [4] THE GENERALIZED UNIT COMMITMENT PROBLEM
    BALDICK, R
    [J]. IEEE TRANSACTIONS ON POWER SYSTEMS, 1995, 10 (01) : 465 - 475
  • [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] Cooperative Coevolutionary Algorithm for unit commitment
    Chen, HY
    Wang, XF
    [J]. IEEE TRANSACTIONS ON POWER SYSTEMS, 2002, 17 (01) : 128 - 133
  • [7] Unit commitment by Lagrangian relaxation and genetic algorithms
    Cheng, CP
    Liu, CW
    Liu, GC
    [J]. IEEE TRANSACTIONS ON POWER SYSTEMS, 2000, 15 (02) : 707 - 714
  • [8] A METHOD FOR SOLVING THE FUEL CONSTRAINED UNIT COMMITMENT PROBLEM
    COHEN, AI
    WAN, SH
    [J]. IEEE TRANSACTIONS ON POWER SYSTEMS, 1987, 2 (03) : 608 - 614
  • [9] 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
  • [10] An evolutionary programming solution to the unit commitment problem
    Juste, KA
    Kita, H
    Tanaka, E
    Hasegawa, J
    [J]. IEEE TRANSACTIONS ON POWER SYSTEMS, 1999, 14 (04) : 1452 - 1459