A Comparative Study of Some Macroscopic Link Models Used in Dynamic Traffic Assignment

As network loading forms the basis of many dynamic traffic assignment solution algorithms, we consider in this paper four macroscopic link models that are widely used in DTA studies as the building blocks of certain network loading procedures. For the same generic link, the four models are solved and evaluated numerically for various link inflow profiles under a single-destination framework. And the characteristics of each model is analyzed and compared with others from multiple perspectives such as algorithmic implementation, model calibration, model accuracy, computational time and memory consumption. It is our purpose to find the best link model for the development of realistic and efficient network loading procedures. Moreover, since model discretization and calibration substantially influence a link model’s performance, both issues are carefully addressed in the paper.

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

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

[3]  Omar Drissi-Kaïtouni,et al.  A Dynamic Traffic Assignment Model and a Solution Algorithm , 1992, Transp. Sci..

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

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

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

[7]  Malachy Carey,et al.  Link Outflow Rate Computing under Continuous Dynamic Loads , 2002 .

[8]  Terry L. Friesz,et al.  A Discrete Time, Nested Cost Operator Approach to the Dynamic Network User Equilibrium Problem , 1995, Transp. Sci..

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

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

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

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

[13]  Carlos F. Daganzo,et al.  Properties of link travel time functions under dynamic loads , 1995 .

[14]  H. M. Zhang,et al.  Delay-Function-Based Link Models: Their Properties and Computational Issues , 2005 .

[15]  Bin Ran,et al.  MODELING DYNAMIC TRANSPORTATION NETWORKS , 1996 .

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

[17]  Xiaojian Nie,et al.  Some Consistency Conditions for Dynamic Traffic Assignment Problems , 2005 .

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

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

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

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

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

[23]  Jun Li,et al.  A reactive dynamic user equilibrium model in network with queues , 2000 .

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

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

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

[27]  Bin Ran,et al.  MODELING DYNAMIC TRANSPORTATION NETWORKS : AN INTELLIGENT TRANSPORTATION SYSTEM ORIENTED APPROACH. 2ND REV. ED. , 1996 .

[28]  Masao Kuwahara,et al.  Decomposition of the reactive dynamic assignments with queues for a many-to-many origin-destination pattern , 1997 .

[29]  Michael J. Smith,et al.  The Existence of a Time-Dependent Equilibrium Distribution of Arrivals at a Single Bottleneck , 1984, Transp. Sci..

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

[31]  G. F. Newell.  A simplified theory of kinematic waves in highway traffic, part I: General theory , 1993 .

[32]  A. Nagurney.  Network Economics: A Variational Inequality Approach , 1992 .

[33]  G. F. Newell.  A simplified theory of kinematic waves in highway traffic, part II: Queueing at freeway bottlenecks , 1993 .