Feasible Route Determination Using Ant Colony Optimization in Evacuation Planning

Abstract

The most complex aspect of people movement on emergency condition is how to select the shortest way out from multi exit ways in the multi-floors building. The purpose of this paper is to demonstrate how an ant colony optimization (ACO) can be used in evacuation planning. Modified ACO applied as the algorithm to determine the feasible route during emergency evacuation. Physical obstacle during building evacuation such as bottleneck or disaster problem has been considered in transitional probability rule of ACO. By creating exit sign (an agent) with ACO as the algorithm, this agent decides the feasible route and guides the occupant during the evacuation. Two scenarios present to observe the performance of two different approaches in making decision during evacuation. When the obstacle appeared, route selection based on ACO algorithm has faster total evacuation time significantly than familiarity of environment exit method.