t204.gif (2848 ×Ö½Ú)
New Heuristic Approach for Unit Commitment
Lai Fei1,Zhao Xiaofei2
(1. Xi'an Jiaotong University, Xi'an 710049, China; 2. Electric Power Company of Xi'an)
retue.gif (1614 ×Ö½Ú)zwb.gif (1647 ×Ö½Ú)
Abstract: A heuristic model of unit commitment is proposed by using dynamic programming. Start-up and shut down costs affect the priority list. The Lagrangian relaxation method is used to solve the economic dispatch. The optimal solution is obtained and computing time is greatly decreased.
Keywords: unit commitment;heuristic method;dynamic programming;Lagrangian relaxation