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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on power systems Ročník 13; číslo 3; s. 936 - 945
Hlavní autoři: HUANG, K.-Y, YANG, H.-T, HUANG, C.-L
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York, NY IEEE 01.08.1998
Institute of Electrical and Electronics Engineers
Témata:
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
Branch and bound method
Simulated annealing
Electric energy
Theoretical study
Constraint satisfaction
Relaxation method
Logical programming
Dynamic programming
Lagrangian system
Production unit
ISSN:0885-8950
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0885-8950
DOI:10.1109/59.708832