Abstract
Finding reliable paths for timely access and evacuation in emergency situations such as earthquakes, hurricanes, and chemical explosions is critical. However, it is difficult to find reliable routes because of uncertain road conditions, including traffic jams, road closures, and other hazards associated with emergency situations. This paper presents a link-based shortest path algorithm (SPA) for use in evacuation. The main merit of the proposed model is its provision of efficient alternative paths for evacuation routing with overlaps among paths and road operations taken into consideration. The method is evaluated through a numerical example.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ahuja, R. K., Magnanti, T. L., and Orlin, J. B. (1993). Network flows: Theory, Algorithms and Applications, Prentice Hall.
Akgun, A., Erkut, E., and Batta, R. (2000). “On finding dissimilar paths.” European Journal of Operational Research, Vol. 121, pp. 232–246.
Barra, T., Perez, B., and Anez, J. (1993). “Multidimensional path search and assignment.” Proc. of 21 st PTRC Summer Annual Conference, Mancnester, UK.
Bellman, R. E. (1957). Dynamic programming, Princeton University Press, Princeton.
Caldwell, T. (1961). On finding minimum routes in a network with turn penalties, Commum, ACM4, pp. 107–108.
Campos, V. B. G., da Silva, P. A. L., and Netto, P. O. B. (2000). “Evacuation transportation planning; A method of identifying optimal independent routes.” In: Surcharov, L. J., Ed., Proceedings of Urban Transport V, WIT Press, Southampton, pp. 555–564.
Desrochers, M., Lenstra, J. K., Savlesbergh, M. W. P., and Soumis, F. (1988). Vehicle routing with time windows: Optimization and approximation, Vehicle Routing: Methods and Studies, North-Holland, Elsevier Science Publishers, B.V.
Dijkstra, E. W. (1959). “A note on two problems in connection with graphs.” Numer. Math., Vol. 1, pp. 269–271.
Jayakrishnan, R., Tsai, W. K., and Chen, A. (1995). “A dynamic traffic assignment model with traffic-flow relationships.” Transportation Research (C), Vol. 3, No. 1, pp. 51–72.
Kim, I. (1998). “Development of a modified vine building shortest path algorithm for ATIS.” Journal of Korean Society of Transportation, Vol. 16, No. 2, pp. 157–167.
Lim, Y. and Kim, H. (2005). “A shortest path algorithm for real road network based on path overlap.” Journal of the Eastern Asia Society for Transportation Studies, Vol. 6, pp. 1426–1438.
Lu, Q., George, B., and Shekhar, S. (2005). “Capacity constrained routing algorithm for evacuation planning: A summary of results.” Lecture Notes in Computer Science, Vol. 3633, pp. 291–307.
Potts, R. B. and Oliver, R. M. (1972). Flows in transportation networks, Academic Press.
Scott, K., Pabon-Jimenez, G., and Bernstein, D. (1997). “Finding alternatives to the best path.” Presented at the 76 th Annual Meeting of the Transportation Research Board, Washington, DC.
Shier, R. D. (1979). “On algorithms from finding the k shortest paths in a network.” Networks, Vol. 9, pp. 195–214.
Yen, J. Y. (1971). “Finding the K shortest loopless paths in a network.” Management Science, Vol. 17, No. 11, pp. 712–716.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Lim, Y., Rhee, S. An efficient dissimilar path searching method for evacuation routing. KSCE J Civ Eng 14, 61–67 (2010). https://doi.org/10.1007/s12205-010-0061-4
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12205-010-0061-4