On the complexity of the Unit Commitment Problem

  • Pascale Bendotti
  • Pierre Fouilhoux
  • Cécile Rottner
Short Note
  • 19 Downloads

Abstract

This article analyzes how the Unit Commitment Problem (UCP) complexity evolves with respect to the number n of units and T of time periods. A classical reduction from the knapsack problem shows that the UCP is NP-hard in the ordinary sense even for \(T=1\). The main result of this article is that the UCP is strongly NP-hard. When the constraints are restricted to minimum up and down times, the UCP is shown to be polynomial for a fixed n. When either a unitary cost or amount of power is considered, the UCP is polynomial for \(T=1\) and strongly NP-hard for arbitrary T. The pricing subproblem commonly used in a UCP decomposition scheme is also shown to be strongly NP-hard for a subset of units.

Keywords

Unit Commitment Problem Complexity Dynamic programming Subproblem of decomposition scheme 

Notes

Acknowledgements

The authors would like to thank Christoph Dürr for fruitful discussions.

References

  1. Bard, J. F. (1988). Short-term scheduling of thermal-electric generators using lagrangian relaxation. Operations Research, 36(5), 756–766.CrossRefGoogle Scholar
  2. Bendotti, P., Fouilhoux, P., & Rottner, C. (2018). The min-up/min-down unit commitment polytope. Journal of Combinatorial Optimization.  https://doi.org/10.1007/s10878-018-0273-y.
  3. Cohen, G. (1978). Optimization by decomposition and coordination: A unified approach. IEEE Transactions on Automatic Control, 1978, 23.Google Scholar
  4. Dubost, L., Gonzalez, R., & Lemaréchal, C. (2005). A primal-proximal heuristic applied to the french unit-commitment problem. Mathematical Programming, 104(1), 129–151.CrossRefGoogle Scholar
  5. Fan, W., Guan, X., & Zhai, Q. (2002). A new method for unit commitment with ramping constraints. Electric Power Systems Research, 62(3), 215–224.CrossRefGoogle Scholar
  6. Frangioni, A. (2005). About Lagrangian methods in integer optimization. Annals of Operations Research, 139, 163–193.CrossRefGoogle Scholar
  7. Frangioni, A., & Gentile, C. (2006). Solving nonlinear single-unit commitment problems with ramping constraints. Operations Research, 54(4), 767–775.CrossRefGoogle Scholar
  8. Gentile, C., Morales-Espana, G., & Ramos, A. (2016). A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints. EURO Journal on Computational Optimization, 5, 1–25.Google Scholar
  9. Knueven, B., Ostrowski, J., & Wang, J. (2017). The ramping polytope and cut generation for the unit commitment problem. INFORMS Journal on Computing (to appear).Google Scholar
  10. Morales-Espana, G., Gentile, C., & Ramos, A. (2015). Tight MIP formulations of the power-based unit commitment problem. OR Spectrum, 37(4), 929–950.CrossRefGoogle Scholar
  11. Pan, K., & Guan, Y. (2016). A polyhedral study of the integrated minimum-up/-down time and ramping polytope. Optimization Online. http://www.optimization-online.org/DB_HTML/2015/08/5070.html.
  12. Pan, K., Guan, Y., Watson, J. P., & Wang, J. (2016a). Strengthened MILP formulation for certain gas turbine unit commitment problems. IEEE Transactions on Power Systems, 31(2), 1440–1448.CrossRefGoogle Scholar
  13. Pan, K., Zhou, K., & Guan, Y. (2016b). Polynomial time algorithms and extended formulations for unit commitment problems. ArXiv e-prints.Google Scholar
  14. Papadimitriou, C., & Steiglitz, K. (1982). Combinatorial optimization: Algorithms and complexity. Englewood Cliffs, NJ: Prentice-Hall.Google Scholar
  15. Rajan, D., & Takriti, S. (2005). Minimum up/down polytopes of the unit commitment problem with start-up costs. IBM Research Report.Google Scholar
  16. Renaud, A. (1993). Daily generation management at Electricité de France: From planning towards real time. IEEE Transactions on Automatic Control, 38, 1080–1093.CrossRefGoogle Scholar
  17. Tseng, C. (1996). On power system generation unit commitment problems. Ph.D. thesis, UC Berkeley.Google Scholar
  18. Yu, W., Hoogeveen, H., & Lenstra, J. K. (2004). Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard. Journal of Scheduling, 7(5), 333–348.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Sorbonne Université, LIP6-CNRS (Laboratoire d’Informatique de Paris 6)ParisFrance
  2. 2.EDF R&DPalaiseauFrance

Personalised recommendations