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 pr...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on power systems 1998-08, Vol.13 (3), p.936-945
Main Authors: HUANG, K.-Y, YANG, H.-T, HUANG, C.-L
Format: Article
Language:English
Subjects:
Applied sciences
Artificial intelligence
Control systems
Disturbances. Regulation. Protection
Electrical engineering. Electrical power engineering
Electrical power engineering
Exact sciences and technology
IEEE members
Load forecasting
Logic programming
Operation. Load control. Reliability
Power generation
Power networks and lines
Power system simulation
Power systems
Thermal engineering
Upper bound
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0885-8950
1558-0679
DOI:10.1109/59.708832