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.