AN APPLICATION OF THE LAGRANGEAN RELAXATION METHOD TO UNIT COMMITMENT SCHEDULING IN A POWER-GENERATION SYSTEM WITH PUMPED-STORAGE UNITS
The Lagrangean relaxation method is applied to the unit commitment problem of a power generation system with pumped-storage units. The shortest path algorithm is used for the subproblem for each thermal unit and the minimal cost flow algorithm is used for each pumped-storage unit. A method for finding a better feasible solution from a solution of a relaxed problem is presented. A real Korean power generation system with 39 thermal units and one pumped-storage unit is tested. We considered 168 planning hours and we were able to find a near optimal solution (within 0.5% of optimal) consuming a reasonable amount of CPU time.
- Publisher
- PERGAMON-ELSEVIER SCIENCE LTD
- Issue Date
- 1993-01
- Language
- English
- Article Type
- Article
- Citation
COMPUTERS INDUSTRIAL ENGINEERING, v.24, no.1, pp.69 - 79
- ISSN
- 0360-8352
- Appears in Collection
- IE-Journal Papers(저널논문)
- Files in This Item
This item is cited by other documents in WoS
| ⊙ Detail Information in WoSⓡ | Click to see |  |
| ⊙ Cited 2 items in WoS | Click to see citing articles in |  |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.