首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于蚁群算法的矿井火灾救灾最短路径研究
引用本文:徐晓冰.基于蚁群算法的矿井火灾救灾最短路径研究[J].成都航空职业技术学院学报,2014(2):40-41,46.
作者姓名:徐晓冰
作者单位:郑州铁路职业技术学院,郑州450052
摘    要:为了减少矿井火灾中人员伤亡和财产损失,提出在矿井火灾中确定最短路径的方法.充分利用蚁群算法的基本思想,首先根据巷道的长度,构造出巷道的当量长度体系,然后确定出巷道当量长度邻接矩阵,从而确定出科学合理的矿井火灾最短救援路径.通过蚁群算法和Matlab软件对此方法进行仿真和计算,测试结果表明,此方法确定的最短路径科学合理.

关 键 词:矿井火灾  当量长度  最短路径  蚁群算法

Study on Shortest Path of Rescue in Mine Fires Based on Ant Colony Algorithm
XU Xiaobing.Study on Shortest Path of Rescue in Mine Fires Based on Ant Colony Algorithm[J].Journal of Chengdu Aeronautic Vocational & Technical College,2014(2):40-41,46.
Authors:XU Xiaobing
Institution:XU Xiaobing (Zhengzhou Railway Vocational and Technical College , Zhengzhou 450052 , China)
Abstract:To reduce casualties and property losses in mine fires, this paper presents a method to determine the shortest path in a mine fire. The method says that we should make use of the basic idea of? the ant colony algorithm, construct an equivalent length system of a roadway according to the the length of the roadway, determine the adjacency matrix of the equivalent length,and then determine the scientific and rational shortest rescue path in a mine fire. This paper simulates and calculates the method by the ant colony algorithm and Matlab software. The test results show that the method is scientific and rational to determine the shortest path.
Keywords:mine fire  equivalent length  shortest path  ant colony algorithm
本文献已被 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号