Post Earthquake Path Planning Based on Improved Ant Colony Algorithm

Yalong Li, J. Zhang, Wei Wang, Jing-rong Sun, Jie Wan
{"title":"Post Earthquake Path Planning Based on Improved Ant Colony Algorithm","authors":"Yalong Li, J. Zhang, Wei Wang, Jing-rong Sun, Jie Wan","doi":"10.1109/icaice54393.2021.00062","DOIUrl":null,"url":null,"abstract":"Because the repair time is not taken into account, ant colony algorithm can not find the optimum path in a traffic network after earthquake. To solve the problem above, an improved ant colony algorithm is proposed, which brings the rush repair time into the constraints of path planning. When the rush repair is not completed, the corresponding path is not connected. In order to pass the path, it must wait until the path is connected. Simulate the traffic network diagram before and after the earthquake and carry out simulation experiments, the results show that compared with ant colony algorithm, the algorithm can effectively plan the path, has strong optimization ability and less time-consuming.","PeriodicalId":388444,"journal":{"name":"2021 2nd International Conference on Artificial Intelligence and Computer Engineering (ICAICE)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 2nd International Conference on Artificial Intelligence and Computer Engineering (ICAICE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/icaice54393.2021.00062","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Because the repair time is not taken into account, ant colony algorithm can not find the optimum path in a traffic network after earthquake. To solve the problem above, an improved ant colony algorithm is proposed, which brings the rush repair time into the constraints of path planning. When the rush repair is not completed, the corresponding path is not connected. In order to pass the path, it must wait until the path is connected. Simulate the traffic network diagram before and after the earthquake and carry out simulation experiments, the results show that compared with ant colony algorithm, the algorithm can effectively plan the path, has strong optimization ability and less time-consuming.
基于改进蚁群算法的震后路径规划
由于不考虑修复时间,蚁群算法无法在地震后的交通网络中找到最优路径。针对上述问题,提出了一种改进的蚁群算法,将抢修时间纳入路径规划约束。当急修未完成时,对应的路径未接通。为了传递路径,它必须等待,直到路径被连接。模拟地震前后的交通网络图并进行仿真实验,结果表明,与蚁群算法相比,该算法能有效规划路径,优化能力强,耗时少。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信