A Quantum Computing Approach for the Unit Commitment Problem

Pascal Halffmann (), Patrick Holzer, Kai Plociennik and Michael Trebing
Additional contact information
Pascal Halffmann: Am Fraunhofer Platz 1
Patrick Holzer: Am Fraunhofer Platz 1
Kai Plociennik: Am Fraunhofer Platz 1
Michael Trebing: Am Fraunhofer Platz 1

Chapter Chapter 14 in Operations Research Proceedings 2022, 2023, pp 113-120 from Springer

Abstract: Abstract Planning energy production is a challenging task due to its cost-sensitivity, fast-moving energy markets, uncertainties in demand, and technical constraints of power plants. Thus, more complex models of this so-called unit commitment problem (UCP) have to be solved more rapidly, a task that probably can be solved more efficiently via quantum computing. In this article, we model a UCP with minimum running and idle times as a quadratic unconstrained optimization problem to solve it on quantum computing hardware. First experiments confirm the advantages of our formulation in terms of qubit usage and connectivity and most importantly solution quality.

Keywords: Quantum computing; Unit commitment problem; Quadratic programming; Energy planning (search for similar items in EconPapers)
Date: 2023
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:lnopch:978-3-031-24907-5_14

Ordering information: This item can be ordered from
http://www.springer.com/9783031249075

DOI: 10.1007/978-3-031-24907-5_14

Access Statistics for this chapter

More chapters in Lecture Notes in Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().