Constraint logic programming algorithm for solving thermal unit commitment problem

Hong Tzer Yang, Kun Yuan Huang, Ching Lien Huang

Research output: Contribution to conferencePaperpeer-review

Abstract

This paper presents a constraint logic programming (CLP) algorithm to solve the thermal unit commitment (UC) problem. The CLP algorithm provides efficient and flexible solution method for the UC problem. Constraints satisfaction techniques are used to prune the search space a priori. The solutions that can not appear as a feasible one are removed from further evaluation. These techniques propagate the constraints as much as possible, and assume the values of some variables of the unit on/off schedule until the infeasible solution are excluded. After pruning the infeasible solutions, branch and bound approach is then employed to find the minimum operation cost from the feasible domains. The algorithm has been implemented to solve the practical Taiwan power 38-unit thermal system UC problem. Results are compared to those of the Lagrangian Relaxation (LR) method to demonstrate the feasibility and effectiveness of the proposed approach to solving the thermal UC problem.

Original languageEnglish
Pages255-260
Number of pages6
Publication statusPublished - 1995 Dec 1
EventProceedings of the 1995 International Conference on Energy Management and Power Delivery, EMPD'95. Part 1 (of 2) - Singapore, Singapore
Duration: 1995 Nov 211995 Nov 23

Other

OtherProceedings of the 1995 International Conference on Energy Management and Power Delivery, EMPD'95. Part 1 (of 2)
CitySingapore, Singapore
Period95-11-2195-11-23

All Science Journal Classification (ASJC) codes

  • Energy(all)
  • Engineering(all)

Fingerprint Dive into the research topics of 'Constraint logic programming algorithm for solving thermal unit commitment problem'. Together they form a unique fingerprint.

Cite this