Robust optimal discrete arc sizing for tree-shaped potential networks

DOI10.1007/s10589-019-00085-xzbMath1414.90240OpenAlexW2786927578WikidataQ128149474 ScholiaQ128149474MaRDI QIDQ2419569

Martin Robinius, Detlef Stolten, Lars Schewe, Lara Welder, Johannes Thürauf, Martin Schmidt

Publication date: 13 June 2019

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-019-00085-x

zbMATH Keywords

robust optimizationnetwork designscenario generationmixed-integer linear optimizationdiscrete arc sizingpotential networks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Mixed integer programming (90C11) Abstract computational complexity for mathematical programming problems (90C60) Deterministic network models in operations research (90B10)

Related Items (11)

Optimization of capacity expansion in potential-driven networks including multiple looping: a comparison of modelling approaches ⋮ Computing technical capacities in the European entry-exit gas market is NP-hard ⋮ Heuristic methods for minimum-cost pipeline network design -- a node valency transfer metaheuristic ⋮ A bilevel optimization approach to decide the feasibility of bookings in the European gas market ⋮ Structural properties of feasible bookings in the European entry-exit gas market system ⋮ Deciding feasibility of a booking in the European gas market on a cycle is in P for the case of passive networks ⋮ The impact of potential-based physics models on pricing in energy networks ⋮ Bookings in the European gas market: characterisation of feasibility and computational complexity results ⋮ Resilient layout, design and operation of energy-efficient water distribution networks for high-rise buildings using MINLP ⋮ Deciding the feasibility of a booking in the European gas market is coNP-hard ⋮ Global optimization for the multilevel European gas market system with nonlinear flow models on trees

Uses Software

• Gurobi
• Pyomo

Cites Work

• Unnamed Item
• Unnamed Item
• Single-commodity robust network design with finite and hose demand sets
• Optimal pipe-sizing problem of tree-shaped gas distribution networks
• On the optimal design of water distribution networks: a practical MINLP approach
• Optimization of pipe networks
• Routing of uncertain traffic demands
• Convex reformulations for solving a nonlinear network design problem
• Optimization of capacity expansion planning for gas transportation networks
• A reduction technique for natural gas transmission network optimization problems
• A parameter-free self-adapting boundary genetic search for pipe network optimization
• Evaluating Gas Network Capacities
• Provisioning virtual private networks under traffic uncertainty
• Solving the Pipe Network Analysis Problem Using Optimization Techniques
• Designing Least-Cost Nonblocking Broadband Networks
• Algorithmic results for potential‐based flows: Easy and hard cases
• Global Optimization of Nonlinear Network Design
• An MINLP Solution Method for a Water Network Problem
• Pyomo -- optimization modeling in Python

This page was built for publication: Robust optimal discrete arc sizing for tree-shaped potential networks