Abstract: Aiming at the influence of personnel congestion on evacuation route selection in the process of emergency evacuation, an improved ant colony algorithm evacuation path planning model in congested environment is proposed. Based on the two-dimensional grid environment, trap grids are identified, the diagonal grid environment model is established, and the initial pheromones are differentiated to improve the problem of blind search in the initial stage of the ant colony algorithm. The heuristic function is improved by combining the degree of path congestion and the influence of the end point on the ant path selection, avoiding falling into local optimum and improving the quality of the search path. The pheromone attenuation coefficient is introduced to penalize the path passing through the congested areas, and the suboptimal path obtained by Dijkstra algorithm is combined to improve the update method of pheromone. Through the shortest path optimization operation, the invalid nodes and redundant inflection points of the shortest path are reduced, and the smoothness of the path is improved. The comparative analysis of the simulation experimental results shows that the improved ant colony algorithm can quickly and efficiently plan a smoother and optimal evacuation route with or without congestion.

Key words: congested environment, evacuation path planning, ant colony algorithm, shortest path optimization

摘要： 针对突发事件疏散过程中人员拥堵对于疏散路径选择的影响，提出拥堵环境下的改进蚁群算法疏散路径规划模型。以二维栅格环境为基础，识别陷阱栅格，建立角栅格环境模型，对初始信息素进行差异化处理，改善蚁群算法初期搜索较为盲目的问题；结合路径拥堵程度和终点对蚂蚁路径选择的影响改进启发函数，避免陷入局部最优，提高搜索路径质量；引入信息素衰减系数惩罚经过拥堵区域的路径，并结合Dijkstra算法得到的次优路径，改进信息素的更新方式；通过最短路径优化操作，减少最短路径的无效节点与多余转折点，提高路径平滑度。仿真实验结果的对比分析表明，改进后的蚁群算法在有无拥堵情况下都能快速高效地规划出更平滑的最优疏散路径。

关键词: 拥堵环境, 疏散路径规划, 蚁群算法, 最短路径优化