检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]沈阳建筑大学市政与环境工程学院,辽宁沈阳110168 [2]公安部沈阳消防研究所,辽宁沈阳110034
出 处:《沈阳建筑大学学报(自然科学版)》2008年第6期1055-1059,共5页Journal of Shenyang Jianzhu University:Natural Science
基 金:国家十一五科技支撑计划重点(重大)项目(2006BAK06B03-2)
摘 要:目的将改进的自适应蚁群算法应用于大型公共建筑物智能疏散路径寻优,实现与建筑消防设施的联动控制.方法对建筑空间网络节点以及疏散通道静态属性和动态属性进行定义和描述,实现路径优化算法与火灾探测报警系统烟气态势信息的数据传递,以多层教学楼建筑物为例进行案例分析,并与Max-Min算法进行对比.结果参数取值为α=2,β=5,ρ=0.1时,笔者所建立的算法很好地克服了局部最优和死循环问题,提高了优化效率.结论改进的自适应蚁群算法适用于大型公共建筑物火灾时人员疏散路径的动态优化,可以实现与智能疏散系统的集成.Based on the definition and description of the static and dynamic attributes of construction space network nodes and evacuation corridors, data transmission is successfully achieved between the Adaptiveant-colony-algorithm-based Evacuation Route Optimization Algorithm and the smoke trend information of fire detection alarm system. Case application was performed on a multiple-storey building, and the optimization results were compared with the traditional Max-Min Ant Colony Algorithm. The case study results illustrate that when parameters are assigned as α = 2,β = 5 and ρ = 0.1, the Adaptive-ant-colony-based Evacuation Route Optimization Algorithm can well improve the search efficiency, the problem of local optimization and stagnation of traditional optimization algorithms are overcome to a good extent. It shows that the improved Evacuation Route Optimization Algorithm is fit for the dynamic optimization of evacuation route in large scale public buildings and is well integrated with the intelligent evacuation system of buildings.
关 键 词:建筑火灾 路径优化 自适应蚁群算法 智能疏散标示
分 类 号:TP301.6[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.118.32.116