摘要
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.
| 原文 | English |
|---|---|
| 頁面 | 255-260 |
| 頁數 | 6 |
| 出版狀態 | Published - 1995 十二月 1 |
| 事件 | Proceedings of the 1995 International Conference on Energy Management and Power Delivery, EMPD'95. Part 1 (of 2) - Singapore, Singapore 持續時間: 1995 十一月 21 → 1995 十一月 23 |
Other
| Other | Proceedings of the 1995 International Conference on Energy Management and Power Delivery, EMPD'95. Part 1 (of 2) |
|---|---|
| 城市 | Singapore, Singapore |
| 期間 | 95-11-21 → 95-11-23 |
指紋
All Science Journal Classification (ASJC) codes
- Energy(all)
- Engineering(all)
引用此文
}
Constraint logic programming algorithm for solving thermal unit commitment problem. / Yang, Hong Tzer; Huang, Kun Yuan; Huang, Ching Lien.
1995. 255-260 論文發表於 Proceedings of the 1995 International Conference on Energy Management and Power Delivery, EMPD'95. Part 1 (of 2), Singapore, Singapore, .研究成果: Paper
TY - CONF
T1 - Constraint logic programming algorithm for solving thermal unit commitment problem
AU - Yang, Hong Tzer
AU - Huang, Kun Yuan
AU - Huang, Ching Lien
PY - 1995/12/1
Y1 - 1995/12/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0029493529&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0029493529&partnerID=8YFLogxK
M3 - Paper
AN - SCOPUS:0029493529
SP - 255
EP - 260
ER -