ISSN:
1573-2878
Keywords:
power system scheduling
;
unit commitment
;
unit decommitment
;
mixed-integer programming
;
Lagrangian relaxation
;
heuristic procedures
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Abstract In this paper, we present a unified decommitment method to solve the unit commitment problem. This method starts with a solution having all available units online at all hours in the planning horizon and determines an optimal strategy for decommitting units one at a time. We show that the proposed method may be viewed as an approximate implementation of the Lagrangian relaxation approach and that the number of iterations is bounded by the number of units. Numerical tests suggest that the proposed method is a reliable, efficient, and robust approach for solving the unit commitment problem.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1023/A:1004653526131
Permalink
