Abstract: Aiming at the problems of complex structures of large public buildings and difficulties in fire evacuation, an improved ant colony algorithm for optimizing evacuation paths was proposed.First,the Dijkstra algorithm is introduced for the basic ant colony algorithm(ACO),and the Dijkstra algorithm is used to calculate the suboptimal path with better globality to further strengthen the ini⁃tial pheromone distribution of the ant colony algorithm. Secondly,the transition probability,update rules,pheromone volatility coefficient, heuristic function, etc. of the ant colony algorithm are improved based on the real-time situation of the fire. Finally,a comparative simulation experiment is carried out on the improved ant colony algorithm. Experimental results show that the algorithm hasstrong global search ability and high search efficiency,can avoid entering the local optimal trap,and effectively improve the efficien⁃cy of fire evacuation path planning.

Key words: ant colony algorithm, evacuation path, fire evacuation, Dijkstra algorithm