Efficient Dynamic Flow Algorithms for Evacuation Planning Problems with Partial Lane Reversal

Contraflow technique has gained a considerable focus in evacuation planning research over the past several years. In this work, we design efficient algorithms to solve the maximum, lex-maximum, earliest arrival, and quickest dynamic flow problems having constant attributes and their generalizations...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Mathematics (Basel) Jg. 7; H. 10; S. 993
Hauptverfasser: Pyakurel, Urmila, Nath, Hari Nandan, Dempe, Stephan, Dhamala, Tanka Nath
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Basel MDPI AG 01.10.2019
Schlagworte:
Algorithms
Approximation
contraflow configuration
Control theory
dynamic flow
Earthquakes
Emergency preparedness
Evacuation
evacuation planning
Heuristic
Humanitarianism
Integer programming
logistic supports
Mathematics
network optimization
Optimization techniques
partial lane reversals, algorithms and complexity
Planning
Polynomials
Reconfiguration
Road design
Time dependence
Traffic congestion
Traffic flow
Transit time
Transportation networks
Tsunamis
United States > US
Japan
Nepal
ISSN:2227-7390, 2227-7390
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Contraflow technique has gained a considerable focus in evacuation planning research over the past several years. In this work, we design efficient algorithms to solve the maximum, lex-maximum, earliest arrival, and quickest dynamic flow problems having constant attributes and their generalizations with partial contraflow reconfiguration in the context of evacuation planning. The partial static contraflow problems, that are foundations to the dynamic flows, are also studied. Moreover, the contraflow model with inflow-dependent transit time on arcs is introduced. A strongly polynomial time algorithm to compute approximate solution of the quickest partial contraflow problem on two terminal networks is presented, which is substantiated by numerical computations considering Kathmandu road network as an evacuation network. Our results show that the quickest time to evacuate a flow of value 100,000 units is reduced by more than 42% using the partial contraflow technique, and the difference is more with the increase in the flow value. Moreover, the technique keeps the record of the portions of the road network not used by the evacuees.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2227-7390
2227-7390
DOI:10.3390/math7100993