A Heuristic algorithm to solve the unit commitment problem for real-life large-scale power systems

被引:10
作者
Alvarez Lopez, Juan [1 ]
Ceciliano-Meza, Jose L. [1 ]
Guillen, Isaias [1 ]
Nieva Gomez, Rolando [2 ]
机构
[1] Elect Res Inst, Network Anal Dept, Cuernavaca 62490, Morelos, Mexico
[2] Elect Res Inst, Elect Syst Div, Cuernavaca 62490, Morelos, Mexico
关键词
CPLEX; Dynamic programming; Mixed integer linear programming; Quadratically constrained programming; Quadratic programming; Unit commitment; LAGRANGIAN-RELAXATION;
D O I
10.1016/j.ijepes.2013.01.016
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
One of the main needs that power system operators around the world have is to solve complex Unit Commitment models for large-scale power systems in an acceptable computation time. This Paper presents an alternative Heuristic algorithm that successfully addresses this need. The Heuristic algorithm makes use of various optimization techniques such as Mixed Integer Linear Programming (MILP), Quadratic Programming (QP), Quadratically Constrained Programming (QCP), and Dynamic Programming (DP). CPLEX 12.2 is used as the main optimization engine for MILP, QP, and QCP. DP is an in-house algorithm used to obtain the commitment of Combined Cycle Plants (CCPs) when represented with the component-based model. This Heuristic algorithm combines the global optimality capabilities of MI (L) P formulations with the highly detailed models available for CCPs using LR-DP formulations. The Heuristic algorithm introduced in this Paper is capable of solving up to 1-week scenarios with a 1-hour time window for the complex Mexican Power System. (C) 2013 Elsevier Ltd. All rights reserved.
引用
收藏
页码:287 / 295
页数:9
相关论文
共 26 条
[1]   A MIQCP formulation to solve the unit commitment problem for large-scale power systems [J].
Alvarez Lopez, Juan ;
Ceciliano-Meza, Jose L. ;
Guillen Moya, Isaias ;
Nieva Gomez, Rolando .
INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS, 2012, 36 (01) :68-75
[2]   Commitment of Combined Cycle Plants Using a Dual Optimization-Dynamic Programming Approach [J].
Alvarez Lopez, Juan ;
Nieva Gomez, Rolando ;
Guillen Moya, Isaias .
IEEE TRANSACTIONS ON POWER SYSTEMS, 2011, 26 (02) :728-737
[3]  
[Anonymous], IEEE T POWER SYST
[4]  
[Anonymous], J ELECT ENG
[5]   Lagrangian heuristics based on disaggregated bundle methods for hydrothermal unit commitment [J].
Borghetti, A ;
Frangioni, A ;
Lacalandra, F ;
Nucci, CA .
IEEE TRANSACTIONS ON POWER SYSTEMS, 2003, 18 (01) :313-323
[6]   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
[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]   Adaptive mixed-integer programming unit commitment strategy for determining the value of forecasting [J].
Delarue, Erik ;
D'haeseleer, William .
APPLIED ENERGY, 2008, 85 (04) :171-181
[9]   INTEGER PROGRAMMING APPROACH TO THE PROBLEM OF OPTIMAL UNIT COMMITMENT WITH PROBABILISTIC RESERVE DETERMINATION [J].
DILLON, TS ;
EDWIN, KW ;
KOCHS, HD ;
TAUD, RJ .
IEEE TRANSACTIONS ON POWER APPARATUS AND SYSTEMS, 1978, 97 (06) :2154-2166
[10]   Sequential Lagrangian-MILP approaches for Unit Commitment problems [J].
Frangioni, Antonio ;
Gentile, Claudio ;
Lacalandra, Fabrizio .
INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS, 2011, 33 (03) :585-593