IDEAS home Printed from https://ideas.repec.org/h/spr/spochp/978-3-030-64973-9_14.html
   My bibliography  Save this book chapter

Universal Maximum Flow with Intermediate Storage for Evacuation Planning

In: Dynamics of Disasters

Author

Listed:
  • Urmila Pyakurel

    (Tribhuvan University)

  • Stephan Dempe

    (TU Bergakademie Freiberg)

Abstract

The evacuation planning problem models the process of shifting residents from emergency areas (sources) to safe places (sinks) as quickly and efficiently as possible. Most of the flow over time models used in the evacuation planning are based on the flow conservation constraints, i.e., the inflow should be equal to the outflow on each node except at the sources and sinks. We investigate the universal maximum flow problem with intermediate storage, i.e., the inflow may be greater than the outflow on intermediate nodes which maximizes the number of evacuees leaving the emergency areas at each point of time. We propose efficient algorithms to solve the problem on two-terminal series-parallel and general networks. We also discuss the solution technique for the problem with arc reversal capability and compare these solutions without and with intermediate storage.

Suggested Citation

  • Urmila Pyakurel & Stephan Dempe, 2021. "Universal Maximum Flow with Intermediate Storage for Evacuation Planning," Springer Optimization and Its Applications, in: Ilias S. Kotsireas & Anna Nagurney & Panos M. Pardalos & Arsenios Tsokas (ed.), Dynamics of Disasters, pages 229-241, Springer.
  • Handle: RePEc:spr:spochp:978-3-030-64973-9_14
    DOI: 10.1007/978-3-030-64973-9_14
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

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


    Cited by:

    1. 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.
    2. 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.

    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:spochp:978-3-030-64973-9_14. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.