Efficient Algorithms for Abstract Flow with Partial Switching

Durga Prasad Khanal, Urmila Pyakurel (), Tanka Nath Dhamala and Stephan Dempe
Additional contact information
Durga Prasad Khanal: Tribhuvan University
Urmila Pyakurel: Tribhuvan University
Tanka Nath Dhamala: Tribhuvan University
Stephan Dempe: TU Bergakademie Freiberg

SN Operations Research Forum, 2022, vol. 3, issue 4, 1-17

Abstract: Abstract The tragic circumstances caused by natural or human-made (unexpected human or technological errors) hazard such as earthquakes, floods, glaciers, fires or industrial explosions causing significant physical damages, loss of lives or destruction of environment as well as economic and social life of people are known as disasters. Planned evacuation is essential to save the maximum number of evacuees in minimum time, which also helps in minimize losses. Due to mass dispatch (movement) of people aftermath of disaster, traffic scenario at the intersection of roads may create the disappointing situation if the vehicles have to wait for hours to cross the intersection. The main reason behind this is the lack of crossing elimination. In this paper, we discuss the partial switching property on an abstract network, in which crossing effect of roads is eliminated to transship optimal flow of evacuees. Due to the switching property, crossing of the flows at the intersections is diverted to non-crossing sides which can be a milestone to smooth the flows during evacuation. We present polynomial time solution procedures to solve abstract maximum static and dynamic flow problems with partial switching of paths. We also introduce the abstract quickest flow and quickest contraflow problems with partial switching and present polynomial time algorithms to solve the problems. For disaster management, maximum, quickest and contraflow problems on partially switched paths play an important role as the flow on a path system without crossing effect is very essential during evacuation process.

Keywords: Abstract network; Partial switching; Evacuation planning; Maximum flow; Quickest flow; Contraflow (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s43069-022-00168-2 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:snopef:v:3:y:2022:i:4:d:10.1007_s43069-022-00168-2

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/43069

DOI: 10.1007/s43069-022-00168-2

Access Statistics for this article

SN Operations Research Forum is currently edited by Marco Lübbecke

More articles in SN Operations Research Forum from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().