JOURNAL BROWSE
Search
Advanced SearchSearch Tips
An Evacuation Route Assignment for Multiple Exits based on Greedy Algorithm
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
An Evacuation Route Assignment for Multiple Exits based on Greedy Algorithm
Lee, Min Hyuck; Nam, Hyun Woo; Jun, Chul Min;
  PDF(new window)
 Abstract
Some studies were conducted for the purpose of minimizing total clearance time for rapid evacuation from the indoor spaces when disaster occurs. Most studies took a long time to calculate the optimal evacuation route that derived minimum evacuation time. For this reason, this study proposes an evacuation route assignment algorithm that can shorten the total clearance time in a short operational time. When lots of exits are in the building, this algorithm can shorten the total clearance time by assigning the appropriate pedestrian traffic volume to each exit and balances each exit-load. The graph theory and greedy algorithm were utilized to assign pedestrian traffic volume to each exit in this study. To verify this algorithm, study used a cellular automata-based evacuation simulator and experimented various occupants distribution in a building structure. As a result, the total clearance time is reduced by using this algorithm, compared to the case of evacuating occupants to the exit within shortest distance. And it was confirmed that the operation takes a short time In a large building structure.
 Keywords
Indoor Evacuation;Total Clearance Time;Optimal Evacuation Route;Traffic Assignment;Greedy Algorithm;
 Language
Korean
 Cited by
 References
1.
Cormen, T. H., Leiserson, C. E., Rivest, R. L. and Stein, C., 1990, Introduction to Algorithms, MIT Press, p. 329.

2.
Chalmet, L. G., Francis, R. L. and Saunders, P. B., 1982, Network models for building evacuation, Fire Technology, Vol. 18, No. 1, pp. 90-113. crossref(new window)

3.
Chen, P. H. and Feng, F., 2009, A fast flow control algorithm for real-time emergency evacuation in large indoor areas, Fire Safety Journal, Vol. 44, No. 5, pp. 732-740. crossref(new window)

4.
Fruin, J. J., 1992, Designing for pedestrians, Public Transportation United States, http://ntl.bts.gov/DOCS/11877/Chapter_8.html

5.
Gwynne, S., Galea, E. R., Owen, M., Lawrence, P. J. and Filippidis, L., 1999, A review of the methodologies used in the computer simulation of evacuation from the built environment, Building and Environment, Vol. 34, No. 6, pp. 741-749. crossref(new window)

6.
Hamacher, H. W. and Tjandra, S. A., 2001, Mathematical modelling of evacuation problems: A state of art, Fraunhofer-Institut fur Techno-und Wirtschaftsmathematik, Fraunhofer (ITWM), pp. 1-44.

7.
Kim, S., Shekhar, S. and Min, M., 2008, Contraflow transportation network reconfiguration for evacuation route planning, Knowledge and Data Engineering, IEEE Transactions on, Vol. 20, No. 8, pp. 1115-1129. crossref(new window)

8.
Kisko, T. M. and Francis, R. L., 1985, EVACNET+: a computer program to determine optimal building evacuation plans, Fire Safety Journal, Vol. 9, No. 2, pp. 211-220. crossref(new window)

9.
Kuligowski, E. D., Peacock, R. D. and Hoskins, B. L., 2005, A review of building evacuation models, MD: US Department of Commerce, National Institute of Standards and Technology, pp. 1-29.

10.
Kwak, S. Y., Nam, H. W. and Jun, C. M., 2012, An Optimal Model for Indoor Pedestrian Evacuation considering the Entire Distribution of Building Pedestrians, Journal of the Korean Society for Geospatial Information Science, Vol. 20, No. 2, pp. 23-29.

11.
Lovas, G. G., 1995, On performance measures for evacuation systems, European Journal of Operational Research, Vol. 85, No. 2, pp. 352-367 crossref(new window)

12.
Li, Q., Feng, Z., Li, Q. and Zong, X., 2010, Multiobjective evacuation route assignment model based on genetic algorithm, Proc. of the 18th International Conference, Geoinformatics, pp. 1-5.

13.
Lu, Q., George, B. and Shekhar, S., 2005, Capacity constrained routing algorithms for evacuation planning: A summary of results, Advances in spatial and temporal databases, Springer Berlin Heidelberg, pp. 291-307.

14.
Nam, H. W., Kwak, S. Y. and Jun, C. M., 2014, Developing a Cellular Automata-based Pedestrian Model Incorporating Physical Characteristics of Pedestrians, Journal of Korea Spatial Information Society, Vol. 22, No. 2, pp. 53-62.

15.
Pursals, S. C. and Garzon, F. G., 2009, Optimal building evacuation time considering evacuation routes, European Journal of Operational Research, Vol. 192, No. 2, pp. 692-699. crossref(new window)

16.
Pursals, S. C. and Garzon, F. G., 2013, Building evacuation: Principles for the analysis of basic structures through dynamic flow networks, Journal of Industrial Engineering and Management, Vol. 6, No. 4, pp. 831-859.

17.
Wang, X. and Liu, H., 2012, An evacuation algorithm for large buildings, Proc. of the 10th World Congress, Intelligent Control and Automation (WCICA), pp. 2497-2502

18.
Xie, J., Li, Q., Wan, Q. and Li, X., 2014, Near optimal allocation strategy for making a staged evacuation plan with multiple exits, Annals of GIS, Vol. 20, No. 3, pp. 159-168. crossref(new window)

19.
Yusoff, M., Ariffin, J. and Mohamed, A., 2008, Optimization approaches for macroscopic emergency evacuation planning: a survey, Proc. of the ITSim 2008, Information Technology, Vol. 3, pp. 1-7.