Routing strategies for the reliable and efficient utilization of road networks

Author(s): Samaranayake, Samitha | Advisor(s): Bayen, Alexandre | Abstract: The research presented in this dissertation aims to develop computationally tractable models and algorithms for the reliable and efficient utilization of capacity restricted transportation networks via route selection and demand redistribution, motivated by the fact that traffic congestion in road networks is a major problem in urban communities. Three related topics are considered, 1) route planning with reliability guarantees, 2) system optimal dynamic traffic assignment, and 3) controlling user equilibrium departure times.Route planning can in many practical settings require finding a route that is both fast and reliable. However, in most operational settings, only deterministic shortest paths are considered, and even when the link travel-times are known to be stochastic the common approach is to simply minimize the expected travel-time. This approach does not account for the variance of the travel-time and gives no reliability guarantees. In many cases, travelers have hard deadlines or are willing to sacrifice some extra travel-time for increased travel-time reliability, such as in commercial routing applications where delivery guarantees need to be met and perishables need to be delivered on time. The research presented in this dissertation develops fast computation techniques for the reliable routing problem known as the stochastic on-time arrival (SOTA) problem, which provides a routing strategy that maximizes the probability of arriving at the destination within a fixed time budget. Selfish user optimal routing strategies can, however, lead to very inefficient traffic equilibria in congested traffic networks. This "Price of Anarchy" can be mitigated using system optimal coordinated routing algorithms. The dissertation considers the system optimal dynamic traffic assignment problem when only a subset of the network agents can be centrally coordinated. A road traffic dynamics model is developed based on the Lighthill-Williams-Richards partial differential equation and a corresponding multi-commodity junction solver. Full Lagrangian paths are assumed to be known for the controllable agents, while only the aggregate split ratios are required for the non-controllable (selfish) agents. The resulting non-linear optimal control problem is solved efficiently using the discrete adjoint method. Spill-back from under-capacitated off-ramps is one of the major causes of congestion during the morning commute. This spill-back induces a capacity drop on the freeway, which then creates a bottleneck for the mainline traffic that is passing by the off-ramp. Therefore, influencing the flow distribution of the vehicles that exit the freeway at the off-ramp can improve the throughput of freeway vehicles that pass this junction. The dissertation studies the generalized morning commute problem where vehicles exiting the freeway at the under-capacitated off-ramp have a fixed desired arrival time and a corresponding equilibrium departure time schedule, and presents strategies to manipulated this equilibrium to maximize throughput on the freeway via incentives or tolls.

[1]  Alexandre M. Bayen,et al.  A time-dependent Hamilton-Jacobi formulation of reachable sets for continuous dynamic games , 2005, IEEE Transactions on Automatic Control.

[2]  Roberto Horowitz,et al.  Freeway traffic flow simulation using the Link Node Cell transmission model , 2009, 2009 American Control Conference.

[3]  Tim Roughgarden,et al.  On the severity of Braess's Paradox: Designing networks for selfish users is hard , 2006, J. Comput. Syst. Sci..

[4]  Yueyue Fan,et al.  Optimal Routing for Maximizing the Travel Time Reliability , 2006 .

[5]  Brian C. Dean,et al.  Algorithms for minimum‐cost paths in time‐dependent networks with waiting policies , 2004, Networks.

[6]  Amos Fiat,et al.  Highway dimension, shortest paths, and provably efficient algorithms , 2010, SODA '10.

[7]  T. H. Savits,et al.  The IFRA Closure Problem , 1976 .

[8]  Athanasios K. Ziliaskopoulos,et al.  Foundations of Dynamic Traffic Assignment: The Past, the Present and the Future , 2001 .

[9]  B. Melamed,et al.  Traffic modeling for telecommunications networks , 1994, IEEE Communications Magazine.

[10]  Rafael Martí.  Multi-Start Methods , 2003, Handbook of Metaheuristics.

[11]  Carlos F. Daganzo,et al.  The Uniqueness of a Time-dependent Equilibrium Distribution of Arrivals at a Single Bottleneck , 1985, Transp. Sci..

[12]  Alexandre M. Bayen,et al.  Stackelberg Routing on Parallel Networks With Horizontal Queues , 2012, IEEE Transactions on Automatic Control.

[13]  Carlos F. Daganzo,et al.  THE CELL TRANSMISSION MODEL, PART II: NETWORK TRAFFIC , 1995 .

[14]  E. Molin,et al.  Use and Effects of Advanced Traveller Information Services (ATIS): A Review of the Literature , 2006 .

[15]  H. Mahmassani,et al.  Least expected time paths in stochastic, time-varying transportation networks , 1999 .

[16]  K. Cooke,et al.  The shortest route through a network with time-dependent internodal transit times , 1966 .

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

[18]  Vittorio Astarita,et al.  A CONTINUOUS TIME LINK MODEL FOR DYNAMIC NETWORK LOADING BASED ON TRAVEL TIME FUNCTION , 1996 .

[19]  Harold S. Stone,et al.  Multiprocessor Scheduling with the Aid of Network Flow Algorithms , 1977, IEEE Transactions on Software Engineering.

[20]  Alexandre M. Bayen,et al.  A PDE-ODE Model for a Junction with Ramp Buffer , 2014, SIAM J. Appl. Math..

[21]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[22]  Peter Sanders,et al.  Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks , 2008, WEA.

[23]  Alexandre M. Bayen,et al.  Using Mobile Phones to Forecast Arterial Traffic through Statistical Learning , 2010 .

[24]  A. Bayen,et al.  A traffic model for velocity data assimilation , 2010 .

[25]  Alexandre M. Bayen,et al.  Precomputation techniques for the stochastic on-time arrival problem , 2014, ALENEX.

[26]  Sebastien Blandin,et al.  A Tractable Class of Algorithms for Reliable Routing in Stochastic Networks , 2011 .

[27]  C. Daganzo.  THE CELL TRANSMISSION MODEL.. , 1994 .

[28]  Rabin K. Patra,et al.  Routing in a delay tolerant network , 2004, SIGCOMM '04.

[29]  A. Goldberg,et al.  TRANSIT: Ultrafast Shortest-Path Queries with Linear-Time Preprocessing , 2006 .

[30]  W. Vickrey.  Congestion Theory and Transport Investment , 1969 .

[31]  Robin Lindsey,et al.  DEPARTURE TIME AND ROUTE CHOICE FOR THE MORNING COMMUTE , 1990 .

[32]  Tim Roughgarden.  Stackelberg Scheduling Strategies , 2004, SIAM J. Comput..

[33]  Niles A. Pierce,et al.  An Introduction to the Adjoint Approach to Design , 2000 .

[34]  Daniel Delling,et al.  SHARC: Fast and robust unidirectional routing , 2008, JEAL.

[35]  G. F. Newell.  Traffic Flow for the Morning Commute , 1988, Transp. Sci..

[36]  Hani S. Mahmassani,et al.  Experiments with departure time choice dynamics of urban commuters , 1986 .

[37]  Malachy Carey,et al.  Nonconvexity of the dynamic traffic assignment problem , 1992 .

[38]  Dimitri P. Bertsekas,et al.  Dynamic Programming and Optimal Control, Two Volume Set , 1995 .

[39]  M J Lighthill,et al.  On kinematic waves II. A theory of traffic flow on long crowded roads , 1955, Proceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences.

[40]  Claire Tomlin,et al.  Game-theoretic routing of GPS-assisted vehicles for energy efficiency , 2011, Proceedings of the 2011 American Control Conference.

[41]  Alexandre M. Bayen,et al.  Arriving on time: estimating travel time distributions on large-scale road networks , 2013, ArXiv.

[42]  R. LeVeque.  Finite Volume Methods for Hyperbolic Problems: Characteristics and Riemann Problems for Linear Hyperbolic Equations , 2002 .

[43]  A. Nagurney,et al.  A supply chain network equilibrium model , 2002 .

[44]  K. Morton,et al.  Numerical Solution of Partial Differential Equations: Introduction , 2005 .

[45]  Haim Kaplan,et al.  Reach for A*: Efficient Point-to-Point Shortest Path Algorithms , 2006, ALENEX.

[46]  Alexandre M. Bayen,et al.  Solving the Dynamic User Equilibrium Problem Via Sequential Convex Optimization for Parallel Horizontal Queuing Networks , 2015 .

[47]  Daniele Frigioni,et al.  Dynamic Arc-Flags in Road Networks , 2011, SEA.

[48]  Ariel Orda,et al.  Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length , 1990, JACM.

[49]  Hong Kam Lo,et al.  Dynamic network traffic control , 2001 .

[50]  Cheng-Shang Chang,et al.  Performance guarantees in communication networks , 2000, Eur. Trans. Telecommun..

[51]  Alexandre M. Bayen,et al.  Solving the user equilibrium departure time problem at an off-ramp with incentive compatible cost functions , 2015, 2015 European Control Conference (ECC).

[52]  Martin A. Riedmiller,et al.  RPROP - A Fast Adaptive Learning Algorithm , 1992 .

[53]  Chaitanya Swamy,et al.  The effectiveness of Stackelberg strategies and tolls for network congestion games , 2007, SODA '07.

[54]  Hamsa Balakrishnan,et al.  Queuing Models of Airport Departure Processes for Emissions Reduction , 2009 .

[55]  Alexandre M. Bayen,et al.  Real‐Time Estimation of Pollution Emissions and Dispersion from Highway Traffic , 2014, Comput. Aided Civ. Infrastructure Eng..

[56]  William G. Gardner,et al.  Efficient Convolution without Input/Output Delay , 1995 .

[57]  Carlos F. Daganzo,et al.  Spillovers, Merging Traffic and the Morning Commute , 2007 .

[58]  George L. Nemhauser,et al.  Optimality Conditions for a Dynamic Traffic Assignment Model , 1978 .

[59]  Christos H. Papadimitriou,et al.  Worst-case equilibria , 1999 .

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

[61]  Tim Roughgarden,et al.  Bounding the inefficiency of equilibria in nonatomic congestion games , 2004, Games Econ. Behav..

[62]  Alexandre M. Bayen,et al.  An adaptive routing system for location-aware mobile devices on the road network , 2011, 2011 14th International IEEE Conference on Intelligent Transportation Systems (ITSC).

[63]  T. Koopmans,et al.  Studies in the Economics of Transportation. , 1956 .

[64]  Rolf H. Möhring,et al.  Fast Point-to-Point Shortest Path Computations with Arc-Flags , 2006, The Shortest Path Problem.

[65]  Haim Kaplan,et al.  Better Landmarks Within Reach , 2007, WEA.

[66]  Roberto Horowitz,et al.  Multiple-clustering ARMAX-based predictor and its application to freeway traffic flow prediction , 2014, 2014 American Control Conference.

[67]  Alexandre M. Bayen,et al.  Speedup Techniques for the Stochastic on-time Arrival Problem , 2012, ATMOS.

[68]  Samitha Samaranayake,et al.  GPU parallelization of the stochastic on-time arrival problem , 2014, 2014 21st International Conference on High Performance Computing (HiPC).

[69]  J. G. Wardrop,et al.  Some Theoretical Aspects of Road Traffic Research , 1952 .

[70]  Alexandre M. Bayen,et al.  The Path Inference Filter: Model-Based Low-Latency Map Matching of Probe Vehicle Data , 2014, WAFR.

[71]  Tim Roughgarden.  The price of anarchy is independent of the network topology , 2003, J. Comput. Syst. Sci..

[72]  Andrew B. Kahng,et al.  A new adaptive multi-start technique for combinatorial global optimizations , 1994, Oper. Res. Lett..

[73]  A. Jameson,et al.  Aerodynamic shape optimization techniques based on control theory , 1998 .

[74]  Alexandre M. Bayen,et al.  Learning the dependency structure of highway networks for traffic forecast , 2011, IEEE Conference on Decision and Control and European Control Conference.

[75]  Claire J. Tomlin,et al.  An Adjoint-Based Parameter Identification Algorithm Applied to Planar Cell Polarity Signaling , 2008, IEEE Transactions on Automatic Control.

[76]  David R. Karger,et al.  Optimal Route Planning under Uncertainty , 2006, ICAPS.

[77]  Austen C. Duffy,et al.  An Introduction to Gradient Computation by the Discrete Adjoint Method , 2009 .

[78]  Hani S. Mahmassani,et al.  Travel time prediction and departure time adjustment behavior dynamics in a congested traffic system , 1988 .

[79]  Andrew V. Goldberg,et al.  Computing Point-to-Point Shortest Paths from External Memory , 2005, ALENEX/ANALCO.

[80]  Lorenz T. Biegler,et al.  On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming , 2006, Math. Program..

[81]  Roberto Horowitz,et al.  Optimal freeway ramp metering using the asymmetric cell transmission model , 2006 .

[82]  A. Adas,et al.  Traffic models in broadband networks , 1997, IEEE Commun. Mag..

[83]  Pravin Varaiya,et al.  Freeway Performance Measurement System: Mining Loop Detector Data , 2001 .

[84]  Robin Lindsey.  Existence, Uniqueness, and Trip Cost Function Properties of User Equilibrium in the Bottleneck Model with Multiple User Classes , 2004, Transp. Sci..

[85]  Hani S. Mahmassani,et al.  Dynamic User Equilibrium Departure Time and Route Choice on Idealized Traffic Arterials , 1984, Transp. Sci..

[86]  I Yperman,et al.  Dynamic Congestion Pricing in a Network with Queue Spillover , 2005 .

[87]  Michael J. Cassidy,et al.  Study of Freeway Traffic Near an Off-Ramp , 2000 .

[88]  Y. Nie,et al.  Arriving-on-time problem : Discrete algorithm that ensures convergence , 2006 .

[89]  Dietrich Braess,et al.  Über ein Paradoxon aus der Verkehrsplanung , 1968, Unternehmensforschung.

[90]  David Assaf,et al.  Closure of Phase Type Distributions Under Operations Arising in Reliability Theory , 1982 .

[91]  Ariel Orda,et al.  Achieving network optima using Stackelberg routing strategies , 1997, TNET.

[92]  Mauro Garavello,et al.  Traffic Flow on Networks , 2006 .

[93]  Brian C. Dean,et al.  Speeding up Stochastic Dynamic Programming with Zero-Delay Convolution , 2010, Algorithmic Oper. Res..

[94]  M. Stone.  The Generalized Weierstrass Approximation Theorem , 1948 .

[95]  M. Giles,et al.  Adjoint equations in CFD: duality, boundary conditions and solution behaviour , 1997 .

[96]  Stuart E. Dreyfus,et al.  An Appraisal of Some Shortest-Path Algorithms , 1969, Oper. Res..

[97]  Chris Hendrickson,et al.  Schedule Delay and Departure Time Decisions in a Deterministic Model , 1981 .

[98]  Gordon F. Newell,et al.  Delays caused by a queue at a freeway exit ramp , 1999 .

[99]  Nanne J. Van Der Zijpp,et al.  Multiclass Continuous-Time Equilibrium Model for Departure Time Choice on Single-Bottleneck Network , 2002 .

[100]  S. Travis Waller,et al.  On the online shortest path problem with limited arc cost dependencies , 2002, Networks.

[101]  Gordon F. Newell.  The Morning Commute for Nonidentical Travelers , 1987, Transp. Sci..

[102]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[103]  Athanasios K. Ziliaskopoulos,et al.  A Linear Programming Model for the Single Destination System Optimum Dynamic Traffic Assignment Problem , 2000, Transp. Sci..

[104]  Deepak K. Merchant,et al.  A Model and an Algorithm for the Dynamic Traffic Assignment Problems , 1978 .

[105]  Alexandre M. Bayen,et al.  A mathematical framework for delay analysis in single source networks , 2015, 2015 American Control Conference (ACC).

[106]  Samitha Samaranayake,et al.  Tractable Pathfinding for the Stochastic On-Time Arrival Problem , 2014, SEA.

[107]  Alexandre M. Bayen,et al.  Adjoint-based control of a new eulerian network model of air traffic flow , 2006, IEEE Transactions on Control Systems Technology.

[108]  Masao Kuwahara.  Equilibrium Queueing Patterns at a Two-Tandem Bottleneck during the Morning Peak , 1990, Transp. Sci..

[109]  Jaimyoung Kwon,et al.  Automatic Calibration of the Fundamental Diagram and Empirical Observations on Capacity , 2009 .

[110]  Ronald Prescott Loui,et al.  Optimal paths in graphs with stochastic or multidimensional weights , 1983, Commun. ACM.

[111]  Robert Sedgewick,et al.  Algorithms in C , 1990 .

[112]  H. Frank,et al.  Shortest Paths in Probabilistic Graphs , 1969, Oper. Res..

[113]  J. Lebacque.  THE GODUNOV SCHEME AND WHAT IT MEANS FOR FIRST ORDER TRAFFIC FLOW MODELS , 1996 .