composite cost function based solution to the unit commitment problem基于综合成本函数解决单位承诺的问题.pdfVIP

Smart Grid and Renewable Energy, 2010, 1, 88-97 doi:10.4236/sgre.2010.12014 Published Online August 2010 (http://www.SciRP.org/journal/sgre) Composite Cost Function Based Solution to the Unit Commitment Problem Srikrishna Subramanian, Radhakrishnan Anandhakumar Department of Electrical Engineering, Annamalai University, Annamalainagar, India. Email: anand_r1979@ Received May 29th 2010; revised June 29th 2010; accepted July 3rd 2010. ABSTRACT This paper presents a new approach via composite cost function to solve the unit commitment problem. The unit com- mitment problem involves determining the start-up and shut-down schedules for generating units to meet the forecasted demand at the minimum cost. The commitment schedule must satisfy the other constraints such as the generating limits, spinning reserve, minimum up and down time, ramp level and individual units. The proposed algorithm gives the com- mitted units and economic load dispatch for each specific hour of operation. Numerical simulations were carried out using three cases: four-generator, seven-generator, and ten-generator thermal unit power systems over a 24 h period. The produced schedule was compared with several other methods, such as Dynamic programming, Branch and bound, Ant colony system , and traditional Tabu search. The result demonstrated the accuracy of the proposed method. Keywords : Composite Cost Function, Generation Scheduling, Unit Commitment 1. Introduction rameter-tunning drawback. A parallel repair genetic al- gorithm has been proposed to solve unit commitment Unit commitment is to determine the commitment and problem [3]. This algorithm provides a modeling frame- generation levels of generating units over a period of work less restrictive than previous approaches