DocumentCode :
2222978
Title :
A two-stage method with mixed integer quadratic programming for unit commitment with ramp constraints
Author :
Quan, Ran ; Jian, Jinbao ; Zheng, Haiyan ; Yang, Linfeng
fYear :
2008
fDate :
8-11 Dec. 2008
Firstpage :
374
Lastpage :
378
Abstract :
A two-stage algorithm based on branch-and-cut is proposed to solve the unit commitment (UC) problem. At first, the primal UC problem is reformulated as a simple mixed integer quadratic programming (MIQP), then the MIQP is solved by the commercial software CPLEX. In stage I of the implementation of the algorithm, a mixed integer linear programming is solved to get its optimal or feasible solution. In stage II, the MIQP is solved starting from the solution obtained in stage I. The computation time of solving MIQP can be saved remarkably with our two-stage method than with the direct method. The simulation results for 6 systems from 10 to 100 units show that the proposed method is efficient for large scale UC problems. Especially, the proposed method can achieve good near-optimal solutions.
Keywords :
integer programming; power engineering computing; power generation scheduling; quadratic programming; tree searching; CPLEX software; branch-and-cut algorithm; mixed integer quadratic programming; thermal units scheduling; unit commitment; Computational modeling; Cost function; Dynamic programming; Educational institutions; Lagrangian functions; Large-scale systems; Mixed integer linear programming; Optimization methods; Power system simulation; Quadratic programming; Power system; branch-and-cut method; mixed integer quadratic programming; unit commitment;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Industrial Engineering and Engineering Management, 2008. IEEM 2008. IEEE International Conference on
Conference_Location :
Singapore
Print_ISBN :
978-1-4244-2629-4
Electronic_ISBN :
978-1-4244-2630-0
Type :
conf
DOI :
10.1109/IEEM.2008.4737894
Filename :
4737894
Link To Document :
بازگشت