Link Travel Times II: Properties Derived from Traffic-Flow Models

We investigate the properties of travel times when the latter are derived from traffic-flow models. In particular we consider exit-flow models, which have been used to model time-varying flows on road networks, in dynamic traffic assignment (DTA). But we here define the class more widely to include, for example, models based on finite difference approximations to the LWR (Lighthill, Whitham and Richards) model of traffic flow, and ‘large step’ versions of these. For the derived travel times we investigate the properties of existence, uniqueness, continuity, first-in-first-out (FIFO), causality and time-flow consistency (or intertemporal consistency). We assume a single traffic type and assume that time may be treated as continuous or as discrete, and for each case we obtain conditions under which the above properties are satisfied, and interrelations among the properties. For example, we find that FIFO is easily satisfied, but not strict causality, and find that if we redefine travel time to ensure strict causality then we lose time-flow consistency, and that neither of these conditions is strictly necessary or sufficient for FIFO. All of the models can be viewed as an approximation to a model that is continuous in time and space (the LWR model), and it seems that any loss of desirable properties is the price we pay for using such approximations. We also extend the exit-flow models and results to allow ‘inhomogeneity’ over time (link capacity or other parameters changing over time), and show that FIFO is still ensured if the exit-flow function is defined appropriately.

[1]  Malachy Carey,et al.  An exit-flow model used in dynamic traffic assignment , 2004, Comput. Oper. Res..

[2]  Bin Ran,et al.  A New Class of Instantaneous Dynamic User-Optimal Traffic Assignment Models , 1993, Oper. Res..

[3]  H. M. Zhang,et al.  A Comparative Study of Some Macroscopic Link Models Used in Dynamic Traffic Assignment , 2005 .

[4]  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.

[5]  Malachy Carey,et al.  Externalities, Average and Marginal Costs, and Tolls on Congested Networks with Time-Varying Flows , 1993, Oper. Res..

[6]  Terry L. Friesz,et al.  Dynamic Network User Equilibrium with State-Dependent Time Lags , 2001 .

[7]  Hai-Jun Huang,et al.  Dynamic user optimal traffic assignment model for many to one travel demand , 1995 .

[8]  R. Tobin,et al.  Dynamic congestion pricing models for general traffic networks , 1998 .

[9]  Terry L. Friesz,et al.  A Variational Inequality Formulation of the Dynamic Network User Equilibrium Problem , 1993, Oper. Res..

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

[11]  Malachy Carey,et al.  Comparing whole-link travel time models , 2003 .

[12]  Malachy Carey,et al.  Behaviour of a whole-link travel time model used in dynamic traffic assignment , 2002 .

[13]  Terry L. Friesz,et al.  Dynamic Network Traffic Assignment Considered as a Continuous Time Optimal Control Problem , 1989, Oper. Res..

[14]  C. Daganzo A finite difference approximation of the kinematic wave model of traffic flow , 1995 .

[15]  Hai Yang,et al.  Analysis of the time-varying pricing of a bottleneck with elastic demand using optimal control theory , 1997 .

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

[17]  Malachy Carey,et al.  Optimal Time-Varying Flows on Congested Networks , 1987, Oper. Res..

[18]  J H Wu,et al.  MODELLING THE SPILL-BACK OF CONGESTION IN LINK BASED DYNAMIC NETWORK LOADING MODELS: A SIMULATION MODEL WITH APPLICATION , 1999 .

[19]  Donald E. Kirk,et al.  Optimal Control Theory , 1970 .

[20]  Terry L. Friesz,et al.  A COMPARISON OF SYSTEM OPTIMUM AND USER EQUILIBRIUM DYNAMIC TRAFFIC ASSIGNMENTS WITH SCHEDULE DELAYS , 1995 .

[21]  Michael Florian,et al.  The continuous dynamic network loading problem : A mathematical formulation and solution method , 1998 .

[22]  Malachy Carey,et al.  Dynamic Traffic Assignment with More Flexible Modelling within Links , 2001 .

[23]  Bin Ran,et al.  New Algorithm for a Multiclass Dynamic Traffic Assignment Model , 2002 .

[24]  Malachy Carey,et al.  A Constraint Qualification for a Dynamic Traffic Assignment Model , 1986, Transp. Sci..

[25]  Anthony Chen,et al.  A DYNAMIC TRAFFIC ASSIGNMENT MODEL WITH TRAFFIC-FLOW RELATIONSHIPS , 1995 .

[26]  Malachy Carey Link Travel Times I: Desirable Properties , 2004 .

[27]  W. Y. Szeto,et al.  A cell-based variational inequality formulation of the dynamic user optimal assignment problem , 2002 .

[28]  Patrice Marcotte,et al.  On the Existence of Solutions to the Dynamic User Equilibrium Problem , 2000, Transp. Sci..

[29]  Bin Ran,et al.  Analytical Models of the Dynamic Traffic Assignment Problem , 2001 .

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

[31]  H. Lo A DYNAMIC TRAFFIC ASSIGNMENT FORMULATION THAT ENCAPSULATES THE CELL-TRANSMISSION MODEL , 1999 .

[32]  M J Lighthill,et al.  ON KINEMATIC WAVES.. , 1955 .

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

[34]  Emilio O. Roxin Optimal Control Theory (L. D. Berkovitz) , 1976 .

[35]  Terry L. Friesz,et al.  The Augmented Lagrangian Method for Solving Dynamic Network Traffic Assignment Models in Discrete Time , 1994, Transp. Sci..

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

[37]  Malachy Carey Extending and solving a multiperiod congested network flow model , 1990, Comput. Oper. Res..

[38]  Vittorio Astarita,et al.  Flow Propagation Description in Dynamic Network Loading Models , 1996 .

[39]  Y. W. Xu,et al.  Advances in the Continuous Dynamic Network Loading Problem , 1996, Transp. Sci..

[40]  P. I. Richards Shock Waves on the Highway , 1956 .