A Branch-and-Bound Algorithm for Unit Commitment
- 1 February 1983
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Apparatus and Systems
- Vol. PAS-102 (2) , 444-451
- https://doi.org/10.1109/tpas.1983.317714
Abstract
A new approach is presented for solving the unit commitment problem based on branch-and-bound techniques. The method incorporates time-dependent start-up costs, demand and reserve constraints and minimum up and down time constraints. It does not require a priority ordering of the units. The method can be extended to allow for a probabilistic reserve constraint. Preliminary computational results are reported.Keywords
This publication has 12 references indexed in Scilit:
- Unit commitment scheduling with stochastic reserve constraintPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1981
- Evaluation of Dynamic Programming Based Methods and Multiple area Representation for Thermal Unit CommitmentsIEEE Transactions on Power Apparatus and Systems, 1981
- 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
- Large Scale Hydro-Thermal Unit Commitment-Method and ResultsIEEE Transactions on Power Apparatus and Systems, 1971
- An Application of Mixed-Integer Programming Duality to Scheduling Thermal Generating SystemsIEEE Transactions on Power Apparatus and Systems, 1968
- Discrete Optimization Via Marginal AnalysisManagement Science, 1966
- Branch-and-Bound Methods: A SurveyOperations Research, 1966
- Unit CommitmentIEEE Transactions on Power Apparatus and Systems, 1966
- Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of ResourcesOperations Research, 1963