Heuristic methods for minimum-cost pipeline network design -- a node valency transfer metaheuristic
From MaRDI portal
Publication:2129378
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
Cites work
- An Oil Pipeline Design Problem
- Branch-and-Bound Methods: A Survey
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
- Computing the Minimum Cost Pipe Network Interconnecting One Sink and Many Sources
- Design and dimensioning of hydrogen transmission pipeline networks
- Dynamic compressor optimization in natural gas pipeline systems
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Optimal Dimensioning of Pipe Networks with Application to Gas Transmission Networks
- Optimization of pipe networks
- Robust optimal discrete arc sizing for tree-shaped potential networks
- Tabu Search—Part I
- Variable neighborhood search
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)