EVACUATION ROUTE PLANNING MODEL BASED ON THE FUZZY ANT COLONY OPTIMIZATION ALGORITHM

O Tymchuk, E Midoian
{"title":"EVACUATION ROUTE PLANNING MODEL BASED ON THE FUZZY ANT COLONY OPTIMIZATION ALGORITHM","authors":"O Tymchuk, E Midoian","doi":"10.31548/energiya3(67).2023.132","DOIUrl":null,"url":null,"abstract":"The construction of evacuation routes from urban areas has become an urgent task in the modern world, as the number of emergencies is constantly increasing. Standard route planning algorithms do not meet the requirements of fast and efficient evacuation because they do not fully consider the environmental parameters and have a high computational complexity, and erroneous results can have critical consequences, including loss of life. The paper proposes a model of finding an optimal evacuation route in emergencies in urban areas based on a modified ant colony optimization algorithm: an ant (a person or a vehicle) is allowed to start moving from several possible vertices of the graph, as well as to end the route at several available vertices. It is connected with the fact that there are usually multiple evacuation start points and destinations. The transitions matrix is built using additional parameters, the uncertainty of which is taken into account using the methods of computing with words and the theory of type-2 fuzzy sets and systems. For modeling, in the paper such additional parameters as the quality of the road surface, the number of road lanes, the level of traffic jams, and the distance to the epicenter of the emergency were used. The proposed model was implemented and applied in one of the quarter of Kyiv.","PeriodicalId":499839,"journal":{"name":"Енергетика і автоматика","volume":"76 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Енергетика і автоматика","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.31548/energiya3(67).2023.132","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The construction of evacuation routes from urban areas has become an urgent task in the modern world, as the number of emergencies is constantly increasing. Standard route planning algorithms do not meet the requirements of fast and efficient evacuation because they do not fully consider the environmental parameters and have a high computational complexity, and erroneous results can have critical consequences, including loss of life. The paper proposes a model of finding an optimal evacuation route in emergencies in urban areas based on a modified ant colony optimization algorithm: an ant (a person or a vehicle) is allowed to start moving from several possible vertices of the graph, as well as to end the route at several available vertices. It is connected with the fact that there are usually multiple evacuation start points and destinations. The transitions matrix is built using additional parameters, the uncertainty of which is taken into account using the methods of computing with words and the theory of type-2 fuzzy sets and systems. For modeling, in the paper such additional parameters as the quality of the road surface, the number of road lanes, the level of traffic jams, and the distance to the epicenter of the emergency were used. The proposed model was implemented and applied in one of the quarter of Kyiv.
基于模糊蚁群优化算法的疏散路线规划模型
随着突发事件数量的不断增加,城市地区疏散路线的建设已成为现代世界的一项紧迫任务。标准的路线规划算法没有充分考虑环境参数,计算复杂度高,不能满足快速高效疏散的要求,错误的结果可能会造成严重的后果,包括生命损失。本文提出了一种基于改进蚁群优化算法的城市突发事件最优疏散路径模型:允许蚂蚁(人或车辆)从图的几个可能的顶点开始移动,并在几个可用的顶点结束路线。这与通常有多个疏散起点和目的地的事实有关。利用词计算方法和2型模糊集和系统理论,考虑了过渡矩阵的不确定性,利用附加参数建立了过渡矩阵。在建模中,本文使用了路面质量、车道数、交通拥堵程度以及到应急中心的距离等附加参数。所提出的模型在基辅的一个季度得到了实施和应用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信