A methodology for defining building evacuation routes

Abstract

This paper concerns an innovative methodology aimed towards specifying the best evacuation plan in a given scenario - where a scenario is characterised by the enclosure geometry, the population’s capabilities and the population distribution within the building. The best evacuation plan is assumed to be the one which minimises the movement time of the last evacuee. The problem faced is an optimisation problem where the cost function to be minimised is the last evacuee’s movement time and the research space is defined by all the possible evacuation plans in the given scenario. As this cost function could be a multi-peak function and since the research space is discrete and extremely large, a random search algorithm has been adopted. Given an evacuation plan, the proposed methodology models the evacuation over time with the aim of finding the movement time of the last evacuee. The modelling of the evacuation over time has to obey to two criteria. First, as it is embedded in the optimisation process and it has to be repeated a very high number of times (potentially for each possible evacuation plan), the computational cost is a critical issue: therefore the model has to be “synthetic” and microscopic models result not suitable. Secondly, the model cannot neglect flight behaviour and crowd crushes: therefore the need for a Dynamic Network Loading model which allows to keep track of the location of moving queues in the network, to predict spillbacks and dissipation and to model capacity drop due to clogging effects as well. The overall model has been implemented in an object-oriented simulator that allows analysis of large multi-floor buildings. The simulator has been applied to an illustrative problem of evaluating the best evacuation plan for a school: the application results are reported in the paper. The methodology application field is the straight forward evacuation, before the onset of hazardous conditions. In this context, the best evacuation plan is chosen off-line and the building occupants could be trained on the escape routes they have to follow from their origin rooms to the exit

A Network-Based Method for Modeling Pedestrian Evacuation in Indoor Areas

“…From the perspective of implementation purposes, these models can generally be divided into two categories, namely networkbased and area-based models. The network-based models, in which the spatial layout of a building is represented by a network based on the building's actual structure, can be used to evaluate the performance measures of evacuation plan [1][2][3][4]. The area-based models can be used to simulate the pedestrian dynamics in such closed areas as rooms, corridors and supermarkets.…”

A methodology for planning a new urban car sharing system with fully automated personal vehicles

“…Since there is no analytical expression for h k (s), we cannot exclude the need to deal with a multi-peak function and the risk of reaching a local minimum, without being able to find the global minimum, is high [5]. To combat this issue and the fact that the search space is extremely large, Simulated Annealing (SA) has been chosen to solve the minimization problem.…”

“…As in Cepolina [5], the geometric temperature reduction function has been used: T k +1 =α ⋅T k where T k and T k+1 are the temperatures in two consecutive iterations of the algorithm. Typically, 0.7≤α ≤0.95.…”

A new urban freight distribution scheme and an optimization methodology for reducing its overall cost

“…Moreover, the dependence of the system cost from the number of boxes is implicit. Simulated Annealing (SA) seems suitable for approaching problems with these characteristics [1]. The main parameters of the SA algorithm are: the cooling schedule, and the neighbor search criterion.…”