Inducing-objective-function-based method for long-term SCUC with energy constraints

被引:18
作者
Bai, Yang [1 ]
Zhong, Haiwang [1 ]
Xia, Qing [1 ]
Xin, Yaozhong [2 ]
Kang, Chongqing [1 ]
机构
[1] Tsinghua Univ, Dept Elect Engn, State Key Lab Power Syst, Beijing 100084, Peoples R China
[2] State Grid Corp China, Beijing 100031, Peoples R China
关键词
Security constrained unit commitment; Long-term; Inducing objective function; Energy constraints; UNIT COMMITMENT PROBLEM; MANAGEMENT-SYSTEM; EXPERIMENTAL VALIDATION; MICROGRIDS; FORMULATION; ALGORITHM;
D O I
10.1016/j.ijepes.2014.07.004
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
An efficient method to solve the long-term security constrained unit commitment (SCUC) is a requisite for power system operators in many countries, particularly those with many coal-fired generating units, which require a long time to start up and shut down. However, the complexity that is introduced by the energy or fuel constraints in the long-term SCUC problem often results in exorbitant computation time. In this paper, a new type of approach, which is termed the inducing-objective-function (IOF)-based method, is proposed. This method significantly improves the computational efficiency. In the proposed method, the inducing factors are introduced into the objective function of the SCUC relaxation problem to induce more UC state variables to satisfy the integrality requirement after several iterations. According to the relaxation solution, the objective function of the original SCUC model is modified. Thus, the process of solving the modified model using the branch-and-cut algorithm can be more efficient. Because the solution of this modified model can be near-optimal for the original model, the gap between the near-optimal and the optimal solution is estimated to decide whether the near-optimal solution is acceptable for practical application. If the near-optimal solution is not acceptable, it will be used as the initial solution to solve the original model. Because the initial solution is of high quality, it can significantly speed up the branch-and-cut process. Two case studies with different scales demonstrate the robustness, the efficiency and the prospect of the proposed method for practical applications. (C) 2014 Elsevier Ltd. All rights reserved.
引用
收藏
页码:971 / 978
页数:8
相关论文
共 26 条
[1]   A Heuristic algorithm to solve the unit commitment problem for real-life large-scale power systems [J].
Alvarez Lopez, Juan ;
Ceciliano-Meza, Jose L. ;
Guillen, Isaias ;
Nieva Gomez, Rolando .
INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS, 2013, 49 :287-295
[2]  
[Anonymous], 1998, Theory of linear and integer programming
[3]   OPTIMAL LONG-TERM UNIT COMMITMENT IN LARGE-SCALE SYSTEMS INCLUDING FUEL CONSTRAINED THERMAL AND PUMPED-STORAGE HYDRO [J].
AOKI, K ;
ITOH, M ;
SATOH, T ;
NARA, K ;
KANEZASHI, M .
IEEE TRANSACTIONS ON POWER SYSTEMS, 1989, 4 (03) :1065-1073
[4]  
Biskas PN, 2010, BULK POW SYST DYN CO
[5]   A computationally efficient mixed-integer linear formulation for the thermal unit commitment problem [J].
Carrion, Miguel ;
Arroyo, Jose M. .
IEEE TRANSACTIONS ON POWER SYSTEMS, 2006, 21 (03) :1371-1378
[6]   Load forecasting using support vector machines: A study on EUNITE competition 2001 [J].
Chen, BJ ;
Chang, MW ;
Lin, CJ .
IEEE TRANSACTIONS ON POWER SYSTEMS, 2004, 19 (04) :1821-1830
[7]   Unit commitment by Lagrangian relaxation and genetic algorithms [J].
Cheng, CP ;
Liu, CW ;
Liu, GC .
IEEE TRANSACTIONS ON POWER SYSTEMS, 2000, 15 (02) :707-714
[8]   A BRANCH-AND-BOUND ALGORITHM FOR UNIT COMMITMENT [J].
COHEN, AI ;
YOSHIMURA, M .
IEEE TRANSACTIONS ON POWER APPARATUS AND SYSTEMS, 1983, 102 (02) :444-451
[9]  
Cvijic S, 2011, IEEE POW ENER SOC GE
[10]   Optimal transmission switching [J].
Fisher, Emily B. ;
O'Neill, Richard P. ;
Ferris, Michael C. .
IEEE TRANSACTIONS ON POWER SYSTEMS, 2008, 23 (03) :1346-1355