Path optimization study for vehicles evacuation based on Dijkstra algorithm

Procedia Engineering

Volumn 71, Issue , 2014, Pages 159-165

  Chen, Yi Zhou ^a   Shen, Shi Fei ^a   Chen, Tao ^a   Yang, Rui ^a  

^a TSINGHUA UNIVERSITY   (China)

Author keywords

Dijkstra algorithm; Emergency event; Evacuation path; Optimization

Indexed keywords

ACCIDENTS; ALGORITHMS; DISASTER PREVENTION; FIRE EXTINGUISHERS; FIRES; OPTIMIZATION; POPULATION STATISTICS; ROADS AND STREETS; TRAFFIC CONTROL; VEHICLES;

DIJKSTRA ALGORITHMS; DYNAMIC ROAD NETWORKS; EMERGENCY EVACUATION; EMERGENCY EVENTS; EMERGENCY SITUATION; EVACUATION PATH; HIGH POPULATION DENSITY; PREDICTIVE METHODS;

FIRE PROTECTION;

EID: 84901851869     PISSN: 18777058     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1016/j.proeng.2014.04.023     Document Type: Conference Paper

References (12)

1. M. Xu, Y. Liu, Q. Huang, Y. Zhang, G. Luan, An improved Dijkstra shortest path algorithm for sparse network, in: Applied Mathematics and Computation 2007, (185), pp. 247-254.
2. Byung-In Kim, Sangwon Jeong. A comparison of algorithms for origin-destination matrix generation on real road networks and an approximation approach. in: Computers & Industrial Engineering, 2009, (56), pp. 70-76.
3. Sheffi Y, Mahmassni H, Powell W B. Evacuation studies for nuclear power plant sites: A new challenge for transportation engineering. In: ITE Journal, 1981, 35(6): pp. 2528-2535.
4. Hobeika A.G., Kim C. Comparison of traffic assignments in evacuation modeling. In: IEEE Transactions on Engineering Management, 1998, 45(2): pp 192-198.
5. Tuydes H, Ziliaskopoulos A. Tabu-based heuristic approach for optimization of network evacuation contraflow. Transportation Research Record 1964, 2006, pp. 157-168.
6. M. Thorup. Undirected single-source shortest paths with positive integer weights in linear time, in: Journal of the ACM, 1999, (46) pp. 362-394.
7. A.V. Goldberg, A simple shortest path algorithm with linear average time, in: Proc. 9th European Symposium on Algorithms (ESA 2001), in: Lecture Notes in Computer Science (LNCS), Vol. 2161, Springer-Verlag, 2001, pp. 230-241.
8. U. Meyer, Single-source shortest paths on arbitrary directed graphs in linear average time, in: Proc. 12th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2001, pp. 797-806.
9. U. Lauther, An extremely fast, exact algorithm for finding shortest paths in static networks with geographical background, in: IfGIprints 22, Institut für Geoinformatik, Université Münster, ISBN 3-936616-22-1, 2004, pp. 219-230.
10. R. Sedgewick, J. Vitter, Shortest paths in Euclidean graphs, Algorithm, 1986, (1) pp. 31-48.
11. D. Wagner, T. Willhalm, Geometric speed-up techniques for finding shortest paths in large sparse graphs, in: Proc. 11th European Symposium on Algorithms (ESA 2003), in: Lecture Notes in Computer Science (LNCS), Vol. 2832, Springer-Verlag, 2003, pp. 776-787.
12. James B Orlin, Kamesh Madduri. A faster algorithm for the single source shortest path problem with few distinct positive lengths, in: Journal of Discrete Algorithms, 2010, (8) pp. 189-198.