Performance Analysis of ACO and FA Algorithms on Parameter Variation Scenarios in Determining Alternative Routes for Cars as a Solution to Traffic Jams

Y. Sibaroni, S. S. Prasetiyowati, Mitha Putrianty Fairuz, Muhammad Damar, Rafika Salis
{"title":"Performance Analysis of ACO and FA Algorithms on Parameter Variation Scenarios in Determining Alternative Routes for Cars as a Solution to Traffic Jams","authors":"Y. Sibaroni, S. S. Prasetiyowati, Mitha Putrianty Fairuz, Muhammad Damar, Rafika Salis","doi":"10.15575/join.v7i1.797","DOIUrl":null,"url":null,"abstract":"This study proposes several alternative optimal routes on traffic-prone routes using Ant Colony Optimization (ACO) and Firefly Algorithm (FA). Two methods are classified as the metaheuristic method, which means that they can solve problems with complex optimization and will get the solution with the best results. Comparison of alternative routes generated by the two algorithms is measured based on several parameters, namely alpha and beta in determination of the best alternative route. The results obtained are that the alternative route produced by FA is superior to ACO, with an accuracy of 88%. This is also supported by the performance of the FA algorithm which is generally superior, where the resulting alternative route is shorter in distance, time, running time and  there is no influence on the alpha parameter value. But in each iteration, the number of alternative routes generated is less. The contribution of this research is to provide information about the best algorithm between ACO and FA in providing the most optimal alternative route based on the fastest travel time. The recommended alternative path is a path that is sufficient for cars to pass, because the selection takes into account the size of the road capacity.","PeriodicalId":32019,"journal":{"name":"JOIN Jurnal Online Informatika","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2022-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"JOIN Jurnal Online Informatika","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.15575/join.v7i1.797","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This study proposes several alternative optimal routes on traffic-prone routes using Ant Colony Optimization (ACO) and Firefly Algorithm (FA). Two methods are classified as the metaheuristic method, which means that they can solve problems with complex optimization and will get the solution with the best results. Comparison of alternative routes generated by the two algorithms is measured based on several parameters, namely alpha and beta in determination of the best alternative route. The results obtained are that the alternative route produced by FA is superior to ACO, with an accuracy of 88%. This is also supported by the performance of the FA algorithm which is generally superior, where the resulting alternative route is shorter in distance, time, running time and  there is no influence on the alpha parameter value. But in each iteration, the number of alternative routes generated is less. The contribution of this research is to provide information about the best algorithm between ACO and FA in providing the most optimal alternative route based on the fastest travel time. The recommended alternative path is a path that is sufficient for cars to pass, because the selection takes into account the size of the road capacity.
基于参数变化情景的蚁群算法和遗传算法在交通拥堵备选路径选择中的性能分析
本文利用蚁群算法和萤火虫算法在交通易发路段提出了几种备选的最优路线。这两种方法被归类为元启发式方法,这意味着它们可以解决复杂的优化问题,并将获得最佳结果的解。在确定最佳备选路由时,根据alpha和beta两个参数对两种算法生成的备选路由进行比较。结果表明,FA生成的替代路线优于ACO,准确率为88%。这一点也得到了FA算法性能的支持,FA算法的性能普遍优于FA算法,其生成的备选路由在距离、时间、运行时间上都更短,并且对alpha参数值没有影响。但在每次迭代中,生成的备选路由数量较少。本研究的贡献在于提供蚁群算法与蚁群算法之间的最佳算法,以提供基于最快行程时间的最优替代路线。建议的备选路径是一条足够汽车通过的路径,因为选择考虑了道路容量的大小。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
2
审稿时长
12 weeks
×
引用
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学术官方微信