IDEAS home Printed from https://ideas.repec.org/a/spr/snopef/v1y2020i4d10.1007_s43069-020-00033-0.html
   My bibliography  Save this article

Network Flow with Intermediate Storage: Models and Algorithms

Author

Listed:
  • Urmila Pyakurel

    (Tribhuvan University)

  • Stephan Dempe

    (TU Bergakademie Freiberg)

Abstract

Various network flow models, such as a flow maximization, a time minimization, a cost minimization, or a combination of them, have already been investigated. In most of the cases, they are considered subject to the flow conservation constraints. Here, we investigate the network flow models with intermediate storage, i.e., the inflow may be greater than the outflow at intermediate nodes. We introduce a maximum static and a maximum dynamic flow problem where an intermediate storage is allowed. Then, polynomial time algorithms are presented to solve these problems in two terminal general networks. We also study the earliest arrival property of the maximum dynamic flow in two terminal series-parallel networks and present its efficient solution procedure with intermediate storage. Moreover, we introduce a dynamic contraflow model with intermediate storage and present a polynomial time algorithm to solve the maximum dynamic contraflow problem in two terminal networks. We also solve an earliest arrival contraflow problem with intermediate storage. Our investigation is focused to solve the evacuation planning problem where the intermediate storage is permitted.

Suggested Citation

  • Urmila Pyakurel & Stephan Dempe, 2020. "Network Flow with Intermediate Storage: Models and Algorithms," SN Operations Research Forum, Springer, vol. 1(4), pages 1-23, December.
    • Handle: RePEc:spr:snopef:v:1:y:2020:i:4:d:10.1007_s43069-020-00033-0
    DOI: 10.1007/s43069-020-00033-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s43069-020-00033-0
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s43069-020-00033-0?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. Edward Minieka, 1973. "Maximal, Lexicographic, and Dynamic Network Flows," Operations Research, INFORMS, vol. 21(2), pages 517-527, April.
    2. Steffen Rebennack & Ashwin Arulselvan & Lily Elefteriadou & Panos M. Pardalos, 2010. "Complexity analysis for maximum flow problems with arc reversals," Journal of Combinatorial Optimization, Springer, vol. 19(2), pages 200-216, February.
    3. Bruce Hoppe & Éva Tardos, 2000. "The Quickest Transshipment Problem," Mathematics of Operations Research, INFORMS, vol. 25(1), pages 36-62, February.
    4. Urmila Pyakurel & Tanka Nath Dhamala & Stephan Dempe, 2017. "Efficient continuous contraflow algorithms for evacuation planning problems," Annals of Operations Research, Springer, vol. 254(1), pages 335-364, July.
    5. Urmila Pyakurel & Hari Nandan Nath & Tanka Nath Dhamala, 2019. "Partial contraflow with path reversals for evacuation planning," Annals of Operations Research, Springer, vol. 283(1), pages 591-612, December.
    6. Urmila Pyakurel & Tanka Nath Dhamala, 2017. "Continuous Dynamic Contraflow Approach for Evacuation Planning," Annals of Operations Research, Springer, vol. 253(1), pages 573-598, June.
    7. Qipeng Zheng & Ashwin Arulselvan, 2011. "Discrete time dynamic traffic assignment models and solution algorithm for managed lanes," Journal of Global Optimization, Springer, vol. 51(1), pages 47-68, September.
    8. James B. Orlin, 1993. "A Faster Strongly Polynomial Minimum Cost Flow Algorithm," Operations Research, INFORMS, vol. 41(2), pages 338-350, April.
    9. Cova, Thomas J. & Johnson, Justin P., 2003. "A network flow model for lane-based evacuation routing," Transportation Research Part A: Policy and Practice, Elsevier, vol. 37(7), pages 579-604, August.
    10. W. L. Wilkinson, 1971. "An Algorithm for Universal Maximal Dynamic Flows in a Network," Operations Research, INFORMS, vol. 19(7), pages 1602-1612, December.
    11. Omkar Achrekar & Chrysafis Vogiatzis, 2018. "Evacuation Trees with Contraflow and Divergence Considerations," Springer Optimization and Its Applications, in: Ilias S. Kotsireas & Anna Nagurney & Panos M. Pardalos (ed.), Dynamics of Disasters, pages 1-46, Springer.
    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. Shiva Prakash Gupta & Urmila Pyakurel & Tanka Nath Dhamala, 2023. "Multi-commodity flow problem on lossy network with partial lane reversals," Annals of Operations Research, Springer, vol. 323(1), pages 45-63, April.
    2. Durga Prasad Khanal & Urmila Pyakurel & Tanka Nath Dhamala & Stephan Dempe, 2022. "Efficient Algorithms for Abstract Flow with Partial Switching," SN Operations Research Forum, Springer, vol. 3(4), pages 1-17, December.
    3. Pyakurel, Urmila & Khanal, Durga Prasad & Dhamala, Tanka Nath, 2023. "Abstract network flow with intermediate storage for evacuation planning," European Journal of Operational Research, Elsevier, vol. 305(3), pages 1178-1193.

    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. Urmila Pyakurel & Hari Nandan Nath & Stephan Dempe & Tanka Nath Dhamala, 2019. "Efficient Dynamic Flow Algorithms for Evacuation Planning Problems with Partial Lane Reversal," Mathematics, MDPI, vol. 7(10), pages 1-29, October.
    2. Urmila Pyakurel & Tanka Nath Dhamala, 2017. "Continuous Dynamic Contraflow Approach for Evacuation Planning," Annals of Operations Research, Springer, vol. 253(1), pages 573-598, June.
    3. Pyakurel, Urmila & Khanal, Durga Prasad & Dhamala, Tanka Nath, 2023. "Abstract network flow with intermediate storage for evacuation planning," European Journal of Operational Research, Elsevier, vol. 305(3), pages 1178-1193.
    4. Urmila Pyakurel & Hari Nandan Nath & Tanka Nath Dhamala, 2019. "Partial contraflow with path reversals for evacuation planning," Annals of Operations Research, Springer, vol. 283(1), pages 591-612, December.
    5. Tanka Nath Dhamala & Urmila Pyakurel & Ram Chandra Dhungana, 2018. "Abstract Contraflow Models and Solution Procedures for Evacuation Planning," Journal of Mathematics Research, Canadian Center of Science and Education, vol. 10(4), pages 89-100, August.
    6. Shiva Prakash Gupta & Urmila Pyakurel & Tanka Nath Dhamala, 2023. "Multi-commodity flow problem on lossy network with partial lane reversals," Annals of Operations Research, Springer, vol. 323(1), pages 45-63, April.
    7. Durga Prasad Khanal & Urmila Pyakurel & Tanka Nath Dhamala & Stephan Dempe, 2022. "Efficient Algorithms for Abstract Flow with Partial Switching," SN Operations Research Forum, Springer, vol. 3(4), pages 1-17, December.
    8. Hong Zheng & Yi-Chang Chiu & Pitu B. Mirchandani, 2015. "On the System Optimum Dynamic Traffic Assignment and Earliest Arrival Flow Problems," Transportation Science, INFORMS, vol. 49(1), pages 13-27, February.
    9. Nadine Baumann & Martin Skutella, 2009. "Earliest Arrival Flows with Multiple Sources," Mathematics of Operations Research, INFORMS, vol. 34(2), pages 499-512, May.
    10. Jianghua Zhang & Yang Liu & Yingxue Zhao & Tianhu Deng, 2020. "Emergency evacuation problem for a multi-source and multi-destination transportation network: mathematical model and case study," Annals of Operations Research, Springer, vol. 291(1), pages 1153-1181, August.
    11. Urmila Pyakurel & Tanka Nath Dhamala & Stephan Dempe, 2017. "Efficient continuous contraflow algorithms for evacuation planning problems," Annals of Operations Research, Springer, vol. 254(1), pages 335-364, July.
    12. Yosuke Hanawa & Yuya Higashikawa & Naoyuki Kamiyama & Naoki Katoh & Atsushi Takizawa, 2018. "The mixed evacuation problem," Journal of Combinatorial Optimization, Springer, vol. 36(4), pages 1299-1314, November.
    13. Li Liu & Huan Jin & Yangguang Liu & Xiaomin Zhang, 2022. "Intelligent Evacuation Route Planning Algorithm Based on Maximum Flow," IJERPH, MDPI, vol. 19(13), pages 1-14, June.
    14. Lim, Gino J. & Zangeneh, Shabnam & Reza Baharnemati, M. & Assavapokee, Tiravat, 2012. "A capacitated network flow optimization approach for short notice evacuation planning," European Journal of Operational Research, Elsevier, vol. 223(1), pages 234-245.
    15. Xiaozheng He & Hong Zheng & Srinivas Peeta & Yongfu Li, 2018. "Network Design Model to Integrate Shelter Assignment with Contraflow Operations in Emergency Evacuation Planning," Networks and Spatial Economics, Springer, vol. 18(4), pages 1027-1050, December.
    16. Mukesh Rungta & Gino Lim & MohammadReza Baharnemati, 2012. "Optimal egress time calculation and path generation for large evacuation networks," Annals of Operations Research, Springer, vol. 201(1), pages 403-421, December.
    17. Denissa Sari Darmawi Purba & Eleftheria Kontou & Chrysafis Vogiatzis, 2021. "Evacuation Route Planning for Alternative Fuel Vehicles," Papers 2109.01578, arXiv.org, revised May 2022.
    18. Bretschneider, S. & Kimms, A., 2012. "Pattern-based evacuation planning for urban areas," European Journal of Operational Research, Elsevier, vol. 216(1), pages 57-69.
    19. Natashia Boland & Mike Hewitt & Luke Marshall & Martin Savelsbergh, 2017. "The Continuous-Time Service Network Design Problem," Operations Research, INFORMS, vol. 65(5), pages 1303-1321, October.
    20. Zhang, Nan & Huang, Hong & Su, Boni & Zhao, Jinlong, 2015. "Analysis of dynamic road risk for pedestrian evacuation," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 430(C), pages 171-183.

    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:spr:snopef:v:1:y:2020:i:4:d:10.1007_s43069-020-00033-0. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.