基于改进蚁群算法的古建筑群火灾疏散路径规划  

Fire Evacuation Path Planning of Ancient Buildings Based on Improved Ant Colony Algorithm

作　　者：陈永鸿[1] 甘文杰 武蕾 杨宇范 CHEN Yong-hong;GAN Wen-jie;WU Lei;YANG Yu-fan(Faculty of Civil Engineering,Kunming University of Science and Technology,Kunming 650500,China)

机构地区：[1]昆明理工大学建筑工程学院,昆明650500

出　　处：《科学技术与工程》2023年第13期5662-5669,共8页Science Technology and Engineering

基　　金：国家自然科学基金(72061019);教育部人文社会科学研究规划基金(18XJAZH001)。

摘　　要：针对古建筑群突发火灾的情况下,为了在保证人员可安全通行的条件下规划出最短疏散路径,提出了一种基于改进蚁群算法的路径搜索模型,对算法的启发函数、回退策略、信息素浓度、信息素挥发系数进行了改进。并以云南大理巍山古城内部实际地形为例建立栅格图模型,通过仿真模拟实验对改进算法的参数组取值进行测试选取,确定参数组取值后,对改进蚁群算法的可行性进行仿真模拟实验,证明改进蚁群算法提高了算法的收敛速度和全局搜索性,降低了算法陷入局部最优解的可能性。In the case of the sudden fire of ancient buildings,in order to plan the shortest evacuation path under the condition of ensuring the safe passage of personnel,a path search model based on the enhanced ant colony algorithm was proposed.The heuristic function,backdown strategy,pheromone concentration and pheromone volatilization coefficient of the algorithm were improved.Taking the actual terrain of an ancient city in Yunnan as an example,a raster map model was established,and the parameter group values of the improved algorithm were examined and selected through simulation experiments.After the parameter group values were determined,the feasibility of the improved ant colony algorithm was simulated.It is proved that the improved ant colony algorithm improves the convergence speed and global search ability of the algorithm,and reduces the possibility of the algorithm falling into the local optimal solution.

关 键 词：古建筑群 蚁群算法 路径规划 火灾 

分 类 号：TP391.7[自动化与计算机技术—计算机应用技术]