An official website of the United States government
Measuring and managing the risk of extensive distribution network outages during extreme events is critical for ensuring system-level energy balance in transmission network operations. However, existing risk measures used in stochastic optimization of power systems are computationally intractable for this problem involving large numbers of discrete random variables. Using a new coherent risk measure, Entropic Value-at-Risk (EVaR), that requires significantly less computational complexity, we propose an EVaR-constrained optimal power flow model that can quantify and manage the outage risk of extensive distribution feeders. The optimization problem with EVaR constraints on discrete random variables is equivalently reformulated as a conic programming model, which allows the problem to leverage the computational efficiency of conic solvers. The superiority of the proposed model is validated on the real-world Puerto Rico transmission grid combined with its large-scale distribution networks.
more »
« less
This content will become publicly available on February 17, 2026
Integrating quantum computing into building-to-grid control framework: Application of benders decomposition in mixed-integer nonlinear programming
Abstract Buildings use a large amount of energy in the United States. It is important to optimally manage and coordinate the resources across building and power distribution networks to improve overall efficiency. Optimizing the power grid with discrete variables was very challenging for traditional computers and algorithms, as it is an NP-hard problem. In this study, we developed a new optimization solution based on quantum computing for BTG integration. We first used MPC for building loads connected with a commercial distribution grid for cost reduction. Then we used discretization and Benders Decomposition methods to reformulate the problem and decompose the continuous and discrete variables, respectively. We used D-Wave quantum computer to solve dual problems and used conventional algorithm for primal problems. We applied the proposed method to an IEEE 9-bus network with 3 commercial buildings and over 300 residential buildings to evaluate the feasibility and effectiveness. Compared with traditional optimization methods, we obtained similar solutions with some fluctuations and improved computational speed from hours to seconds. The time of quantum computing was greatly reduced to less than 1% of traditional optimization algorithm and software such as MATLAB. Quantum computing has proved the potential to solve large-scale discrete optimization problems for urban energy systems.
more »
« less
- Award ID(s):
- 1949372
- PAR ID:
- 10575151
- Publisher / Repository:
- Springer
- Date Published:
- Journal Name:
- Building Simulation
- ISSN:
- 1996-3599
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Combinatorial optimization problems prevail in engineering and industry. Some are NP-hard and thus become difficult to solve on edge devices due to limited power and computing resources. Quadratic Unconstrained Binary Optimization (QUBO) problem is a valuable emerging model that can formulate numerous combinatorial problems, such as Max-Cut, traveling salesman problems, and graphic coloring. QUBO model also reconciles with two emerging computation models, quantum computing and neuromorphic computing, which can potentially boost the speed and energy efficiency in solving combinatorial problems. In this work, we design a neuromorphic QUBO solver composed of a swarm of spiking neural networks (SNN) that conduct a population-based meta-heuristic search for solutions. The proposed model can achieve about x20 40 speedup on large QUBO problems in terms of time steps compared to a traditional neural network solver. As a codesign, we evaluate the neuromorphic swarm solver on a 40nm 25mW Resistive RAM (RRAM) Compute-in-Memory (CIM) SoC with a 2.25MB RRAM-based accelerator and an embedded Cortex M3 core. The collaborative SNN swarm can fully exploit the specialty of CIM accelerator in matrix and vector multiplications. Compared to previous works, such an algorithm-hardware synergized solver exhibits advantageous speed and energy efficiency for edge devices.more » « less
-
Quantum computation shows promise for addressing numerous classically intractable problems, such as optimization tasks. Many optimization problems are NP-hard, meaning that they scale exponentially with problem size and thus cannot be addressed at scale by traditional computing paradigms. The recently proposed quantum algorithm arXiv:2206.14999 addresses this challenge for some NP-hard problems, and is based on classical semidefinite programming (SDP). In this manuscript, we generalize the SDP-inspired quantum algorithm to sum-of-squares programming, which targets a broader problem set. Our proposed algorithm addresses degree- polynomial optimization problems with variables (which are representative of many NP-hard problems) using qubits, quantum measurements, and classical calculations. We apply the proposed algorithm to the prototypical Max-SAT problem and compare its performance against classical sum-of-squares, state-of-the-art heuristic solvers, and random guessing. Simulations show that the performance of our algorithm surpasses that of classical sum-of-squares after rounding. Our results further demonstrate that our algorithm is suitable for large problems and approximates the best known classical heuristics, while also providing a more generalizable approach compared to problem-specific heuristics.more » « less
-
null (Ed.)By arbitraging among consumer comfort margins, buildings energy consumption can be changed by providing flexibility to grids. To manipulate the buildings energy consumption, a new contract-based approach to for multi-zone building heating, ventilation and air-conditioning (HVAC) systems is proposed. The approach includes the real-time markets by changing buildings optimal consumption pattern based on triggers sent by the aggregator. Also to decrease the energy consumption of buildings, the user is allowed to select the time-slots and rewards are provided to the user for aggregating flexibility. The aggregator bundles flexibility from the buildings at different time-slots and sells in real-time markets. The idea in aggregator's problem is to maximize aggregator's profits by selling flexibility in real-time markets (RTM) while ensuring the provisioning of flexibility from the buildings through incentives. To address this problem, we formulate it as a distributed optimization problem and then provide a method to solve it which provides good scalability, a requirement for large commercial buildings with multiple zones to participate in RTM. We illustrate the scalability and performance of the contract-based approach and solution technique in a building with 200 zones. Also, user participation based on their time-preferences is included in the proposed optimization. Finally, a scalable technique is shown which can be adopted in existing building automation systems.more » « less
-
Practical applications of quantum computing depend on fault-tolerant devices with error correction. We study the problem of compiling quantum circuits for quantum computers implementing surface codes. Optimal or near-optimal compilation is critical for both efficiency and correctness. The compilation problem requires (1)mappingcircuit qubits to the device qubits and (2)routingexecution paths between interacting qubits. We solve this problem efficiently and near-optimally with a novel algorithm that exploits thedependency structureof circuit operations to formulate discrete optimization problems that can be approximated viasimulated annealing, a classic and simple algorithm. Our extensive evaluation shows that our approach is powerful and flexible for compiling realistic workloads.more » « less
