Generalized Assignment Problem to Minimize Emergency Evacuation Routing in Istanbul Grand Bazaar

Abstract

In this study, the exit door assignment problem was discussed to determine routes with the shortest distance and least density for users of Istanbul Grand Bazaar in case of an emergency. The evacuation plan was considered as a Generalized Assignment Problem (GAP) which is a 0-1 mixed integer programming model. The components of the evaluation model consist of length, area, and user density as well as streets in the Grand Bazaar and their connection with the exterior. In the study, 12 gates in the Grand Bazaar which directly open onto roads and 15 nodal points among the junction points which are related to these gates were taken into consideration. A route is suggested with the aim of ensuring safe evacuation with minimum density and in the shortest time in any emergency case. The Grand Bazaar has more than one hundred thousand visitors daily depending on the season due to its characteristics of being the historical trade centre. Based on the study results, it is foreseen that there will be density at some gates in cases of emergency. Any evacuation plan in case of emergency must evaluate these routes and necessary physical precautions should be taken. At the same time, this evaluation may constitute the basis for improvement works devoted to the use of other gates.

Keywords

• Generalized assignment problem,Evacuation,Istanbul Grand Bazaar

References

1. R. L. Francis, “A 'Uniformity principle' for evacuation route allocation. Journal of Research of National Bureau of Standards”, 86, pp. 509-513, 1981.
2. S. C. Pursals and F. G. Garzon, “Optimal building evacuation time considering evacuation routes” European Journal of Operational Research, 192, pp. 692–699, 2009.
3. J. Kang, I.-J. Jeong and J.-B. Kwun, “Optimal facility–final exit assignment algorithm for building complex evacuation” Computers & Industrial Engineering, 85, pp. 169–176, 2015.
4. O. A. Cuesta, “Real-time evacuation route selection methodology for complex buildings”, Fire Safety Journal, 91, 947–954, 2017.
5. P.-H. Chen and F. Feng,“A fast flow control algorithm for real-time emergency evacuation in large indoor areas”, Fire Safety Journal, 44, 732–740, 2009.
6. C. Boonmee, M. Arimura and T. Asada, “Facility location optimization model for emergency humanitarian logistics” International Journal of Disaster Risk Reduction, 24, 485– 498, 2017.
7. S. Alighadr, A. Fallahi, J. Kiyono, F. N. Rizqi and M. Miyajima, “Emergency evacuation during a disaster, study case: Timche Muzaffariyye - Tabriz Bazaar”. 15WCEE World Conference Earthquake Engineering, (p. Paper No. 3370). Lisbon, Portugal, 2012.
8. L. Zhang, M. Liu, X. Wu, and S. M. AbouRizk, “Simulation-based route planning for pedestrian evacuation in metro stations: A case study”, Automation in Construction, 71, pp. 430–442, 2016.

9. H. Y. Şehsuvaroğlu, “Kapalıçarşı ve Tarihi. Türkiye Turing ve Otomobil Kurumu”, pp. 6-7, 1954.
10. Ç. Gülersoy, “Kapalı Çarşının Romanı”, İstanbul : İstanbul Kitaplığı Ltd. Yayını, 1979.
11. M. Cezar, “Tipik Yapılariyle Osmanlı Şehirciliğinde Çarşı ve Klasik Dönem İmar Sistemi” İstanbul: Mimar Sinan Üniversitesi Yayını, Milli Eğitim Basımevi, 1985.
12. A. Batur and G. Tanyeli, “1894 Depremi ve İstanbul’un Tarihi Yapılarındaki Hasar Üzerine Bir Örnekleme Çalışması: Kapalıçarşı”, 2.Ulusal Deprem Mühendisliği Konferansı, 244-252, İstanbul, 1993.
13. W. Müller-Wiener, “İstanbul’un Tarihsel Topografyası“, İstanbul: Yapı Kredi Yayınları, 2001.
14. G. Yücel, “Deprem Tehlikesi ve Tarihi Çarşılar: İstanbul Kapalıçarşı”, 3. Türkiye Deprem Mühendisliği ve Sismoloji Konferansı. İzmir: Dokuz Eylül Üniversitesi, 2015.
15. G. Yücel and G. Arun, “Istanbul Grand Bazaar Evacuation System Vulnerability Assessment”, Advanced Materials Research, 133-134, pp. 611-616, 2010.
16. K. Mortan and Ö. Küçükerman, (2007). “Çarşı, Pazar, Ticaret ve Kapalıçarşı”, Türkiye İş Bankası Kültür Yayınları, Ankara, 2007.
17. D. W. Pentico, “Assignment problems: A golden anniversary survey”, International Journal of Modern Physics B, 23(2), pp. 169-176, 2007.
18. G. T. Ross and R. M. Soland, “A branch and bound algorithm for the generalized assignment problem” Mathematical programming, 8 (1), pp. 91-103, 1975.
19. Z. Drezner, “A new genetic algorithm for the quadratic assignment problem”, INFORMS Journal on Computing, 15 (3), pp. 320–330, 2003.
20. A. N. Elshafei, “Hospital layout as a quadratic assignment problem”, Operational Research Quarterly, 28 (1), 167– 179, 1977.
21. R. Burkard, “Quadratic assignment problems”, European Journal of Operational Research, 15 (3), pp. 283–289, 1984.
22. L. Tsui and C.-H. Chang, “An optimal solution to a dock door assignment problem”, Computers & Industrial Engineering, 23 (1–4), pp. 283–286, 1992.
23. E. Çela, “The Quadratic Assignment Problem: Theory and Algorithms”, Dordrecht, The Netherlands: Kluwer Academic Publishers, 1998.
24. S. Bretschneider and A. Kimms, “A basic mathematical model for evacuation problems in urban areas”, Transportation Research Part A, 45, pp. 523-539, 2011.
25. H. Vermuyten, J. Belien, L. D. Boeck, G. Reniers and T. Wauters, “A review of optimisation models for pedestrian evacuation and design problems”, Safety Science, 87, pp. 167-178, 2016.
26. R. Swamy, J. Kang, R. Batta and Y. Chung, “Hurricane evacuation planning using public transportation”, SocioEconomic Planning Sciences, 59, pp. 43-55, 2017.
27. K. Ando, H. Ota and T. Oki, “Forecasting the flow of people”, RRR, Railway Research Review, 45(8), pp. 8–14 (in Japanese), 1988.
28. Transport Research Board. HCM Highway Capacity Manual. Highway Capacity Manual. National Research Council, National Academy of Science, 2000.