基于改进蚁群算法的大规模城市交通流管理

IF 2.2 Q3 COMPUTER SCIENCE, CYBERNETICS International Journal of Intelligent Computing and Cybernetics Pub Date : 2023-06-26 DOI:10.1108/ijicc-02-2023-0020
Somia Boubedra, C. Tolba, P. Manzoni, Djamila Beddiar, Y. Zennir
{"title":"基于改进蚁群算法的大规模城市交通流管理","authors":"Somia Boubedra, C. Tolba, P. Manzoni, Djamila Beddiar, Y. Zennir","doi":"10.1108/ijicc-02-2023-0020","DOIUrl":null,"url":null,"abstract":"PurposeWith the demographic increase, especially in big cities, heavy traffic, traffic congestion, road accidents and augmented pollution levels hamper transportation networks. Finding the optimal routes in urban scenarios is very challenging since it should consider reducing traffic jams, optimizing travel time, decreasing fuel consumption and reducing pollution levels accordingly. In this regard, the authors propose an enhanced approach based on the Ant Colony algorithm that allows vehicle drivers to search for optimal routes in urban areas from different perspectives, such as shortness and rapidness.Design/methodology/approachAn improved ant colony algorithm (ACO) is used to calculate the optimal routes in an urban road network by adopting an elitism strategy, a random search approach and a flexible pheromone deposit-evaporate mechanism. In addition, the authors make a trade-off between route length, travel time and congestion level.FindingsExperimental tests show that the routes found using the proposed algorithm improved the quality of the results by 30% in comparison with the ACO algorithm. In addition, the authors maintain a level of accuracy between 0.9 and 0.95. Therefore, the overall cost of the found solutions decreased from 67 to 40. In addition, the experimental results demonstrate that the authors’ improved algorithm outperforms not only the original ACO algorithm but also popular meta-heuristic algorithms such as the genetic algorithm (GA) and particle swarm optimization (PSO) in terms of reducing travel costs and improving overall fitness value.Originality/valueThe proposed improvements to the ACO to search for optimal paths for urban roads include incorporating multiple factors, such as travel length, time and congestion level, into the route selection process. Furthermore, random search, elitism strategy and flexible pheromone updating rules are proposed to consider the dynamic changes in road network conditions and make the proposed approach more relevant and effective. These enhancements contribute to the originality of the authors’ work, and they have the potential to advance the field of traffic routing.","PeriodicalId":45291,"journal":{"name":"International Journal of Intelligent Computing and Cybernetics","volume":null,"pages":null},"PeriodicalIF":2.2000,"publicationDate":"2023-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Urban traffic flow management on large scale using an improved ACO for a road transportation system\",\"authors\":\"Somia Boubedra, C. Tolba, P. Manzoni, Djamila Beddiar, Y. Zennir\",\"doi\":\"10.1108/ijicc-02-2023-0020\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"PurposeWith the demographic increase, especially in big cities, heavy traffic, traffic congestion, road accidents and augmented pollution levels hamper transportation networks. Finding the optimal routes in urban scenarios is very challenging since it should consider reducing traffic jams, optimizing travel time, decreasing fuel consumption and reducing pollution levels accordingly. In this regard, the authors propose an enhanced approach based on the Ant Colony algorithm that allows vehicle drivers to search for optimal routes in urban areas from different perspectives, such as shortness and rapidness.Design/methodology/approachAn improved ant colony algorithm (ACO) is used to calculate the optimal routes in an urban road network by adopting an elitism strategy, a random search approach and a flexible pheromone deposit-evaporate mechanism. In addition, the authors make a trade-off between route length, travel time and congestion level.FindingsExperimental tests show that the routes found using the proposed algorithm improved the quality of the results by 30% in comparison with the ACO algorithm. In addition, the authors maintain a level of accuracy between 0.9 and 0.95. Therefore, the overall cost of the found solutions decreased from 67 to 40. In addition, the experimental results demonstrate that the authors’ improved algorithm outperforms not only the original ACO algorithm but also popular meta-heuristic algorithms such as the genetic algorithm (GA) and particle swarm optimization (PSO) in terms of reducing travel costs and improving overall fitness value.Originality/valueThe proposed improvements to the ACO to search for optimal paths for urban roads include incorporating multiple factors, such as travel length, time and congestion level, into the route selection process. Furthermore, random search, elitism strategy and flexible pheromone updating rules are proposed to consider the dynamic changes in road network conditions and make the proposed approach more relevant and effective. These enhancements contribute to the originality of the authors’ work, and they have the potential to advance the field of traffic routing.\",\"PeriodicalId\":45291,\"journal\":{\"name\":\"International Journal of Intelligent Computing and Cybernetics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":2.2000,\"publicationDate\":\"2023-06-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Intelligent Computing and Cybernetics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1108/ijicc-02-2023-0020\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, CYBERNETICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Intelligent Computing and Cybernetics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1108/ijicc-02-2023-0020","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, CYBERNETICS","Score":null,"Total":0}
引用次数: 1

摘要

随着人口的增长,尤其是在大城市,交通拥挤、交通拥堵、道路事故和污染水平的提高阻碍了交通网络。在城市场景中找到最佳路线是非常具有挑战性的,因为它应该考虑减少交通堵塞,优化旅行时间,减少燃料消耗和减少污染水平。在这方面,作者提出了一种基于蚁群算法的增强方法,允许车辆驾驶员从不同的角度(如短和快)搜索城市地区的最佳路线。设计/方法/方法采用一种改进的蚁群算法(蚁群算法),采用精英策略、随机搜索方法和灵活的信息素沉淀-蒸发机制来计算城市道路网络中的最优路线。此外,作者还在路线长度、行驶时间和拥堵程度之间进行了权衡。实验结果表明,与蚁群算法相比,该算法所寻路结果的质量提高了30%。此外,作者保持了0.9到0.95之间的精度水平。因此,所找到的解决办法的总费用从67减少到40。此外,实验结果表明,改进算法在降低出行成本和提高整体适应度值方面,不仅优于原蚁群算法,而且优于遗传算法(GA)和粒子群优化(PSO)等常用的元启发式算法。建议对蚁群算法进行改进,以寻找城市道路的最佳路径,包括在路线选择过程中纳入多种因素,如行程长度、时间和拥堵程度。在此基础上,采用随机搜索、精英策略和灵活信息素更新规则来考虑路网条件的动态变化,使所提方法更具相关性和有效性。这些改进有助于作者工作的原创性,并有可能推动交通路由领域的发展。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Urban traffic flow management on large scale using an improved ACO for a road transportation system
PurposeWith the demographic increase, especially in big cities, heavy traffic, traffic congestion, road accidents and augmented pollution levels hamper transportation networks. Finding the optimal routes in urban scenarios is very challenging since it should consider reducing traffic jams, optimizing travel time, decreasing fuel consumption and reducing pollution levels accordingly. In this regard, the authors propose an enhanced approach based on the Ant Colony algorithm that allows vehicle drivers to search for optimal routes in urban areas from different perspectives, such as shortness and rapidness.Design/methodology/approachAn improved ant colony algorithm (ACO) is used to calculate the optimal routes in an urban road network by adopting an elitism strategy, a random search approach and a flexible pheromone deposit-evaporate mechanism. In addition, the authors make a trade-off between route length, travel time and congestion level.FindingsExperimental tests show that the routes found using the proposed algorithm improved the quality of the results by 30% in comparison with the ACO algorithm. In addition, the authors maintain a level of accuracy between 0.9 and 0.95. Therefore, the overall cost of the found solutions decreased from 67 to 40. In addition, the experimental results demonstrate that the authors’ improved algorithm outperforms not only the original ACO algorithm but also popular meta-heuristic algorithms such as the genetic algorithm (GA) and particle swarm optimization (PSO) in terms of reducing travel costs and improving overall fitness value.Originality/valueThe proposed improvements to the ACO to search for optimal paths for urban roads include incorporating multiple factors, such as travel length, time and congestion level, into the route selection process. Furthermore, random search, elitism strategy and flexible pheromone updating rules are proposed to consider the dynamic changes in road network conditions and make the proposed approach more relevant and effective. These enhancements contribute to the originality of the authors’ work, and they have the potential to advance the field of traffic routing.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
6.80
自引率
4.70%
发文量
26
期刊最新文献
X-News dataset for online news categorization X-News dataset for online news categorization A novel ensemble causal feature selection approach with mutual information and group fusion strategy for multi-label data Contextualized dynamic meta embeddings based on Gated CNNs and self-attention for Arabic machine translation Dynamic community detection algorithm based on hyperbolic graph convolution
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1