Skip to main content
SpringerLink
Log in

Continuous Dynamic Contraflow Approach for Evacuation Planning

  • Original Paper
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

The research in evacuation planning has been very much motivated due to the rapidly increased number of disasters world-wide. It is the process of shifting maximum number of evacuees from the disastrous areas to the safe destinations as quickly and efficiently as possible. The contraflow model allows the arc reversals that increase the outbound road capacities. In continuous time setting, the dynamic contraflow sends the maximum flow as a flow rate from the sources to the sinks in every moment of time unit. In this paper, we elaborate the mathematical model for the continuous dynamic contraflow problem. Moreover, we present computationally efficient algorithms to solve the different dynamic contraflow problems in continuous time model, for example, maximum dynamic, earliest arrival, lex-maximum dynamic, earliest arrival transshipment and quickest transshipment contraflows on particulars networks. Here, we study the theoretical development of continuous contraflow approach for evacuation planning issues. The proposed newly presented algorithms with continuous contraflow reconfiguration approach increase the flow value for given time horizon and also decrease the evacuation time needed to transship the given flow value. Here most of the newly proposed methods make use of temporally repeated flows.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

Similar content being viewed by others

References

  • Ahuja, R. K., Magnati, T. L., & Orlin, J. B. (1993). Network flows: Theory, algorithms and applications. Englewood Cliffs: Prentice Hall.

    Google Scholar 

  • Altay, N., & Green, I. I. I.-W. G. (2006). OR/MS research in disaster operations management. European Journal of Operational Research, 175, 475–493.

    Article  Google Scholar 

  • Anderson, E. J., Nash, P., & Philpott, A. B. (1982). A class of continuous network flow problems. Mathematics of Operations Research, 7, 501–514.

    Article  Google Scholar 

  • Anderson, E. J., & Philpott, A. B. (1994). Optimization of flows in networks over time. In F. P. Kelly (Ed.), Probability, Statistics and Optimization, Ch. 27 (pp. 369–382). New York: Wiley.

    Google Scholar 

  • Aronson, J. E. (1989). A survey of dynamic network flows. Annals of Operations Research, 20, 1–66.

    Article  Google Scholar 

  • Arulselvan, A. (2009). Network model for disaster management. PhD Thesis, University of Florida, USA.

  • Baumann, N. (2007). Evacuation by earliest arrival flows. PhD thesis, Department of Mathematics, University of Dortmund, Germany.

  • Baumann, N., & Skutella, M. (2009). Earliest arrival flows with multiple sources. Mathematics of Operations Research, 34, 499–512.

    Article  Google Scholar 

  • Burkard, R. E., Dlaska, K., & Klinz, B. (1993). The quickest flow problem. ZOR-Methods and Models of Operations Research, 37, 31–58.

    Article  Google Scholar 

  • Chen, L., & Miller-Hooks, E. (2008). The building evacuation problem with shared information. Naval Research Logistics, 55, 363–376.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • Dhamala, T. N., & Pyakurel, U. (2013). Earliest arrival contraflow problem on series-parallel graphs. International Journal of Operations Research, 10, 1–13.

    Google Scholar 

  • 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 

  • Dhungana, R. C., Pyakurel, U., Khadka, S. R., & Dhamala, T. N. (2015). Universally maximum contraflow for evacuation planning. International Journal of Operations Research, Nepal, 4, 67–78.

    Google Scholar 

  • Fleischer, L. (2001). Universally maximum flow with piecewise-constant capacities. Networks, 38, 115–125.

    Article  Google Scholar 

  • Fleischer, L. K., & Tardos, E. (1998). Efficient continuous-time dynamic network flow algorithms. Operations Research Letters, 23, 71–80.

    Article  Google Scholar 

  • Ford, F. R., & Fulkerson, D. R. (1958). Constructing maximal dynamic flows from static flows. Operations Research, 6, 419–433.

    Article  Google Scholar 

  • Ford, F. R., & Fulkerson, D. R. (1962). Flows in networks. Princeton, NJ: Princeton University Press.

    Google Scholar 

  • Gale, D. (1959). Transient flows in networks. Michigan Mathematical Journal, 6, 59–63.

    Article  Google Scholar 

  • Gross, M., Kappmeier1, J-P.W., Schmidt, D.R. & Schmidt, M. (2012). Approximating earliest arrival flows in arbitrary networks. Epstein, L., & Ferragina, P. (Eds.): ESA 2012 LNCS, 7501, 551–562.

  • Hajek, B., & Ogier, R. G. (1984). Optimal dynamic routing in communication networks with continuous traffic. Networks, 14, 457–487.

    Article  Google Scholar 

  • 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). Heidelberg: Springer.

    Google Scholar 

  • 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.

    Article  Google Scholar 

  • Hoppe, B. & Tardos, E. (1995). The quickest transshipment problem. Proceedings of the 6th annual ACM-SIAM Symposium on Discrete Algorithms, pp. 512–521.

  • Hoppe, B., & Tardos, E. (2000). The quickest transshipment problem. Mathematics of Operations Research, 25, 36–62.

    Article  Google Scholar 

  • Hoppe, B. E. (1995). Efficient dynamic network flow algorithms. PhD thesis, Cornell University.

  • Jarvis, J., & Ratliff, H. (1982). Some equivalent objectives for dynamic network flow problems. Management Science, 28, 106–108.

    Article  Google Scholar 

  • Kappmeier, J-P.W. (2015). Generalizations of flows over time with application in evacuation optimization, PhD Thesis, Technical University, Berlin, Germany.

  • Kim, S., & Shekhar, S. (2005). Contraflow network reconfiguration for evacuation planning: a summary of results. Proceedings of 13th ACM Symposium on Advances in Geographic Information Systems (GIS 05), 250–259.

  • 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.

    Article  Google Scholar 

  • Kotnyek, B. (2004). An annotated overview of dynamic network flows. Sophia Antipolis: INRIA.

    Google Scholar 

  • Megiddo, N. (1979). Combinatorial optimization with rational objective functions. Mathematics of Operations Research, 4, 414–424.

    Article  Google Scholar 

  • Minieka, E. (1973). Maximal, lexicographic, and dynamic network flows. Operations Research, 21, 517–527.

    Article  Google Scholar 

  • Moriarty, K.D., Ni, D., & Collura, J. (2007). Modeling traffic flow under emergency evacuation situations: Current practice and future directions. 86th Transportation Research Board Annual Meeting, Washington, D.C. http://works.bepress.com/daiheng_ni/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), 521.

    Article  Google Scholar 

  • Philpott, A. B. (1990). Continuous time flows in networks. Mathematics of Operations Research, 15, 640–661.

    Article  Google Scholar 

  • Pullan, Malcoln C. (1993). An algorithm for a class of continuous linear programs. SIAM Journal on Control and Optimization, 31, 1558–1577.

    Article  Google Scholar 

  • Pyakurel, U., & Dhamala, T. N. (2014a). Earliest arrival contraflow model for evacuation planning. Neural, Parallel, and Scientific Computations [CNLS-2013], 22, 287–294.

    Google Scholar 

  • Pyakurel, U. & Dhamala, T. N. (2014b). Lexicographically contraflow problem for evacuation planning. Proceedings of the Second International Conference, Operations Research Society Nepal, pp. 287–294.

  • Pyakurel, U., & Dhamala, T. N. (2015a). Models and algorithms on contraflow evacuation planning network problems. International Journal of Operations Research, 12, 36–46.

    Article  Google Scholar 

  • Pyakurel, U., & Dhamala, T. N. (2015b). Generalized contraflow approach for evacuation planning problem. Journal of Combinatorial Optimization, (under review).

  • Pyakurel, U., & Dhamala, T. N. (2016a). Evacuation planning by earliest arrival contraflow. Journal of Industrial and Management Optimization, 487–501. doi:10.3934/jimo.2016028.

  • Pyakurel, U., & Dhamala, T.N. (2016b). Continuous time dynamic contraflow models and algorithms. Advance in Operations Research; Volume (2016), Article ID 7902460, 7 pages.

  • 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 

  • 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.

    Article  Google Scholar 

  • Ruzika, S., Sperber, H., & Steiner, M. (2011). Earliest arrival flows on series–parallel graphs. Networks, 10, 169–173.

    Article  Google Scholar 

  • Schmidt, M., & Skutella, M. (2010). Earliest arrival flows in networks with multiple sinks. Electronics Notes in Discrete Mathematics, 36, 607–614.

    Article  Google Scholar 

  • Wilkinson, W. L. (1971). An algorithm for universal maximal dynamic flows in a network. Operations Research, 19, 1602–1612.

    Article  Google Scholar 

  • Yusoff, M., Ariffin, J., & Mohamed, A. (2008). Optimization approaches for macroscopic emergency evacuation planning: a survey. Information Technology, ITSim, International Symposium, IEEE, 3(26–28), 1–7.

    Google Scholar 

Download references

Acknowledgments

The second author would like to thank Alexander von Humboldt Foundation for the research support on evacuation planning. The authors would like to thank the anonymous referees and the editor for their valuable suggestions to improve the quality of this paper.

Author information

Authors and Affiliations

  1. Central Department of Mathematics, Tribhuvan University, P.O. Box 13143, Kathmandu, Nepal

    Urmila Pyakurel & Tanka Nath Dhamala

Authors
  1. Urmila Pyakurel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tanka Nath Dhamala
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Tanka Nath Dhamala.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Pyakurel, U., Dhamala, T.N. Continuous Dynamic Contraflow Approach for Evacuation Planning. Ann Oper Res 253, 573–598 (2017). https://doi.org/10.1007/s10479-016-2302-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-016-2302-5

Keywords

Search

Navigation