Efficient continuous contraflow algorithms for evacuation planning problems
- 291 Downloads
A productive research in the emerging field of disaster management plays a quite important role in relaxing this disastrous advanced society. The planning problem of saving affected areas and normalizing the situation after any kind of disasters is very challenging. For the optimal use of available road network, the contraflow technique increases the outward road capacities from the disastrous areas by reversing the arcs. Number of efficient algorithms and heuristics handle this issue with contraflow reconfiguration on particular networks but the problem with multiple sources and multiple sinks is NP-hard. This paper concentrates on analytical solutions of continuous time contraflow problem. We consider the value approximation earliest arrival transshipment contraflow for the arbitrary and zero transit times on each arcs. These problems are solved with pseudo-polynomial and polynomial time complexity, respectively. We extend the concept of dynamic contraflow to the more general setting where the given network is replaced by an abstract contraflow with a system of linearly ordered sets, called paths satisfying the switching property. We introduce the continuous maximum abstract contraflow problem and present polynomial time algorithms to solve its static and dynamic versions by reversing the direction of paths. Abstract contraflow approach not only increases the flow value but also eliminates the crossing at intersections. The flow value can be increased up to double with contraflow reconfiguration.
KeywordsEvacuation planning Contraflow Abstract flow Switching property
The research is conducted under the Research Group Linkage Program entitled Optimization Models and Methods for Sustainable Development supported by Alexander von Humboldt Foundation. The second author acknowledges the support of DAAD under the partnership program, Graph Theory and Optimization with Applications in Industry and Society (GraTho), for the research stay at University of Kaiserslautern.
- Arulselvan, A. (2009). Network model for disaster management. Ph.D. Thesis, University of Florida.Google Scholar
- Baumann, N. (2007). Evacuation by earliest arrival flows. Ph.D. thesis, Department of Mathematics, University of Dortmund.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. & Dhamala, T. N. (2016). Efficient algorithms on abstract contraflow for evacuation planning. International Journal of Operations Research (IJOR-TW) (under review).Google Scholar
- Ford, F. R., & Fulkerson, D. R. (1962). Flows in networks. Princeton: Princeton University Press.Google Scholar
- Gross, M., Kappmeier, J-P. W., Schmidt, D. R. & Schmidt, M.(2012). Approximating earliest arrival flows in arbitrary networks. In L. Epstein and P. Ferragina (Eds.), Algorithms-ESA 2012, Lecture Notes in Computer Science (Vol. 7501, pp. 551–562).Google Scholar
- Hamacher, H. W. & Tjandra, S. A. (2002). Mathematical modeling of evacuation problems: A state of the art. In: M. Schreckenberger and S. D. Sharma (Eds.), Pedestrain and Evacuation Dynamics (pp. 227–266). Berlin: Springer.Google Scholar
- Hamza-Lup, G., Hua, K. A., Le, M., & Peng, R. (2004). Enhancing intelligent transportation systems to improve and support homeland security. In Proceedings of the seventh IEEE international conference, intelligent transportation systems (ITSC), pp. 250–255.Google Scholar
- Hua, J., Ren, G., Cheng, Y., & Ran, B. (2014). An integrated contraflow strategy for multimodal evacuation. Hindawi Publishing Corporation Mathematical Problems in Engineering (Vol. 2014).Google Scholar
- Kappmeier, J-P. W. (2015). Generalizations of flows over time with application in evacuation optimization. Ph.D. Thesis, Technical University, Berlin.Google Scholar
- Kim, S., & Shekhar, S. (2005). Contraflow network reconfiguration for evacuation planning: A summary of results. In Proceedings of 13th ACM symposium on advances in geographic information systems (GIS 05), pp. 250–259.Google Scholar
- Kotsireas, I. S., Nagurney, A. & Pardalos, P. M. (Eds.) (2015). Dynamics of disasters—key concepts, models, algorithms, and insights. Springer Proceedings in Mathematics and Statistics.Google Scholar
- Matuschke, J. (2014). Network flows and network design in theory and practice. Ph.D. Thesis, Technical University, Berlin.Google Scholar
- McCormick, S. T. (1996). A polynomial algorithm for abstract maximum flow. Proceedings of the 7th Annual ACM-SIAM symposium on discrete algorithms, pp. 490–497.Google Scholar
- Min, M., & Lee, J. (2013). Maximum throughput flow-based contraflow evacuation routing algorithm. In Third international workshop on pervasive networks for emergency management, San Diego, pp. 511–516.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.
- Pyakurel, U. (2016). Evacuation planning problem with contraflow approach. Ph.D. Thesis, IOST, Tribhuvan University, Nepal.Google Scholar
- Pyakurel, U., & Dhamala, T. N. (2014b). Earliest arrival contraflow model for evacuation planning. Neural, Parallel, and Scientific Computations, 22, 287–294.Google Scholar
- 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; Article ID 368587, pp. 1–7.Google Scholar
- Pyakurel, U. & Dhamala, T. N. (2016c). Continuous dynamic contraflow approach for evacuation planning. Annals of Operation Research (pp. 1–26). doi: 10.1007/s10479-016-2302-5.
- 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
- Tuydes, H. & Ziliaskopoulos, A. (2004). Network re-design to optimize evacuation contraflow. In Proceedings 83rd Annual Meeting of the Transportation Research Board.Google Scholar
- Tuydes, H. & Ziliaskopoulos, A. (2006). Tabu-based heuristic for optimization of network evacuation contraflow. In Proceedings, 85th annual meeting of the transportation research board.Google Scholar
- 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
- Vogiatzis, C., Walteros, J. L. & Pardalos, P. M. (2012). Evacuation through clustering techniques. In Models, algorithms, and technologies for network analysis, Proceedings in Mathematics and Statistics. Springer (vol. 32, pp. 185–198).Google Scholar
- Wolshon, B., Urbina, E. & Levitan, M. (2002). National review of hurricane evacuation plans and policies. Technical Report, Hurricane Center, Louisiana State University, Baton Rouge, Louisiana.Google Scholar
- Yusoff, M., Ariffin, J., & Mohamed, A. (2008). Optimization approaches for macroscopic emergency evacuation planning: A survey. In Information technology, ITSim, international symposium, IEEE, vol. 3, no. 26–28, pp. 1–7.Google Scholar
- 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