Highlights We compare heuristic methods in their efficiency of optimizing traffic signal timing. All methods had equal improvement versus time, but some avoid premature convergence. Simulated annealing and genetic algorithm did not converge if used with good parameters. Tabu searching was not helpful, and hill-climbing always converged prematurely. Early convergence reduced benefits by 22–33%, so parameters should be chosen carefully.

    Abstract 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%.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Optimality versus run time for isolated signalized intersections


    Contributors:


    Publication date :

    2015-02-17


    Size :

    12 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English






    Reexamining Vehicle-Actuation Strategies at Isolated Signalized Intersections

    Cassidy, M. / Chuang, Y.-H. / Vitale, J. | British Library Online Contents | 1996


    Signalized Intersections and Networks

    Elefteriadou, Lily | Springer Verlag | 2013