IDEAS home Printed from https://ideas.repec.org/a/spr/snopef/v6y2025i1d10.1007_s43069-024-00410-z.html
   My bibliography  Save this article

Maximum Dynamic FlowLoc with Intermediate Storage: A Temporally Repeated Approach

Author

Listed:
  • Sachin Wagle

    (Tribhuvan University)

  • Durga Prasad Khanal

    (Tribhuvan University)

  • Urmila Pyakurel

    (Tribhuvan University)

  • Stephan Dempe

    (TU Bergakademie)

  • Tanka Nath Dhamala

    (Tribhuvan University)

Abstract

The location-allocation of facilities in appropriate arcs is crucial in evacuation planning to provide basic needs to evacuees during the disaster. Locating a facility on an arc may decrease the optimal flow value. Also, because of the minimum cut capacity, all flows out from the source may not reach the sink. So the excess flow storage at intermediate nodes is considered in disaster scenarios. Similarly, for the two-way network, an optimal flow can be improved by contraflow configuration. In this paper, the maximum dynamic FlowLoc, the ContraFlowLoc, and the earliest arrival FlowLoc problems with intermediate storage are introduced and solved polynomially by using temporally repeated flows. We illustrate a case study of Kathmandu’s real network for the single facility maximum dynamic FlowLoc problem.

Suggested Citation

  • Sachin Wagle & Durga Prasad Khanal & Urmila Pyakurel & Stephan Dempe & Tanka Nath Dhamala, 2025. "Maximum Dynamic FlowLoc with Intermediate Storage: A Temporally Repeated Approach," SN Operations Research Forum, Springer, vol. 6(1), pages 1-20, March.
    • Handle: RePEc:spr:snopef:v:6:y:2025:i:1:d:10.1007_s43069-024-00410-z
    DOI: 10.1007/s43069-024-00410-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s43069-024-00410-z
    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-024-00410-z?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. Hari Nandan Nath & Urmila Pyakurel & Tanka Nath Dhamala & Fernando Bobillo, 2021. "Network Reconfiguration with Orientation-Dependent Transit Times," International Journal of Mathematics and Mathematical Sciences, Hindawi, vol. 2021, pages 1-11, March.
    2. 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.
    3. Edward Minieka, 1973. "Maximal, Lexicographic, and Dynamic Network Flows," Operations Research, INFORMS, vol. 21(2), pages 517-527, April.
    4. Horst Hamacher & Stephanie Heller & Benjamin Rupp, 2013. "Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning," Annals of Operations Research, Springer, vol. 207(1), pages 161-180, August.
    5. W. L. Wilkinson, 1971. "An Algorithm for Universal Maximal Dynamic Flows in a Network," Operations Research, INFORMS, vol. 19(7), pages 1602-1612, December.
    Full references (including those not matched with items on IDEAS)

    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. 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.
    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. Tanka Nath Dhamala & Anna Nagurney, 2023. "In Memoriam: Urmila Pyakurel (1980–2023)," SN Operations Research Forum, Springer, vol. 4(4), pages 1-13, December.
    4. Tanka Nath Dhamala & Mohan Chandra Adhikari & Durga Prasad Khanal & Urmila Pyakurel, 2024. "Generalized maximum flow over time with intermediate storage," Annals of Operations Research, Springer, vol. 335(1), pages 111-134, April.
    5. 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.
    6. Nadine Baumann & Martin Skutella, 2009. "Earliest Arrival Flows with Multiple Sources," Mathematics of Operations Research, INFORMS, vol. 34(2), pages 499-512, May.
    7. 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.
    8. 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.
    9. 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.
    10. 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.
    11. Pursals, Salvador Casadesús & Garzón, Federico Garriga, 2009. "Optimal building evacuation time considering evacuation routes," European Journal of Operational Research, Elsevier, vol. 192(2), pages 692-699, January.
    12. 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.
    13. Reza Faturechi & Shabtai Isaac & Elise Miller-Hooks & Lei Feng, 2018. "Risk-based models for emergency shelter and exit design in buildings," Annals of Operations Research, Springer, vol. 262(1), pages 185-212, March.
    14. Xuedong Yan & Xiaobing Liu & Yulei Song, 2018. "Optimizing evacuation efficiency under emergency with consideration of social fairness based on a cell transmission model," PLOS ONE, Public Library of Science, vol. 13(11), pages 1-21, November.
    15. Ryo Yamamoto & Atsushi Takizawa, 2019. "Partitioning Vertical Evacuation Areas in Umeda Underground Mall to Minimize the Evacuation Completion Time," The Review of Socionetwork Strategies, Springer, vol. 13(2), pages 209-225, October.
    16. 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.
    17. Horst Hamacher & Stephanie Heller & Benjamin Rupp, 2013. "Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning," Annals of Operations Research, Springer, vol. 207(1), pages 161-180, August.
    18. Bruce Hoppe & Éva Tardos, 2000. "The Quickest Transshipment Problem," Mathematics of Operations Research, INFORMS, vol. 25(1), pages 36-62, February.
    19. Jimoh Eniola Olaogbebikan & Richard Oloruntoba, 2019. "Similarities between disaster supply chains and commercial supply chains: a SCM process view," Annals of Operations Research, Springer, vol. 283(1), pages 517-542, December.
    20. Lara Turner & Dwi Groß & Horst Hamacher & Sven Krumke, 2015. "Static and dynamic source locations in undirected networks," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 23(3), pages 619-646, October.

    More about this item

    Keywords

    FlowLoc; ContraFlowLoc; Dynamic flows; Intermediate storage; Temporally repeated flow;
    All these keywords.

    JEL classification:

    • C6 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling
    • C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis

    Statistics

    Access and download statistics

    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:6:y:2025:i:1:d:10.1007_s43069-024-00410-z. 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.