A Computationally Efficient Mixed-Integer Linear Formulation for the Thermal Unit Commitment Problem
Miguel Carrión, José M. Arroyo · IEEE Transactions on Power Systems · 2006
This paper presents a new mixed-integer linear formulation for the unit commitment problem of thermal units. The formulation proposed requires fewer binary variables and constraints than previously reported models, yielding a significant computational saving. Furthermore, the modeling framework provided by the new formulation allows including a precise description of time-dependent startup costs and intertemporal constraints such as ramping limits and minimum up and down times. A commercially available mixed-integer linear programming algorithm has been applied to efficiently solve the unit commitment problem for practical large-scale cases. Simulation results back these conclusions
Cited by 1,731 works. doi:10.1109/tpwrs.2006.876672
Authors
References
- Power Generation, Operation, and Control
- Integer and Combinatorial Optimization
- Power generation
- Market Operations in Electric Power Systems
- A New Method for Unit Commitment at Electricite De France
- A genetic algorithm solution to the unit commitment problem
- Towards a more rigorous and practical unit commitment by Lagrangian relaxation
- Applied Mathematical Programming
- Genetic algorithm solution to unit commitment problem
- Integer Programming Approach to the Problem of Optimal Unit Commitment with Probabilistic Reserve Determination