Next Article in Journal
Hybrid Contractions on Branciari Type Distance Spaces
Next Article in Special Issue
Dynamic Restructuring Framework for Scheduling with Release Times and Due-Dates
Previous Article in Journal
Universal Function Approximation by Deep Neural Nets with Bounded Width and ReLU Activations
Previous Article in Special Issue
Online Bi-Criteria Scheduling on Batch Machines with Machine Costs
Open AccessArticle

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

1
Central Department of Mathematics, Tribhuvan University, P.O. Box: 13143, Kathmandu, Nepal
2
TU Bergakademie, Fakultät für Mathematik und Informatik, 09596 Freiberg, Germany
*
Author to whom correspondence should be addressed.
Current address: TU Bergakademie, Fakultät für Mathematik und Informatik, 09596 Freiberg, Germany.
Mathematics 2019, 7(10), 993; https://doi.org/10.3390/math7100993
Received: 9 September 2019 / Revised: 16 October 2019 / Accepted: 16 October 2019 / Published: 19 October 2019
(This article belongs to the Special Issue Advances and Novel Approaches in Discrete Optimization)
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. View Full-Text
Keywords: network optimization; dynamic flow; evacuation planning; contraflow configuration; partial lane reversals, algorithms and complexity; logistic supports network optimization; dynamic flow; evacuation planning; contraflow configuration; partial lane reversals, algorithms and complexity; logistic supports
Show Figures

Figure 1

MDPI and ACS Style

Pyakurel, U.; Nath, H.N.; Dempe, S.; Dhamala, T.N. Efficient Dynamic Flow Algorithms for Evacuation Planning Problems with Partial Lane Reversal. Mathematics 2019, 7, 993.

Show more citation formats Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop