Advanced SearchSearch Tips
Planning Evacuation Routes with Load Balancing in Indoor Building Environments
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
Planning Evacuation Routes with Load Balancing in Indoor Building Environments
Jang, Minsoo; Lim, Kyungshik;
  PDF(new window)
This paper presents a novel algorithm for searching evacuation paths in indoor disaster environments. The proposed method significantly improves the time complexity to find the paths to the evacuation exit by introducing a light-weight Disaster Evacuation Graph (DEG) for a building in terms of the size of the graph. With the DEG, the method also considers load balancing and bottleneck capacity of the paths to the evacuation exit simultaneously. The behavior of the algorithm consists of two phases: horizontal tiering (HT) and vertical tiering (VT). The HT phase finds a possible optimal path from anywhere of a specific floor to the evacuation stairs of the floor. Thus, after finishing the HT phases of all floors in parallel the VT phase begins to integrate all results from the previous HT phases to determine a evacuation path from anywhere of a floor to the safety zone of the building that could be the entrance or the roof of the building. It should be noted that the path produced by the algorithm. And, in order to define the range of graph to process, tiering scheme is used. In order to test the performance of the method, computing times and evacuation times are compared to the existing path searching algorithms. The result shows the proposed method is better than the existing algorithms in terms of the computing time and evacuation time. It is useful in a large-scale building to find the evacuation routes for evacuees quickly.
Evacuation;Indoor Navigation;Routing Algorithm;Load-Balance;
 Cited by
G. Ni, Z. Chen, J. Jiang, J. Luo, and Y. Ma, "Incremental Updates Based on Graph Theory for Consumer Electronic Devices," IEEE Transactions on Consumer Electronics, Vol.61, No.1, pp.128-136, 2015. crossref(new window)

C. Hernandez, T. Uras, S. Koenig, J. A. Baier, X. Sun, and P. Meseguer, "Reusing Cost-Minimal Paths for Goal-Directed Navigation in Partially Known Terrains," Autonomous Agents and Multi-Agent Systems, 2014.

J. Ahn and R. Han, "RescueMe: An Indoor Mobile Augmented-Reality Evacuation System by Personalized Pedometry," 2011 IEEE Asia-Pacific Services Computing Conference, pp.70-77, 2011.

W. Bian, Y. Guo, and Q. Qiu, "Research on Personalized Indoor Routing Algorithm," 2014 13th International Symposium on DCABES, pp.275-277, 2014.

L. S. C. Pun-Cheng, "An Interactive Web-Based Public Transport Enquiry System With Real-Time Optimal Route Computation," IEEE Transactions on Intelligent Transportation Systems, Vol.13, No.2, pp.983-988, 2012. crossref(new window)

H. Yu, M. Li, T. Liu, and Z. Ning, "Use Critical Sub-graph to Optimize the In-building Shortest Path Algorithm," 2012 3rd International Conference on Innovations in Bio-Inspired Computing and Applications, pp.323-328, 2012.

S. Chen and Y. Lin, "Search for All Minimal Paths in a General Large Flow Network," IEEE Transactions on Reliability, Vol.61, No.4, pp.949-956, 2012. crossref(new window)

D. J. Na, and K. H. Choi, "Step Trajectory/Indoor Map Feature-based Smartphone Indoor Positioning System without Using Wi-Fi Signals," IEMEK Journal of Embedded Systems and Applications, Vol.9, No.6, pp.323-334, 2014. crossref(new window)

T. S. Perry, "Navigating the Great Indoors," IEEE Spectrum, Vol.49, No.11, p.15, 2012. crossref(new window)

B. Xiao, J. Cao, Z. Shao, and E.H.-M. Sha, "An Efficient Algorithm for Dynamic Shortest Path Tree Update in Network Routing," Journal of Communications and Networks, Vol.9, No.4, pp.499-510, 2007. crossref(new window)

B. Pizzileo, P. Lino, B. Maione, and G. Maione, "A New Algorithm for Controlling Building Evacuation by Feedback on Hazard Level and Crowd Distribution," Proc. of IEEE Industrial Electronics Society Annual International Conference (IECON), pp.434-439, 2011.

E. Kim, Y. Kim, and J. Kim, "A Study on the Optimum Refuge Path Algorithm in Multiplex Building using the Human Movement Detection System," Journal of The Korean Digital Architecture.Interior Association, Vol.8, No.2, pp.13-20, 2008.

S. Kwak, H. Nam, and C. Jun, "An optimal Model for Indoor Pedestrian Evacuation considering the Entire Distribution of Building Pedestrians," Journal of The Korean Society for Geo-Spatial Information System, Vol.20, No.2, pp.23-29, 2012.

C. Kang, J. Lee, J. Song, and K. Jung, "Route Optimization for Emergency Evacuation and Response in Disaster Area," Journal of the Korean Society of Civil Engineers, Vol.34, No.2, pp.617-626, 2014. crossref(new window)

M. Jang, W. Jung, and K. Lim, "A Disaster Evacuation System Using Smart Devices for Indoor Crisis Management in BLE Environments," IEMEK Journal of Embedded Systems and Applications, Vol.10, No.5, pp.281-296, 2015. crossref(new window)

J. Sun and X. Li, "Indoor Evacuation Routes Planning with a Grid Graph-based Model," 2011 19th International Conference on Geoinformatics, pp.1-4, 2011.

T. Y. Wang, R. Huang, L. Li, W. G. Xu, and J. G. Nie, "The Application of the Shortest Path Algorithm in the Evacuation System," 2011 International Conference on ICM, Vol.2, pp.250-253, 2011.

C. Hernandez, T. Uras, S. Koenig, J. A. Baier, X. Sun, and P. Meseguer, "Reusing Cost-Minimal Paths for Goal-Directed Navigation in Partially Known Terrains," Autonomous Agents and Multi-Agent Systems, 2014.

R. Prim, "Shortest Connection Networks and Some Generalizations," Bell System Technical Journal, Vol.36, pp.1389-1401, 1957. crossref(new window)

S. Lee, "A Point-to-Point Shortest Path Search Algorithm in an Undirected Graph Using Minimum Spanning Tree," Journal of The Korea Society of Computer and Information, Vol.19, No.7, pp.103-111, 2014.

Ability Systems [Internet],

Korea Information Engineering Services [Internet],