A capacity based Lagrangian relaxation unit commitment with ramp rate constraints

This paper presents a Lagrangian relaxation based technique for solving the power system thermal unit commitment problem. As a general approach, Lagrangian relaxation has proven to be an efficient method of solving the thermal unit commitment problem. The specific technique described in this paper focuses on finding a feasible commitment, then attempting to improve on the optimality of the solution. A new method for processing ramp rate constraints is also introduced. The algorithm has been implemented on a large scale power system and results are shown using actual power system data. >

[1]  Jonathan F. Bard,et al.  Short-Term Scheduling of Thermal-Electric Generators Using Lagrangian Relaxation , 1988, Oper. Res..

[2]  R. Nieva,et al.  Lagrangian Reduction of Search-Range for Large-Scale Unit Commitment , 1987, IEEE Power Engineering Review.

[3]  P. B. Luh,et al.  Short-term scheduling of thermal power systems , 1991, [Proceedings] Conference Papers 1991 Power Industry Computer Application Conference.

[4]  S. Virmani,et al.  Implementation of a Lagrangian Relaxation Based Unit Commitment Problem , 1989, IEEE Power Engineering Review.

[5]  John A. Muckstadt,et al.  An Application of Lagrangian Relaxation to Scheduling in Power-Generation Systems , 1977, Oper. Res..

[6]  F. Albuyeh,et al.  Evaluation of Dynamic Programming Based Methods and Multiple area Representation for Thermal Unit Commitments , 1981, IEEE Transactions on Power Apparatus and Systems.

[7]  A. Merlin,et al.  A New Method for Unit Commitment at Electricite De France , 1983, IEEE Transactions on Power Apparatus and Systems.