An Optimization Model for Evacuation Based on Cellular Automata and Ant Colony Algorithm

Z. Ye, Yujie Yin, Xinlu Zong, Mingwei Wang
{"title":"An Optimization Model for Evacuation Based on Cellular Automata and Ant Colony Algorithm","authors":"Z. Ye, Yujie Yin, Xinlu Zong, Mingwei Wang","doi":"10.1109/ISCID.2014.160","DOIUrl":null,"url":null,"abstract":"With the progress of construction technology, the modern buildings become more and more complicated and large-sized. It is difficult to avoid sudden and catastrophic emergency events for interior buildings. Hence, it is very important to establish an evacuation model to simulate evacuation behavior of pedestrians under real condition and make a scientific and effective evacuation plan. For handling with the problems of emergency evacuation path in buildings, an improved cellular automata model based on ant colony optimization algorithm (ACO) is proposed. The proposed model considers the neighbors moving rules of cellular automata and law of export selection rule is used as heuristic information of ant colony optimization algorithm, it reflects the behavior of personnel path choice more really. Finally, the model has been applied to simulate the whole evacuation process in a classroom. By simulating the process of pedestrian evacuation with the model, the results show that the proposed model could achieve shorter evacuation time than basic ACO, it's feasible for solving evacuation planning problem.","PeriodicalId":385391,"journal":{"name":"2014 Seventh International Symposium on Computational Intelligence and Design","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 Seventh International Symposium on Computational Intelligence and Design","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCID.2014.160","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14

Abstract

With the progress of construction technology, the modern buildings become more and more complicated and large-sized. It is difficult to avoid sudden and catastrophic emergency events for interior buildings. Hence, it is very important to establish an evacuation model to simulate evacuation behavior of pedestrians under real condition and make a scientific and effective evacuation plan. For handling with the problems of emergency evacuation path in buildings, an improved cellular automata model based on ant colony optimization algorithm (ACO) is proposed. The proposed model considers the neighbors moving rules of cellular automata and law of export selection rule is used as heuristic information of ant colony optimization algorithm, it reflects the behavior of personnel path choice more really. Finally, the model has been applied to simulate the whole evacuation process in a classroom. By simulating the process of pedestrian evacuation with the model, the results show that the proposed model could achieve shorter evacuation time than basic ACO, it's feasible for solving evacuation planning problem.
基于元胞自动机和蚁群算法的疏散优化模型
随着建筑技术的进步,现代建筑越来越复杂、大型化。对于室内建筑来说,突发性和灾难性的突发事件是难以避免的。因此,建立疏散模型,模拟真实情况下行人的疏散行为,制定科学有效的疏散计划是十分重要的。针对建筑物紧急疏散路径问题,提出了一种基于蚁群优化算法的改进元胞自动机模型。该模型考虑了元胞自动机的邻居移动规则,并将出口选择规则规律作为蚁群优化算法的启发式信息,更真实地反映了人员路径选择的行为。最后,应用该模型对某教室的整个疏散过程进行了仿真。用该模型对行人疏散过程进行仿真,结果表明,该模型比基本蚁群算法能实现更短的疏散时间,对于解决疏散规划问题是可行的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信