最大限度减少信号交叉口延迟的优化技术比较:PSO 和 GA

Abdullah Karadağ, Murat Ergün
{"title":"最大限度减少信号交叉口延迟的优化技术比较:PSO 和 GA","authors":"Abdullah Karadağ, Murat Ergün","doi":"10.31590/ejosat.1270905","DOIUrl":null,"url":null,"abstract":"Minimizing intersection delays is an important challenge in today’s smart cities. Even there are different approaches for delay minimization most of them uses the same nonlinear delay formula defined by Highway Capacity Manual (US). As a result choosing a fast and precise algorithm for finding the optimum inputs minimizing the delay output is a critical decision. In this paper we share our experience in selection of best optimization algorithm as a part of our work of developing an innovative system to minimize person delays in intersections. We compared two best known algorithms: Genetic Algorithms (GA) and Particle Swarm Optimization (PSO). It is shown that using the same population size and number of iterations PSO is 7x faster and 17x more precise than GA.","PeriodicalId":12068,"journal":{"name":"European Journal of Science and Technology","volume":"25 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2023-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Sinyalize Kavşaklarda Gecikmeyi Minimize Etmekte Kullanılan Optimizasyon Tekniklerinin Karşılaştırılması: PSO ve GA\",\"authors\":\"Abdullah Karadağ, Murat Ergün\",\"doi\":\"10.31590/ejosat.1270905\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Minimizing intersection delays is an important challenge in today’s smart cities. Even there are different approaches for delay minimization most of them uses the same nonlinear delay formula defined by Highway Capacity Manual (US). As a result choosing a fast and precise algorithm for finding the optimum inputs minimizing the delay output is a critical decision. In this paper we share our experience in selection of best optimization algorithm as a part of our work of developing an innovative system to minimize person delays in intersections. We compared two best known algorithms: Genetic Algorithms (GA) and Particle Swarm Optimization (PSO). It is shown that using the same population size and number of iterations PSO is 7x faster and 17x more precise than GA.\",\"PeriodicalId\":12068,\"journal\":{\"name\":\"European Journal of Science and Technology\",\"volume\":\"25 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-07-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"European Journal of Science and Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.31590/ejosat.1270905\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"European Journal of Science and Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.31590/ejosat.1270905","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

尽量减少交叉口延迟是当今智能城市面临的一项重要挑战。即使有不同的延迟最小化方法,但大多数方法都使用《美国公路通行能力手册》中定义的相同非线性延迟公式。因此,选择一种快速、精确的算法来寻找最佳输入,从而最大限度地减少延迟输出,是一项至关重要的决策。在本文中,我们分享了选择最佳优化算法的经验,这是我们开发创新系统以最大限度减少交叉口人员延误的工作的一部分。我们比较了两种最著名的算法:遗传算法 (GA) 和粒子群优化 (PSO)。结果表明,在种群规模和迭代次数相同的情况下,PSO 比 GA 快 7 倍,精确度高 17 倍。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Sinyalize Kavşaklarda Gecikmeyi Minimize Etmekte Kullanılan Optimizasyon Tekniklerinin Karşılaştırılması: PSO ve GA
Minimizing intersection delays is an important challenge in today’s smart cities. Even there are different approaches for delay minimization most of them uses the same nonlinear delay formula defined by Highway Capacity Manual (US). As a result choosing a fast and precise algorithm for finding the optimum inputs minimizing the delay output is a critical decision. In this paper we share our experience in selection of best optimization algorithm as a part of our work of developing an innovative system to minimize person delays in intersections. We compared two best known algorithms: Genetic Algorithms (GA) and Particle Swarm Optimization (PSO). It is shown that using the same population size and number of iterations PSO is 7x faster and 17x more precise than GA.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信