Communication-Constrained Expansion Planning for Resilient Distribution Systems

DOI10.1287/IJOC.2019.0899MaRDI QIDQ5148181zbMATH OpenOpenAlexFDO

Authors Geunyeong Byeon, Pascal Van Hentenryck, Russell Bent, Harsha Nagarajan

Publication date 1 February 2021

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1801.03520

zbMATH Keywords

branch and pricecyber-physicalplanning for resiliencypower systemssystems distribution grid

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Abstract: Distributed generation and remotely controlled switches have emerged as important technologies to improve the resiliency of distribution grids against extreme weather-related disturbances. Therefore it becomes impor- tant to study how best to place them on the grid in order to meet a resiliency criteria, while minimizing costs and capturing their dependencies on the associated communication systems that sustains their distributed operations. This paper introduces the Optimal Resilient Design Problem for Distribution and Communi- cation Systems (ORDPDC) to address this need. The ORDPDC is formulated as a two-stage stochastic mixed-integer program that captures the physical laws of distribution systems, the communication connec- tivity of the smart grid components, and a set of scenarios which specifies which components are affected by potential disasters. The paper proposes an exact branch-and-price algorithm for the ORDPDC which features a strong lower bound and a variety of acceleration schemes to address degeneracy. The ORDPDC model and branch-and-price algorithm were evaluated on a variety of test cases with varying disaster inten- sities and network topologies. The results demonstrate the significant impact of the network topologies on the expansion plans and costs, as well as the computational benefits of the proposed approach.

Recommendations

• Robust transmission network expansion planning in energy systems: improving computational performance
• Transmission Network Expansion Planning Under Deliberate Outages
• Fault tolerant compensation strategy for stochastic distribution systems with communication constraints
• Connectivity-and-hop-constrained design of electricity distribution networks
• Power transmission network expansion planning: a semidefinite programming branch-and-bound approach
• A reactive grasp for transmission network expansion planning
• Multiobjective transmission expansion planning considering security and demand uncertainty

Cites work

• A scenario decomposition algorithm for 0-1 stochastic programs
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• scientific article; zbMATH DE number 1234104 (Why is no real title available?)
• On the choice of explicit stabilizing terms in column generation
• Selected Topics in Column Generation
• Stabilized column generation
• Stabilized column generation for highly degenerate multiple-depot vehicle scheduling problems

Cited in

(7)

• Operations research in optimal power flow: a guide to recent and emerging methodologies and applications
• A robust decision-support method based on optimization and simulation for wildfire resilience in highly renewable power systems
• Transmission Network Expansion Planning Under Deliberate Outages
• Optimal power flow in distribution networks under N- 1 disruptions: a multistage stochastic programming approach
• Optimal mitigation and control over power system dynamics for stochastic grid resilience
• A conceptual framework for determining the economically optimal level of microgrid resilience
• Optimizing microgrid deployment for community resilience

This page was built for publication: Communication-Constrained Expansion Planning for Resilient Distribution Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5148181)