A New Method for Unit Commitment at Electricite De France
IEEE Transactions on Power Apparatus and SystemsPublished 1 May 1983
A. Merlin, P. Sandrin
Citations417
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A new Lagrangian relaxation method is proposed, which produces optimal solutions for unit commitment and 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.
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
Computer ScienceMathematicsEngineering
Management ScienceThe Lagrangian Relaxation Method for Solving Integer Programming Problems
2,101 Citations1981Marshall L. Fisher
Operations ResearchGeneralized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
1,267 Citations1963Hugh Everett
Lagrangian Relaxation for Integer Programming
978 Citations2009Arthur M. Geoffrion
It is a pleasure to write this commentary because it offers an opportunity to express my gratitude to several people who helped me in ways that turned out to be essential to the birth of [8].
Operations ResearchAn Application of Lagrangian Relaxation to Scheduling in Power-Generation Systems
260 Citations1977John A. Muckstadt, Sherri A. Koenig
A branch-and-bound algorithm is proposed using a Lagrangian method to decompose the problem into single generator problems and a sub gradient method is used to select the Lagrange multipliers that maximize the lower bound produced by the relaxation.
IEEE Transactions on Power Apparatus and SystemsOptimal short-term thermal unit commitment
217 Citations1976Chee Khiang Pang, H.C. Chen
A truncated dynamic programming method for the commitment of thermal units over a period of up to 48 hours is described, such that the total cost is minimal.
IEEE Transactions on Power Apparatus and SystemsAn Application of Mixed-Integer Programming Duality to Scheduling Thermal Generating Systems
194 Citations1968John A. Muckstadt, Richard C. Wilson
A decomposable mixed-integer programming model for simultaneous economic consideration of unit commitment and short-term dispatch of thermal power generating equipment is presented and an optimum solution procedure is described which takes advantage of the structure of the model and promises computational efficiency in practical applications.
IEEE Transactions on Automatic ControlOptimization by decomposition and coordination: A unified approach
174 Citations1978Guy Cohen
In the general framework of inifinite-dimensional convex programming, two fundamental principles are demonstrated and used to derive several basic algorithms to solve a so-called "master" (constrained optimization) problem.
IEEE Transactions on Power Apparatus and SystemsSolution of Large-Scale Optimal Unit Commitment Problems
168 Citations1982Gerhard Lauer, N. Sandell +2 more
A preliminary computer implementation of the optimization model for large-scale unit commitment problems is able to reliably solve problems with 250 units over 12 (2-hour) time periods, and it is expected to be able to easily double these numbers.
IEEE Transactions on Power Apparatus and SystemsLarge Scale Hydro-Thermal Unit Commitment-Method and Results
144 Citations1971Roderick J. Johnson, H.H. Happ +1 more
IEEE Transactions on Power Apparatus and SystemsGenerator maintenance scheduling via successive approximations dynamic programming
137 Citations1975H.H. Zurn, V.H. Quintana
A piece-wise compromising method of solution is presented, which conveniently groups generating units and uses successive approximations dynamic programming and the grouping criterion presented appears to be the cornerstone of the superior performance of the proposed method.
IEEE Transactions on Automatic ControlOptimal scheduling of thermal generating units
91 Citations1978André Turgeon
The optimization problem is formulated in this paper as a mixed-integer nonlinear programming problem and results obtained for a network of ten generating units are presented.
IEE Proceedings D Control Theory and ApplicationsDecomposition approach to problem of unit commitment schedule for hydrothermal systems
41 Citations1980L. F. B. Baptistella, José C. Geromel
International Journal of Electrical Power & Energy SystemsDecomposition techniques in power system planning: the Benders partitioning method
35 Citations1979Gilles Côté, M.A. Laughton