Evaluate Quantum Combinatorial Optimization for Distribution Network Reconfiguration
This paper aims to implement and evaluate the performance of quantum computing on solving combinatorial optimization problems arising from the operations of the power grid. To this end, we construct a novel mixed integer conic programming formulation for the reconfiguration of radial distribution network in response to faults in distribution lines. Comparing to existing bus injection model in the literature, our formulation based the branch flows model is theoretically equivalent without needing non-explainable variables, thus being more numerically stable. The network reconfiguration model is then used as a benchmark to evaluate the performance of quantum computing algorithms in real quantum computers. It shows that while current quantum computing algorithms with fast execution time in quantum computers can be a promising solution candidate, its heuristic nature stem from its theoretical foundation should be considered carefully when applying into power grid optimization problems.
Code (1)
Tasks
Combinatorial OptimizationSimilar Papers 제목 키워드 기반
Bounded Combinatorial Reconfiguration with Answer Set Programming
We develop an approach called bounded combinatorial reconfiguration for solving combinatorial reconfiguration problems based on Answer Set Programming (ASP). The general task is to study the solution spaces of source com…
Feeder Load Balancing using Neural Network
The distribution system problems, such as planning, loss minimization, and energy restoration, usually involve the phase balancing or network reconfiguration procedures. The determination of an optimal phase balance is, …
Combinatorial OptimizationHamiltonian-based Quantum Reinforcement Learning for Neural Combinatorial Optimization
Advancements in Quantum Computing (QC) and Neural Combinatorial Optimization (NCO) represent promising steps in tackling complex computational challenges. On the one hand, Variational Quantum Algorithms such as QAOA can …
Combinatorial Optimizationreinforcement-learningReinforcement LearningDQAOA-GPT: AI-Accelerated Distributed Quantum Optimization for Combinatorial Problems
While combinatorial optimization problems are central to many scientific and engineering applications, their solution remains challenging due to exponentially large search spaces. Variational quantum algorithms offer a p…
Ising-based Consensus Clustering on Specialized Hardware
The emergence of specialized optimization hardware such as CMOS annealers and adiabatic quantum computers carries the promise of solving hard combinatorial optimization problems more efficiently in hardware. Recent work …
ClusteringCombinatorial Optimization