A dynamic programming approach for the pipe network layout problem

DOI10.1016/J.EJOR.2019.02.036MaRDI QIDQ1735166zbMATH OpenOpenAlexWikidataFDO

Authors Naoshi Shiono, Hisatoshi Suzuki, Yasufumi Saruwatari

Publication date 28 March 2019

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2019.02.036

zbMATH Keywords

dynamic programmingOR in energyminimum concave cost network flow problempipe network design

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Dynamic programming (90C39)

Recommendations

• Optimal pipe-sizing problem of tree-shaped gas distribution networks
• Optimization of pipe networks
• A Bilevel Programming Method for Pipe Network Optimization
• Optimal Dimensioning of Pipe Networks with Application to Gas Transmission Networks
• scientific article; zbMATH DE number 4108535

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 757683 (Why is no real title available?)
• A three-phase procedure for designing an irrigation system's water distribution network
• An improved decomposition-based heuristic to design a water distribution network for an irrigation system
• Combinatorial optimization. Theory and algorithms.
• Evaluating Gas Network Capacities
• Evaluation of selection algorithms for simultaneous layout and pipe size optimization of water distribution networks
• Faster exact algorithms for steiner trees in planar networks
• Faster shortest-path algorithms for planar graphs
• Graph theory
• Mathematical programming techniques in water network optimization
• Minimum Concave Cost Flows in Certain Networks
• Minimum concave-cost network flow problems: Applications, complexity, and algorithms
• Optimal Design of Gas Pipeline Networks
• Optimal pipe-sizing problem of tree-shaped gas distribution networks
• Optimisation of gravity-fed water distribution network design: a critical review
• Optimization of pipe networks
• Send-and-Split Method for Minimum-Concave-Cost Network Flows
• Steiner Tree in Planar Graphs: An O(nlogn) Approximation Scheme with Singly-Exponential Dependence on Epsilon
• The steiner problem in graphs

Cited in

(11)

• An optimized model for pipeline laying
• A Bilevel Programming Method for Pipe Network Optimization
• Computing the Minimum Cost Pipe Network Interconnecting One Sink and Many Sources
• Heuristic methods for minimum-cost pipeline network design -- a node valency transfer metaheuristic
• Optimal pipe-sizing problem of tree-shaped gas distribution networks
• Formulating and solving a radio astronomy antenna connection problem as a generalized cable-trench problem: an empirical study
• A method to design a hierarchical network of field pipelines by solving a sequence of extremal problems
• Optimal urban sewer layout design using Steiner tree problems
• scientific article; zbMATH DE number 4108535 (Why is no real title available?)
• Optimal discrete pipe sizing for tree-shaped \(\mathrm{CO}_2\) networks
• A graph-theoretic approach to explicit nonlinear pipe network optimization

Describes a project that uses

Uses Software

• Gurobi
• SCIP
• Matlab

This page was built for publication: A dynamic programming approach for the pipe network layout problem

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