Optimization of capacity expansion in potential-driven networks including multiple looping: a comparison of modelling approaches
DOI10.1007/S00291-021-00648-7zbMATH Open1486.90059OpenAlexW2892189352MaRDI QIDQ2125366FDOQ2125366
Publication date: 14 April 2022
Published in: OR Spectrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00291-021-00648-7
Recommendations
- Optimization of capacity expansion planning for gas transportation networks
- Mixed integer linear models for the optimization of dynamical transport networks
- Gas network extension planning for multiple demand scenarios
- A decomposition approach for optimal gas network extension with a finite set of demand scenarios
- Mathematical optimization for evaluating gas network capacities
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Nonlinear programming (90C30) Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06)
Cites Work
- Benchmarking optimization software with performance profiles.
- Über ein Paradoxon aus der Verkehrsplanung
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- Optimization of capacity expansion planning for gas transportation networks
- Effective relaxations and partitioning schemes for solving water distribution network design problems to global optimality
- Design and dimensioning of hydrogen transmission pipeline networks
- Design and operations of gas transmission networks
- Optimal Design of Gas Pipeline Networks
- On the optimal design of water distribution networks: a practical MINLP approach
- Solving the Pipe Network Analysis Problem Using Optimization Techniques
- Global Optimization of Nonlinear Network Design
- Optimal Dimensioning of Pipe Networks with Application to Gas Transmission Networks
- Optimal pipe-sizing problem of tree-shaped gas distribution networks
- Optimization of pipe networks
- Evaluating Gas Network Capacities
- The Gas Transmission Problem Solved by an Extension of the Simplex Algorithm
- A Bilevel Programming Method for Pipe Network Optimization
- A decomposition approach for optimal gas network extension with a finite set of demand scenarios
- A system to evaluate gas network capacities: concepts and implementation
- Convex Relaxations for Gas Expansion Planning
- Braess's paradox and power-law nonlinearities in networks
- Robust optimal discrete arc sizing for tree-shaped potential networks
- Optimal dimensioning of pipe networks: the new situation when the distribution and the transportation functions are disconnected
- Gas Network Extension Planning for Multiple Demand Scenarios
- Distribution network optimization: Finding the most economic solution by using genetic algorithms
- Non-linear network problems
- Optimal diameter assignment for gas pipeline networks
Cited In (2)
Uses Software
This page was built for publication: Optimization of capacity expansion in potential-driven networks including multiple looping: a comparison of modelling approaches
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2125366)