A new thermal unit commitment approach using constraint logic programming

The authors propose a constraint logic programming (CLP) algorithm to solve the thermal unit commitment (UC) problem in this paper. The algorithm combines the characteristics of the logic programming with the constraint satisfaction as well as the depth-first branch and bound search techniques to provide an efficient and flexible approach to the UC problem. Through the constraint satisfaction techniques, the constraints, which consist of the upper bound on the objective value, are propagated as much as possible to actively reduce the search space of the UC problem in a priori way. Consequently, the optimal solution can be acquired in a very early stage. To demonstrate the effectiveness of the proposed approach, the practical thermal UC problem of Taiwan Power (Taipower) 38-unit system over a 24-hour period is solved by the CLP algorithm implemented in CHIP language. The results obtained are compared with those from the established methods of the dynamic programming, the Lagrangian relaxation as well as the simulated annealing.

[1]  A. J. Svoboda,et al.  A new unit commitment method , 1997 .

[2]  K. P. Wong,et al.  Artificial intelligence algorithm for daily scheduling of thermal generators , 1991 .

[3]  S. M. Shahidehpour,et al.  An intelligent dynamic programming for unit commitment application , 1991 .

[4]  W. L. Peterson,et al.  A capacity based Lagrangian relaxation unit commitment with ramp rate constraints , 1995 .

[5]  K. P. Wong,et al.  A recursive economic dispatch algorithm for assessing the costs of thermal generator schedules , 1992 .

[6]  Robert M. Haralick,et al.  Increasing Tree Search Efficiency for Constraint Satisfaction Problems , 1979, Artif. Intell..

[7]  Francisco D. Galiana,et al.  Towards a more rigorous and practical unit commitment by Lagrangian relaxation , 1988 .

[8]  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.

[9]  Francisco D. Galiana,et al.  Unit commitment by simulated annealing , 1990 .

[10]  S. M. Shahidehpour,et al.  A heuristic short-term unit commitment , 1991 .

[11]  F. N. Lee,et al.  Short-term thermal unit commitment-a new method , 1988 .

[12]  Eugene C. Freuder,et al.  Partial Constraint Satisfaction , 1989, IJCAI.

[13]  S. M. Shahidehpour,et al.  Ramp-rate limits in unit commitment and economic dispatch incorporating rotor fatigue effect , 1994 .

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

[15]  Walter L. Snyder,et al.  Dynamic Programming Approach to Unit Commitment , 1987, IEEE Transactions on Power Systems.

[16]  Yahia Baghzouz,et al.  Implementation of the unit commitment problem on supercomputers , 1994 .