Q. Z. Zhai, X. H. Guan and J. Cui, “Unit Commitment with Identical Units: Successive Subproblem Solving Method Based on Lagrangian Relaxation,” IEEE Transactions on Power Systems, Vol. 17, No. 4, November 2002, pp. 1250-1257.

has been cited by the following article:

• TITLE: Composite Cost Function Based Solution to the Unit Commitment Problem

  AUTHORS: Srikrishna Subramanian, Radhakrishnan Anandhakumar

  KEYWORDS: Composite Cost Function, Generation Scheduling, Unit Commitment

  JOURNAL NAME: Smart Grid and Renewable Energy, Vol.1 No.2, September 16, 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 fore-casted 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 committed 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.