Adaptive routing considering delays due to signal operations

This work addresses the problem of determining optimal routing decisions in signalized traffic networks, where arc travel times vary over time and are known only probabilistically (i.e. in stochastic, time-varying (STV) networks) and additional delay due to signal operations is explicitly considered. While prior works in the literature address problems of routing in STV networks, none explicitly considers the additional delay that would be incurred due to signal operations at the intersections of the roadway network. In this paper, we consider an adaptive routing problem, where paths are adapted en route based on revealed information concerning the arc travel times and actual signal timings. We first discuss how concepts from existing procedures can be combined to solve the adaptive routing problem in signalized STV networks, where the signal timing plan and actual timings are known a priori. When actual timings or delays due to signal control are known only probabilistically, such techniques will be inefficient. Thus, we propose a more efficient algorithm for solving this latter problem. Results of numerical experiments conducted on a real-world-based signalized street network are presented. These results show that the solutions obtained by explicitly considering delays due to signal operations will likely be significantly different from those solutions generated by techniques that ignore such delays.

[1]  Hani S. Mahmassani,et al.  A note on least time path computation considering delays and prohibitions for intersection movements , 1996 .

[2]  Adaptive least-expected time paths in stochastic, time-varying transportation and data networks , 2001 .

[3]  R E Allsop,et al.  TRAFFIC IN A SIGNAL-CONTROLLED ROAD NETWORK: AN EXAMPLE OF DIFFERENT SIGNAL TIMINGS INCLUDING DIFFERENT ROUTEING , 1977 .

[4]  Hani S. Mahmassani,et al.  Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks , 1999, Transp. Sci..

[5]  M. Desrochers,et al.  A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows , 1988 .

[6]  Mike Smith,et al.  The dynamics of traffic assignment and traffic control: A theoretical study , 1990 .

[7]  Paul W. Shuldiner,et al.  Analytical Methods in Transportation: Left-Turn Penalties in Traffic Assignment Models , 1963 .

[8]  Elise Miller-Hooks,et al.  Least possible time paths in stochastic, time-varying networks , 1998, Comput. Oper. Res..

[9]  Maria Grazia Scutellà,et al.  Minimum Time and Minimum Cost-Path Problems in Street Networks with Periodic Traffic Lights , 2002, Transp. Sci..

[10]  J. Ben Atkinson,et al.  Modeling and Analysis of Stochastic Systems , 1996 .

[11]  Nathan H. Gartner,et al.  Combined Model for Signal Control and Route Choice in Urban Traffic Networks , 1996 .

[12]  Randolph W. Hall,et al.  The Fastest Path through a Network with Random Time-Dependent Travel Times , 1986, Transp. Sci..

[13]  L. B. Fu,et al.  Expected Shortest Paths in Dynamic and Stochastic Traf c Networks , 1998 .

[14]  Yen-Liang Chen,et al.  Shortest paths in traffic-light networks , 2000 .

[15]  Elise Miller-Hooks,et al.  Least Expected Time Hyperpaths in Stochastic, Time-Varying Multimodal Networks , 2001 .