IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v277y2019i1p52-61.html
   My bibliography  Save this article

A dynamic programming approach for the pipe network layout problem

Author

Listed:
  • Shiono, Naoshi
  • Suzuki, Hisatoshi
  • Saruwatari, Yasufumi

Abstract

This study addresses the optimization problem with the objective of designing a pipe network. An underground pipe network for geographically dispersed customers must be designed with consideration of the many candidate roads below which pipes are laid. The layout and pipe sizes must then be determined to minimize the pipe network construction cost. However, this problem has attracted little research attention to date. In this study, we first formulate mathematical optimization models under the assumption of a single source node in a planar graph. We then find that the cost-minimized pipe network has a tree structure if the diameter of each pipe is a continuous variable. Thereafter, we develop an exact algorithm based on dynamic programming. The time complexity of the algorithm is polynomial in the number of nodes, but exponential in the number of faces covering all demand nodes for a planar graph. In addition, we propose a method for assigning commercial pipe diameters to the tree using a commercial solver. The computational results for a real-world gas distribution network show that our method provides an efficient solution.

Suggested Citation

  • Shiono, Naoshi & Suzuki, Hisatoshi & Saruwatari, Yasufumi, 2019. "A dynamic programming approach for the pipe network layout problem," European Journal of Operational Research, Elsevier, vol. 277(1), pages 52-61.
    • Handle: RePEc:eee:ejores:v:277:y:2019:i:1:p:52-61
    DOI: 10.1016/j.ejor.2019.02.036
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221719301845
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2019.02.036?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Shiono, Naoshi & Suzuki, Hisatoshi, 2016. "Optimal pipe-sizing problem of tree-shaped gas distribution networks," European Journal of Operational Research, Elsevier, vol. 252(2), pages 550-560.
    2. Ranel E. Erickson & Clyde L. Monma & Arthur F. Veinott, 1987. "Send-and-Split Method for Minimum-Concave-Cost Network Flows," Mathematics of Operations Research, INFORMS, vol. 12(4), pages 634-664, November.
    3. Willard I. Zangwill, 1968. "Minimum Concave Cost Flows in Certain Networks," Management Science, INFORMS, vol. 14(7), pages 429-450, March.
    4. D’Ambrosio, Claudia & Lodi, Andrea & Wiese, Sven & Bragalli, Cristiana, 2015. "Mathematical programming techniques in water network optimization," European Journal of Operational Research, Elsevier, vol. 243(3), pages 774-788.
    5. Graça Gonçalves & Luís Gouveia & Margarida Pato, 2014. "An improved decomposition-based heuristic to design a water distribution network for an irrigation system," Annals of Operations Research, Springer, vol. 219(1), pages 141-167, August.
    6. Graça Gonçalves & Margarida Vaz Pato, 2000. "A three‐phase procedure for designing an irrigation system's water distribution network," Annals of Operations Research, Springer, vol. 94(1), pages 163-179, January.
    7. Salah Saleh & Tiku Tanyimboh, 2013. "Coupled Topology and Pipe Size Optimization of Water Distribution Systems," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 27(14), pages 4795-4814, November.
    8. De Corte, Annelies & Sörensen, Kenneth, 2013. "Optimisation of gravity-fed water distribution network design: A critical review," European Journal of Operational Research, Elsevier, vol. 228(1), pages 1-10.
    9. B. Rothfarb & H. Frank & D. M. Rosenbaum & K. Steiglitz & D. J. Kleitman, 1970. "Optimal Design of Offshore Natural-Gas Pipeline Systems," Operations Research, INFORMS, vol. 18(6), pages 992-1020, December.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Zhou, Jun & Zhao, Yunxiang & Fu, Tiantian & Zhou, Xuan & Liang, Guangchuan, 2022. "Dimension optimization for underground natural gas storage pipeline network coupling injection and production conditions," Energy, Elsevier, vol. 256(C).
    2. M. Blokland & R. D. van der Mei & J. F. J. Pruyn & J. Berkhout, 2023. "Literature Survey on Automatic Pipe Routing," SN Operations Research Forum, Springer, vol. 4(2), pages 1-56, June.
    3. Penghui Ma & Yajin Hu & Hansheng Liu & Yuannong Li, 2020. "The Optimum Design Criteria for On-demand Pressurized Microirrigation Network Systems: Optimizing Subunits with Paired Laterals based on the Maximum Size," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 34(10), pages 3237-3255, August.
    4. Yiyuan Pang & Hong Li & Pan Tang & Chao Chen, 2022. "Synchronization Optimization of Pipe Diameter and Operation Frequency in a Pressurized Irrigation Network Based on the Genetic Algorithm," Agriculture, MDPI, vol. 12(5), pages 1-16, May.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Liang, Yingzong & Hui, Chi Wai, 2018. "Convexification for natural gas transmission networks optimization," Energy, Elsevier, vol. 158(C), pages 1001-1016.
    2. Shiono, Naoshi & Suzuki, Hisatoshi, 2016. "Optimal pipe-sizing problem of tree-shaped gas distribution networks," European Journal of Operational Research, Elsevier, vol. 252(2), pages 550-560.
    3. Naoum-Sawaya, Joe & Ghaddar, Bissan & Arandia, Ernesto & Eck, Bradley, 2015. "Simulation-optimization approaches for water pump scheduling and pipe replacement problems," European Journal of Operational Research, Elsevier, vol. 246(1), pages 293-306.
    4. Fontes, Dalila B.M.M. & Hadjiconstantinou, Eleni & Christofides, Nicos, 2006. "A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems," European Journal of Operational Research, Elsevier, vol. 174(2), pages 1205-1219, October.
    5. Sushil Gupta & Hossein Rikhtehgar Berenji & Manish Shukla & Nagesh N. Murthy, 2023. "Opportunities in farming research from an operations management perspective," Production and Operations Management, Production and Operations Management Society, vol. 32(6), pages 1577-1596, June.
    6. Ralf Lenz & Kai Helge Becker, 2022. "Optimization of capacity expansion in potential-driven networks including multiple looping: a comparison of modelling approaches," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(1), pages 179-224, March.
    7. Guelpa, Elisa & Bischi, Aldo & Verda, Vittorio & Chertkov, Michael & Lund, Henrik, 2019. "Towards future infrastructures for sustainable multi-energy systems: A review," Energy, Elsevier, vol. 184(C), pages 2-21.
    8. DE CORTE, Annelies & SÖRENSEN, Kenneth, 2015. "A lean optimization algorithm for water distribution network design optimization," Working Papers 2015020, University of Antwerp, Faculty of Business and Economics.
    9. Bohong Wang & Yongtu Liang & Wei Zhao & Yun Shen & Meng Yuan & Zhimin Li & Jian Guo, 2021. "A Continuous Pump Location Optimization Method for Water Pipe Network Design," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 35(2), pages 447-464, January.
    10. Alemtsehay G. Seyoum & Tiku T. Tanyimboh, 2016. "Investigation into the Pressure-Driven Extension of the EPANET Hydraulic Simulation Model for Water Distribution Systems," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 30(14), pages 5351-5367, November.
    11. Cortés, Pablo & Muñuzuri, Jesús & Guadix, José & Onieva, Luis, 2013. "Optimal algorithm for the demand routing problem in multicommodity flow distribution networks with diversification constraints and concave costs," International Journal of Production Economics, Elsevier, vol. 146(1), pages 313-324.
    12. Hark‐Chin Hwang & Wilco van den Heuvel, 2012. "Improved algorithms for a lot‐sizing problem with inventory bounds and backlogging," Naval Research Logistics (NRL), John Wiley & Sons, vol. 59(3‐4), pages 244-253, April.
    13. Karla E. Bourland & Candace Arai Yano, 1996. "Lot sizing when yields increase during the production run," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(8), pages 1035-1047, December.
    14. Martel, Alain & Gascon, Andre, 1998. "Dynamic lot-sizing with price changes and price-dependent holding costs," European Journal of Operational Research, Elsevier, vol. 111(1), pages 114-128, November.
    15. Xiao, Yiyong & Kaku, Ikou & Zhao, Qiuhong & Zhang, Renqian, 2011. "A reduced variable neighborhood search algorithm for uncapacitated multilevel lot-sizing problems," European Journal of Operational Research, Elsevier, vol. 214(2), pages 223-231, October.
    16. Vernon Ning Hsu, 2000. "Dynamic Economic Lot Size Model with Perishable Inventory," Management Science, INFORMS, vol. 46(8), pages 1159-1169, August.
    17. Piñeyro, Pedro & Viera, Omar, 2010. "The economic lot-sizing problem with remanufacturing and one-way substitution," International Journal of Production Economics, Elsevier, vol. 124(2), pages 482-488, April.
    18. Trudeau, Christian, 2009. "Network flow problems and permutationally concave games," Mathematical Social Sciences, Elsevier, vol. 58(1), pages 121-131, July.
    19. Demeulemeester, Erik L. & Herroelen, Willy S. & Elmaghraby, Salah E., 1996. "Optimal procedures for the discrete time/cost trade-off problem in project networks," European Journal of Operational Research, Elsevier, vol. 88(1), pages 50-68, January.
    20. Chung‐Lun Li & Jinwen Ou & Vernon N. Hsu, 2012. "Dynamic lot sizing with all‐units discount and resales," Naval Research Logistics (NRL), John Wiley & Sons, vol. 59(3‐4), pages 230-243, April.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:277:y:2019:i:1:p:52-61. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.