A computationally efficient mixed-integer linear formulation for the thermal unit commitment problem
This paper presents a new mixed-integer linear formulation for the unit commitment problem of thermal units. The formulation proposed requires fewer binary variables and constraints than previously reported models, yielding a significant computational saving. Furthermore, the modeling framework prov...
Saved in:
| Published in: | IEEE transactions on power systems Vol. 21; no. 3; pp. 1371 - 1378 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
New York
IEEE
01.08.2006
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Subjects: | |
| ISSN: | 0885-8950, 1558-0679 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | This paper presents a new mixed-integer linear formulation for the unit commitment problem of thermal units. The formulation proposed requires fewer binary variables and constraints than previously reported models, yielding a significant computational saving. Furthermore, the modeling framework provided by the new formulation allows including a precise description of time-dependent startup costs and intertemporal constraints such as ramping limits and minimum up and down times. A commercially available mixed-integer linear programming algorithm has been applied to efficiently solve the unit commitment problem for practical large-scale cases. Simulation results back these conclusions |
|---|---|
| Bibliography: | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 content type line 23 |
| ISSN: | 0885-8950 1558-0679 |
| DOI: | 10.1109/TPWRS.2006.876672 |