.png){kind=icon}
返回
A new thermal unit commitment approach using constraint logic programming
.png){kind=icon}
PRE
AI
DOI：10.1109/59.708832.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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).
Keyword:
logic programming
constraint satisfaction
branch & bound
thermal unit commitment
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.2
论文数:
1.1W
被引数:
5.0W
机构
暂无机构信息
引用论文
.png){kind=icon}
Preoperative open field behavior predicts levels of neuropathic pain-related behavior in mice术前旷场行为预测小鼠神经病理性疼痛相关行为水平
PREAI
分享收藏
查看更多内容