.png){kind=icon}
Return
A new thermal unit commitment approach using constraint logic programming
.png){kind=icon}
PRE
AI
DOI：10.1109/59.708832.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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 & bound (B&B) 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 CEP algorithm implemented in CHIP language. The results obtained are compared with those from the established methods of the dynamic programming (DP), the Lagrangian relaxation (LR) as well as the simulated annealing (SA).
Keywords:
logic programming
constraint satisfaction
branch & bound
thermal unit commitment
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.2
Papers:
1.1W
Citations:
5.0W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSave
View more