Constraint logic programming algorithm for solving thermal unit commitment problem

Hong Tzer Yang, Kun Yuan Huang, Ching Lien Huang

Research output: Contribution to conferencePaper

Abstract

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.

Original languageEnglish
Pages255-260
Number of pages6
Publication statusPublished - 1995 Dec 1
EventProceedings of the 1995 International Conference on Energy Management and Power Delivery, EMPD'95. Part 1 (of 2) - Singapore, Singapore
Duration: 1995 Nov 211995 Nov 23

Other

OtherProceedings of the 1995 International Conference on Energy Management and Power Delivery, EMPD'95. Part 1 (of 2)
CitySingapore, Singapore
Period95-11-2195-11-23

Fingerprint

Logic programming
Hot Temperature
Costs

All Science Journal Classification (ASJC) codes

  • Energy(all)
  • Engineering(all)

Cite this

Yang, H. T., Huang, K. Y., & Huang, C. L. (1995). Constraint logic programming algorithm for solving thermal unit commitment problem. 255-260. Paper presented at Proceedings of the 1995 International Conference on Energy Management and Power Delivery, EMPD'95. Part 1 (of 2), Singapore, Singapore, .
Yang, Hong Tzer ; Huang, Kun Yuan ; Huang, Ching Lien. / Constraint logic programming algorithm for solving thermal unit commitment problem. Paper presented at Proceedings of the 1995 International Conference on Energy Management and Power Delivery, EMPD'95. Part 1 (of 2), Singapore, Singapore, .6 p.
@conference{e005875d1a094be898974de6babbb7bb,
title = "Constraint logic programming algorithm for solving thermal unit commitment problem",
abstract = "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.",
author = "Yang, {Hong Tzer} and Huang, {Kun Yuan} and Huang, {Ching Lien}",
year = "1995",
month = "12",
day = "1",
language = "English",
pages = "255--260",
note = "Proceedings of the 1995 International Conference on Energy Management and Power Delivery, EMPD'95. Part 1 (of 2) ; Conference date: 21-11-1995 Through 23-11-1995",

}

Yang, HT, Huang, KY & Huang, CL 1995, 'Constraint logic programming algorithm for solving thermal unit commitment problem', Paper presented at 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 pp. 255-260.

Constraint logic programming algorithm for solving thermal unit commitment problem. / Yang, Hong Tzer; Huang, Kun Yuan; Huang, Ching Lien.

1995. 255-260 Paper presented at Proceedings of the 1995 International Conference on Energy Management and Power Delivery, EMPD'95. Part 1 (of 2), Singapore, Singapore, .

Research output: Contribution to conferencePaper

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 -

Yang HT, Huang KY, Huang CL. Constraint logic programming algorithm for solving thermal unit commitment problem. 1995. Paper presented at Proceedings of the 1995 International Conference on Energy Management and Power Delivery, EMPD'95. Part 1 (of 2), Singapore, Singapore, .