A New Method for Unit Commitment at Electricite De France
- 1 May 1983
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Apparatus and Systems
- Vol. PAS-102 (5) , 1218-1225
- https://doi.org/10.1109/tpas.1983.318063
Abstract
Unit commitment is a complex problem which, until now and for real size systems, has been solved using heuristic methods only. This paper proposes a new Lagrangian relaxation method, which produces ε-optimal solutions. The flexibility of the algorithm is such that numerous developments can be envisaged, such as simultaneous management of pumping units, probabilistic determination of the spinning reserve, etc.Keywords
This publication has 11 references indexed in Scilit:
- The Lagrangian Relaxation Method for Solving Integer Programming ProblemsManagement Science, 1981
- Decomposition approach to problem of unit commitment schedule for hydrothermal systemsIEE Proceedings D Control Theory and Applications, 1980
- Decomposition techniques in power system planning: the Benders partitioning methodInternational Journal of Electrical Power & Energy Systems, 1979
- Optimal scheduling of thermal generating unitsIEEE Transactions on Automatic Control, 1978
- Optimization by decomposition and coordination: A unified approachIEEE Transactions on Automatic Control, 1978
- An Application of Lagrangian Relaxation to Scheduling in Power-Generation SystemsOperations Research, 1977
- Optimal short-term thermal unit commitmentIEEE Transactions on Power Apparatus and Systems, 1976
- A branch-and-bound algorithm for start-up and shut-down problem of thermal generating unitsElectrical Engineering in Japan, 1975
- An Application of Mixed-Integer Programming Duality to Scheduling Thermal Generating SystemsIEEE Transactions on Power Apparatus and Systems, 1968
- Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of ResourcesOperations Research, 1963