Path optimization study for vehicles evacuation based on Dijkstra algorithm

Citations of this article
Mendeley users who have this article in their library.


Emergency events, such as earthquakes, hurricanes, fires, chemical accidents, nuclear accidents, terror attacks and other events may led to injured or endanger the life and the health of human beings, and the large scale crowds have to evacuate from a danger area to a safe area by vehicles. In this paper, through observing real-time road network and analyzing three different emergency evacuation cases and the nodes, intersections delay and velocity of vehicles evacuation in the morning peak, common and evening peak. A dynamic road network model is built for vehicles evacuation based on Dijkstra algorithm. The optimal evacuation path is proposed in three different cases. The obtained outcomes provide well predictive method and theoretical basis for optimal emergency evacuation path selection and emergency rescue decision in public places, especially for those with high population density. So it seems very meaningful for us to cope with emergency situation or to prevent and mitigate disasters from the crisis events. © 2014 Published by Elsevier Ltd.




Chen, Y. Z., Shen, S. F., Chen, T., & Yang, R. (2014). Path optimization study for vehicles evacuation based on Dijkstra algorithm. In Procedia Engineering (Vol. 71, pp. 159–165). Elsevier Ltd.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free