Dijkstra-Ant colony optimization algorithm for shortest and safest evacuation in high rise building

The successfulness of evacuation is defined by the ability of the evacuees to escape from the danger place safely in a short time. the three problems highlighted in this study are evacuees do not know the right route should they take to safe themselves especially in high rise building due to the complexity of the building. moreover,the provided evacuation map in the building is commonly not showing the shortest and safest path to assist evacuees in choosing the best route. furthermore,the shortest path algorithm needs additional features to support the directed graph in order to obtain the best result. the objectives of this study are to design and develop the evacuation route via the shortest path algorithm and to evaluate the evacuation route model in high rise building evacuation maps. the methods used are modelling the evacuation route from the original floor plan into 2d floor plan,and then generating the directed graph based on the distance between nodes and coordinate of nodes to generate the shortest and safest path based on the utilisation of dijkstra’s algorithm and dijkstra-ant colony optimization (daco). the results obtained are proven consistent in generating the shortest and safest path with the same distance. © 2017 penerbit utm press. all rights reserved.