Advertisement

Annals of Operations Research

, Volume 283, Issue 1–2, pp 591–612 | Cite as

Partial contraflow with path reversals for evacuation planning

  • Urmila PyakurelEmail author
  • Hari Nandan Nath
  • Tanka Nath Dhamala
S.I.: Applications of OR in Disaster Relief Operations

Abstract

The challenges in evacuation planning have been vital because of rapid disasters and limited road capacity. Contraflow strategy is very effective and widely accepted approach for the optimal use of available road network in evacuation management that increases the outward road capacities from the disastrous areas towards the safe destinations. Modeling the contraflow problem mathematically, there are available a number of efficient solution algorithms in literature, however, in general, the problem is still computationally quite hard. In this paper, we introduce the partial contraflow approach, in the abstract network setting with flow on paths and adapt the previous contraflow solution techniques to save unused capacities of road segments (elements) which can be used for supplying other facilities during emergency. We present efficient algorithms to solve the maximum static, lex-maximum static, maximum dynamic and earliest arrival partial contraflow problems on an abstract network. We also present an approximation algorithm to solve 2-value approximate earliest arrival transshipment partial contraflow problem for multi-terminal abstract network. Implementation of the partial contraflow reconfiguration leads to a significant improvement in increasing the flow values, decreasing the evacuation time, and utilizing the unused capacities of paths for humanitarian logistics and vehicle movements.

Keywords

Evacuation planning Partial contraflow Abstract flow Switching property Flow maximization 

Notes

Acknowledgements

The authors acknowledge the supports of DAAD Partnership Program and AvH Research Group Linkage Program in Graph Theory and Optimization at Central Department of Mathematics, Tribhuvan University. Additionally, the first author thanks AvH Foundation for supporting the postdoctoral research at TU Bergakademie Freiberg, Germany and the second author thanks UGC Nepal for PhD research fellowship. The authors would also like to thank the anonymous referees and the editor for their valuable suggestions to improve the quality of this paper.

References

  1. Altay, N., & Green III, W. G. (2006). OR/MS research in disaster operations management. European Journal of Operational Research, 175, 475–493.Google Scholar
  2. Aronson, J. E. (1989). A survey of dynamic network flows. Annals of Operations Research, 20, 1–66.CrossRefGoogle Scholar
  3. Arulselvan, A. (2009). Network model for disaster management. Ph.D. Thesis, University of Florida, USA.Google Scholar
  4. Cova, T., & Johnson, J. P. (2003). A network flow model for lane-based evacuation routing. Transportation Research Part A: Policy and Practice, 37, 579–604.CrossRefGoogle Scholar
  5. Dhamala, T. N. (2015). A survey on models and algorithms for discrete evacuation planning network problems. Journal of Industrial and Management Optimization, 11, 265–289.CrossRefGoogle Scholar
  6. Dhamala, T. N., & Pyakurel, U. (2013). Earliest arrival contraflow problem on series-parallel graphs. International Journal of Operations Research, 10, 1–13.Google Scholar
  7. Dhamala, T. N., & Pyakurel, U. (2016). Significance of transportation network models in emergency planning of urban cities. International Journal of Cities, People and Places, 2, 58–76.Google Scholar
  8. Duhamel, C., Santos, A. C., Brasil, D., Châtelet, E., & Birregah, B. (2016). Connecting a population dynamic model with a multi-period location-allocation problem for post-disaster relief operations. Annals of Operation Research, 247, 693–713.CrossRefGoogle Scholar
  9. Fleischer, L. K., & Tardos, E. (1998). Efficient continuous-time dynamic network flow algorithms. Operations Research Letters, 23, 71–80.CrossRefGoogle Scholar
  10. Ford, L. R., & Fulkerson, D. R. (1962). Flows in networks. Princeton: Princeton University Press.Google Scholar
  11. Hamacher, H. W., Heller, S., & Rupp, B. (2013). Flow location (FlowLoc) problems: Dynamic network flows and location models for evacuation planning. Annals of Operations Research, 207, 161–180.CrossRefGoogle Scholar
  12. Hamacher, H. W., & Tjandra, S. A. (2002). Mathematical modeling of evacuation problems: A state of the art. In M. Schreckenberger & S. D. Sharma (Eds.), Pedestrain and evacuation dynamics (pp. 227–266). Berlin: Springer.Google Scholar
  13. Hua, J., Ren, G., Cheng, Y., & Ran, B. (2014). An integrated contraflow strategy for multimodal evacuation. Mathematical Problems in Engineering.  https://doi.org/10.1155/2014/159473.Google Scholar
  14. Kappmeier, J.-P. W. (2015). Generalizations of flows over time with application in evacuation optimization. Ph.D. Thesis, Technical University, Berlin, Germany.Google Scholar
  15. Kappmeier, J.-P. W., Matuschke, J., & Peis, B. (2014). Abstract flows over time: A first step towards solving dynamic packing problems. Theoretical Computer Sciences, 544, 74–83.CrossRefGoogle Scholar
  16. Kim, S., Shekhar, S., & Min, M. (2008). Contraflow transportation network reconfiguration for evacuation route planning. IEEE Transactions on Knowledge and Data Engineering, 20, 1–15.CrossRefGoogle Scholar
  17. Lim, G. J., Baharnemati, M. R., & Kim, S. J. (2016). An optimization approach for real time evacuation reroute planning. Annals of Operation Research, 238, 375–388.CrossRefGoogle Scholar
  18. Martens, M. & McCormick, S. T. (2008). A polynomial algorithm for weighted abstract flow. In Proceedings of the 13th conference on integer programming and combinatorial optimization. Volume 5035 of Lecture notes in computer science (pp. 97–111). Berlin: Springer.Google Scholar
  19. Matuschke, J. (2014). Network flows and network design in theory and practice. Ph.D. Thesis, Technical University, Berlin, Germany.Google Scholar
  20. McCormick, S. T. (1996). A polynomial algorithm for abstract maximum flow. In Proceedings of the \(7^{th}\)annual ACM-SIAM symposium on discrete algorithms (pp. 490–497).Google Scholar
  21. Megiddo, N. (1974). Optimal flows in networks with multiple sources and sinks. Mathematical Programming, 7(1), 97–107.CrossRefGoogle Scholar
  22. Minieka, E. (1973). Maximal, lexicographic, and dynamic network flows. Operations Research, 21, 517–527.CrossRefGoogle Scholar
  23. Moriarty, K. D., Ni, D. & Collura, J. (2007). Modeling traffic flow under emergency evacuation situations: Current practice and future directions. In 86th Transportation Research Board annual meeting, Washington, D.C. http://works.bepress.com/daiheng_ni/24. Accessed 12 Nov 2017.
  24. Pascoal, M. M. B., Captivo, M. E. V., & Climaco, J. C. N. (2006). A comprehensive survey on the quickest path problem. Annals of Operations Research, 147(1), 5–21.CrossRefGoogle Scholar
  25. Pyakurel, U. & Dhamala, T. N. (2016). Continuous time dynamic contraflow models and algorithms. Advance in Operations Research, 1–7, Article ID 368587.Google Scholar
  26. Pyakurel, U. (2016). Evacuation planning problem with contraflow approach. Ph.D. Thesis, IOST, Tribhuvan University, Nepal.Google Scholar
  27. Pyakurel, U., & Dhamala, T. N. (2014). Earliest arrival contraflow model for evacuation planning. Neural, Parallel, and Scientific Computations [CNLS-2013], 22, 287–294.Google Scholar
  28. Pyakurel, U., & Dhamala, T. N. (2015). Models and algorithms on contraflow evacuation planning network problems. International Journal of Operations Research, 12, 36–46.CrossRefGoogle Scholar
  29. Pyakurel, U., & Dhamala, T. N. (2017a). Evacuation planning by earliest arrival contraflow. Journal of Industrial and Management Optimization, 13, 487–501.Google Scholar
  30. Pyakurel, U., & Dhamala, T. N. (2017b). Continuous dynamic contraflow approach for evacuation planning. Annals of Operation Research, 253, 573–598.CrossRefGoogle Scholar
  31. Pyakurel, U., Dhamala, T. N., & Dempe, S. (2017). Efficient continuous contraflow algorithms for evacuation planning problems. Annals of Operations Research (ANOR), 254, 335–364.CrossRefGoogle Scholar
  32. Pyakurel, U., Goerigk, M., Dhamala, T. N., & Hamacher, H. W. (2016). Transit dependent evacuation planning for Kathmandu valley: A case study. International Journal of Operations Research Nepal, 5, 49–73.Google Scholar
  33. Pyakurel, U., Hamacher, H. W., & Dhamala, T. N. (2014). Generalized maximum dynamic contraflow on lossy network. International Journal of Operations Research Nepal, 3, 27–44.Google Scholar
  34. Rebennack, S., Arulselvan, A., Elefteriadou, L., & Pardalos, P. M. (2010). Complexity analysis for maximum flow problems with arc reversals. Journal of Combinatorial Optimization, 19, 200–216.CrossRefGoogle Scholar
  35. Stefanello, F., Buriol, L. S., Hirsch, M. J., Pardalos, P. M., Querido, T., Resende, M. G. C., et al. (2017). On the minimization of traffic congestion in road networks with tolls. Annals of Operation Research, 249, 119–139.CrossRefGoogle Scholar
  36. Vogiatzis, C., Yoshida, R., Aviles-Spadoni, I., Imamoto, S., & Pardalos, P. M. (2013). Livestock evacuation planning for natural and man-made emergencies. International Journal of Mass Emergencies and Disasters, 31(1), 25–37.Google Scholar
  37. Yang, F., Yuan, Q., Du, S., & Liang, L. (2016). Reserving relief supplies for earthquake: A multi-attribute decision making of China Red Cross. Annals of Operation Research, 247, 759–785.CrossRefGoogle Scholar
  38. Yusoff, M., Ariffin, J., & Mohamed, A. (2008). Optimization approaches for macroscopic emergency evacuation planning: A survey. In Information Technology, ITSim, International Symposium (Vol. 3, No. 26–28, pp. 1–7). IEEE.Google Scholar
  39. Zhao, X., Feng, Z.-Y., Li, Y., & Bernard, A. (2016). Evacuation network optimization model with lane-based reversal and routing. Mathematical Problems in Engineering, 1273508, 1–12.Google Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  • Urmila Pyakurel
    • 1
    Email author
  • Hari Nandan Nath
    • 2
  • Tanka Nath Dhamala
    • 1
  1. 1.Central Department of MathematicsTribhuvan UniversityKathmanduNepal
  2. 2.Department of Mathematics, Bhaktapur Multiple CampusTribhuvan UniversityBhaktapurNepal

Personalised recommendations