arrow
返回

Optimality versus run time for isolated signalized intersections

delete2015-06-01
delete10
PRE
AI
D
David Hale *
B
Byungkyu Park
A
Aleksandar Stevanović
P
Peng Su
J
Jiaqi Ma
DOI:10.1016/j.trc.2015.02.015delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Simulation-based optimization of traffic signal timing has become pervasive and popular, in the field of traffic engineering. When the underlying simulation model is well-trusted and/or well-calibrated, it is only natural that typical engineers would want their signal timing optimized using the judgment of that same model. As such, it becomes important that the heuristic search methods typically used by these optimizations are capable of locating global optimum solutions, for a wide range of signal systems. However off-line and real-time solutions alike offer just a subset of the available search methods. The result is that many optimizations are likely converging prematurely on mediocre solutions. In response, this paper compares several search methods from the literature, in terms of both optimality (i.e., solution quality) and computer run times. Simulated annealing and genetic algorithm methods were equally effective in achieving near-global optimum solutions. Two selection methods (roulette wheel and tournament), commonly used within genetic algorithms, exhibited similar effectiveness. Tabu searching did not provide significant benefits. Trajectories of optimality versus run time (OVERT) were similar for each method, except some methods aborted early along the same trajectory. Hill-climbing searches always aborted early, even with a large number of step-sizes. Other methods only aborted early when applied with ineffective parameter settings (e.g. mutation rate, annealing schedule). These findings imply (1) today's products encourage a sub-optimal one size fits all approach, (2) heuristic search methods and parameters should be carefully selected based on the system being optimized, (3) weaker searches abort early along the OVERT curve, and (4) improper choice of methods and/or parameters can reduce optimization benefits by 22-33%. (C) 2015 Elsevier Ltd. All rights reserved.
Keyword:
Traffic signal timing
Simulation-based optimization
Genetic algorithm
Simulated annealing
Heuristic method
Tabu search
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Transportation Research Part C-Emerging Technologies 封面图
Transportation Research Part C-Emerging Technologies
IF:
7.9
论文数:
4.9K
被引数:
3.2W

机构

U
University of Florida
学者数:
4.0W
论文数: 3.1W
被引数: 6.6W
State University System of Florida 封面图
State University System of Florida
学者数:
12.8W
论文数: 10.9W
被引数: 130
U
University of Virginia
学者数:
3.0W
论文数: 2.7W
被引数: 4.1W
学者 查看更多机构
引用论文

引用论文

Imparting CO2 Electroreduction Auxiliary for Integrated Morphology Tuning and Performance Boosting in a Porphyrin‐based Covalent Organic Framework
err2021-12-18
err0
PREAI
errYi‐Rong Wang; Hui‐Min Ding; Xiao‐Yu Ma; Ming Liu; Yi‐Lu Yang; Yifa Chen; Shun‐Li Li; Ya‐Qian Lan
err分享
err收藏
Programmable self-assembly in a thousand-robot swarm
err2014-08-15
err0
PREAI
errMichael Rubenstein; Alejandro Cornejo; Radhika Nagpal
err分享
err收藏
OPTIMIZATION BY SIMULATED ANNEALING模拟退火优化
errSCIENCE
IF45.8
err1983-05-13
err3.2W
PREAI
errKIRKPATRICK, S; GELATT, CD; VECCHI, MP
err分享
err收藏
err分享
err收藏
没有更多内容