Academic Journal of Computing & Information Science, 2019, 2(2); doi: 10.25236/AJCIS.010041.

## Emergency Escape Route Planning for the Louvre Summary

Author(s)

Hongzhi Wang, Chenyang Wen, Yifeng Guo, Yangyang Zhou and Ming Zhu

Corresponding Author:
Hongzhi Wang
Affiliation(s)

Jinling Institute of Technology, Jiangshu Nanjing 210000, China

### Abstract

With more and more terror attacks in France, we established a model to plan routes for tourist evacuation and emergency personnel to enter the Louvre. This model allows tourists to evacuate the Louvre more quickly and safely while emergency personnel can reach all parts of the Louvre as soon as possible. We find out the "exits" that each visitor can reach in the shortest time through Ant Colony Optimization, and divide the area of the same "exits" tourists chose. According to the number of elevators chosen by tourists, the elevator with the least number is selected for emergency personnel. At the same time, by choosing the number of exits, we can determine whether the route is an exit to ground floor or to B2. Then, Poisson distribution calculation based on the probability of a visitor arriving at an elevator, and the waiting time of each elevator is calculated by Queuing Theory. Secondly, we use Logistic Model to simulate the population density growth of these two layers. Then, using population density distribution at each moment to help visitors choose the fastest exit.

### Keywords

Ant Colony Optimization, Route Planning, Queuing Theory, Flow Density

### Cite This Paper

Hongzhi Wang, Chenyang Wen, Yifeng Guo, Yangyang Zhou and Ming Zhu. Emergency Escape Route Planning for the Louvre Summary. Academic Journal of Computing & Information Science (2019), Vol. 2, Issue 2: 78-84. https://doi.org/10.25236/AJCIS.010041.

### References

[1] Parpinelli R S, Lopes H S, Freitas A A. Data mining with an ant colony optimization algorithm [J]. IEEE transactions on evolutionary computation, 2002, 6 (4): 321-332.
[2] Bast H, Delling D, Goldberg A, et al. Route planning in transportation networks [M]//Algorithm engineering. Springer, Cham, 2016: 19-80.
[3] Kim S, George B, Shekhar S. Evacuation route planning: scalable heuristics [C]//Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems. ACM, 2007: 20.
[4] Garcia-Ojeda J C, Bertok B, Friedler F. Planning evacuation routes with the Pgraph framework [J]. Chemical Engineering, 2012, 29.