城市交通灯调度问题的元启发式研究

Sartikha, I. Ardiyanto, S. Sulistyo
{"title":"城市交通灯调度问题的元启发式研究","authors":"Sartikha, I. Ardiyanto, S. Sulistyo","doi":"10.1109/ICITEED.2018.8534817","DOIUrl":null,"url":null,"abstract":"Metaheuristics is the method used to complete complex optimizations. Metaheuristics is also used in urban traffic lights. This paper will discuss the metaheuristics used in urban traffic lights and divide it into two approaches. First, improve the performance of metaheuristic algorithms by coordinating between traffic intersections. Second, change the fixed time signal controller into an adaptive time signal control, then use metaheuristics to get optimal green signal time. The first approach is done by improving the performance of the algorithm by finding the smallest ARPD value of the improved Artificial Bee Colony (ABC) Algorithm and Harmony Search (HS). The result obtained the smallest average ARPD to 0.74 for the Artificial Bee Colony Algorithm and the computing time for the largest case (10 * 10 for 60s) using Discrete Harmony Search (DHS) was 6,219s. While completion of the second approach managed to raise the vehicle speed up to 27.6%. In addition, this paper insights the performance comparison of metaheuristic algorithms to solve the problem of scheduling urban traffic lights.","PeriodicalId":142523,"journal":{"name":"2018 10th International Conference on Information Technology and Electrical Engineering (ICITEE)","volume":"02 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A Study on Metaheuristics for Urban Traffic Light Scheduling Problems\",\"authors\":\"Sartikha, I. Ardiyanto, S. Sulistyo\",\"doi\":\"10.1109/ICITEED.2018.8534817\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Metaheuristics is the method used to complete complex optimizations. Metaheuristics is also used in urban traffic lights. This paper will discuss the metaheuristics used in urban traffic lights and divide it into two approaches. First, improve the performance of metaheuristic algorithms by coordinating between traffic intersections. Second, change the fixed time signal controller into an adaptive time signal control, then use metaheuristics to get optimal green signal time. The first approach is done by improving the performance of the algorithm by finding the smallest ARPD value of the improved Artificial Bee Colony (ABC) Algorithm and Harmony Search (HS). The result obtained the smallest average ARPD to 0.74 for the Artificial Bee Colony Algorithm and the computing time for the largest case (10 * 10 for 60s) using Discrete Harmony Search (DHS) was 6,219s. While completion of the second approach managed to raise the vehicle speed up to 27.6%. In addition, this paper insights the performance comparison of metaheuristic algorithms to solve the problem of scheduling urban traffic lights.\",\"PeriodicalId\":142523,\"journal\":{\"name\":\"2018 10th International Conference on Information Technology and Electrical Engineering (ICITEE)\",\"volume\":\"02 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 10th International Conference on Information Technology and Electrical Engineering (ICITEE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICITEED.2018.8534817\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 10th International Conference on Information Technology and Electrical Engineering (ICITEE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICITEED.2018.8534817","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

元启发式是用于完成复杂优化的方法。元启发式也用于城市交通信号灯。本文将讨论在城市交通信号灯中使用的元启发式方法,并将其分为两种方法。首先,通过交叉口间的协调来提高元启发式算法的性能。其次,将固定时间信号控制器转变为自适应时间信号控制器,然后利用元启发式算法得到最优绿信号时间。第一种方法是通过寻找改进的人工蜂群(ABC)算法和和谐搜索(HS)的最小ARPD值来提高算法的性能。结果表明,人工蜂群算法的平均ARPD最小,为0.74,离散和谐搜索(DHS)的最大情况(10 * 10,60s)的计算时间为6219 s。虽然第二次进近的完成成功地将车辆速度提高到27.6%。此外,本文还深入研究了解决城市交通灯调度问题的元启发式算法的性能比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Study on Metaheuristics for Urban Traffic Light Scheduling Problems
Metaheuristics is the method used to complete complex optimizations. Metaheuristics is also used in urban traffic lights. This paper will discuss the metaheuristics used in urban traffic lights and divide it into two approaches. First, improve the performance of metaheuristic algorithms by coordinating between traffic intersections. Second, change the fixed time signal controller into an adaptive time signal control, then use metaheuristics to get optimal green signal time. The first approach is done by improving the performance of the algorithm by finding the smallest ARPD value of the improved Artificial Bee Colony (ABC) Algorithm and Harmony Search (HS). The result obtained the smallest average ARPD to 0.74 for the Artificial Bee Colony Algorithm and the computing time for the largest case (10 * 10 for 60s) using Discrete Harmony Search (DHS) was 6,219s. While completion of the second approach managed to raise the vehicle speed up to 27.6%. In addition, this paper insights the performance comparison of metaheuristic algorithms to solve the problem of scheduling urban traffic lights.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信