Heuristic methods for minimum-cost pipeline network design -- a node valency transfer metaheuristic
DOI10.1007/S11067-021-09550-9OpenAlexW3205940065MaRDI QIDQ2129378FDOQ2129378
David Bruhn, Wolfgang Weinzierl, Christopher Yeates, Cornelia Schmidt-Hattenberger
Publication date: 22 April 2022
Published in: Networks and Spatial Economics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11067-021-09550-9
Recommendations
- A dynamic programming approach for the pipe network layout problem
- Computing the Minimum Cost Pipe Network Interconnecting One Sink and Many Sources
- Optimal pipe-sizing problem of tree-shaped gas distribution networks
- A heuristic algorithm for optimal cost design of gravity-fed water distribution networks. A real case study
- Design and dimensioning of hydrogen transmission pipeline networks
Operations research and management science (90Bxx) Mathematical programming (90Cxx) Operations research, mathematical programming (90-XX)
Cites Work
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Tabu Search—Part I
- An Oil Pipeline Design Problem
- Variable neighborhood search
- Branch-and-Bound Methods: A Survey
- Computing the Minimum Cost Pipe Network Interconnecting One Sink and Many Sources
- Design and dimensioning of hydrogen transmission pipeline networks
- Optimal Dimensioning of Pipe Networks with Application to Gas Transmission Networks
- Optimization of pipe networks
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
- Robust optimal discrete arc sizing for tree-shaped potential networks
- Dynamic Compressor Optimization in Natural Gas Pipeline Systems
This page was built for publication: Heuristic methods for minimum-cost pipeline network design -- a node valency transfer metaheuristic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2129378)
