A simple adaptive signal control algorithm for isolated intersections using time-space diagrams

Lertworawanich Ponlathep
{"title":"A simple adaptive signal control algorithm for isolated intersections using time-space diagrams","authors":"Lertworawanich Ponlathep","doi":"10.1109/ITSC.2010.5625093","DOIUrl":null,"url":null,"abstract":"Traffic signals are the main devices for controlling traffic to guarantee the safe crossing of opposing streams of vehicles and pedestrians. In this study, a simple cycle and split optimization method is developed for isolated intersections. The split optimization is based on the notion of minimizing delay per cycle while cycle length is adjusted according to the residual queues at the end of the cycle. Traffic dynamics at signalized intersections are represented on time-space diagrams using the shockwave theory and information from detectors installed upstream of intersections. Splits are incrementally adjusted so that the delay per cycle is gradually diminished. Cycles are modified to have an efficient use of the provided green times without causing the residual queues. Unlike most algorithms, the proposed method can manage traffic even when queues extend beyond detector locations. Simulation experiments on a two-one-way intersection with different demand scenarios are performed to demonstrate efficiency of the developed algorithm. Hypothesis tests are conducted to statistically verify the efficient comparison between the proposed method and the Webster formula. It is found that in case of fixed demand the proposed method can optimize splits and cycle lengths with no worse performance measures than the optimal fixed-time signal settings according to the Webster formula. For the variable demand case, the result indicates that the algorithm can adjust splits and cycle lengths in response to the change of demand and provides better performance measures than the Webster formula.","PeriodicalId":176645,"journal":{"name":"13th International IEEE Conference on Intelligent Transportation Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"13th International IEEE Conference on Intelligent Transportation Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITSC.2010.5625093","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12

Abstract

Traffic signals are the main devices for controlling traffic to guarantee the safe crossing of opposing streams of vehicles and pedestrians. In this study, a simple cycle and split optimization method is developed for isolated intersections. The split optimization is based on the notion of minimizing delay per cycle while cycle length is adjusted according to the residual queues at the end of the cycle. Traffic dynamics at signalized intersections are represented on time-space diagrams using the shockwave theory and information from detectors installed upstream of intersections. Splits are incrementally adjusted so that the delay per cycle is gradually diminished. Cycles are modified to have an efficient use of the provided green times without causing the residual queues. Unlike most algorithms, the proposed method can manage traffic even when queues extend beyond detector locations. Simulation experiments on a two-one-way intersection with different demand scenarios are performed to demonstrate efficiency of the developed algorithm. Hypothesis tests are conducted to statistically verify the efficient comparison between the proposed method and the Webster formula. It is found that in case of fixed demand the proposed method can optimize splits and cycle lengths with no worse performance measures than the optimal fixed-time signal settings according to the Webster formula. For the variable demand case, the result indicates that the algorithm can adjust splits and cycle lengths in response to the change of demand and provides better performance measures than the Webster formula.
一个简单的自适应信号控制算法的孤立交叉口使用时-空图
交通信号是控制交通的主要装置,保证车流和行人安全通行。本文提出了一种针对孤立交叉口的简单循环分割优化方法。分割优化基于最小化每个周期延迟的概念,而周期长度根据周期结束时的剩余队列进行调整。利用冲击波理论和安装在交叉口上游的探测器的信息,用时空图表示信号交叉口的交通动态。分割是逐步调整的,以便每个周期的延迟逐渐减少。对周期进行修改,以有效地利用提供的绿灯时间,而不会导致剩余队列。与大多数算法不同的是,该方法可以在队列超出检测器位置时管理流量。通过不同需求场景下的双向交叉口仿真实验,验证了该算法的有效性。进行了假设检验,以统计验证所提出的方法与韦伯斯特公式之间的有效比较。研究发现,在需求固定的情况下,所提出的方法可以优化分割和周期长度,其性能指标并不比根据韦伯斯特公式的最优固定时间信号设置差。对于变需求情况,结果表明该算法可以根据需求的变化调整分割和周期长度,并提供比韦伯斯特公式更好的性能度量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信