Dynamic user equilibrium traffic assignment on congested multidestination network

This paper presents the development of a dynamic user equilibrium (DUE) traffic-assignment model for the congested urban road network with signalized intersections. A simulation-based approach is employed for the case of multiple-origin multiple-destination traffic flows. The modified method of successive averages (MSA) is developed to arrive at the user equilibrium condition. The proposed method is applied to an example network, and its results are compared with the results obtained by using the artificial intelligence technique of genetic algorithms (GAs). It is concluded that the formulated DUE model avoids the all-or-nothing type of assignment and gives results closer to the equilibrium condition, and the modified MSA gives better results with lesser computation time as compared to GAs.

[1]  Hani S. Mahmassani,et al.  System Optimal Time-Dependent Path Assignment and Signal Timing in Traffic Network , 1998 .

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

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

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

[5]  André de Palma,et al.  Dynamic Model of Peak Period Traffic Congestion with Elastic Arrival Rates , 1986, Transp. Sci..

[6]  Sam Yagar,et al.  Dynamic integrated freeway/traffic signal networks: A routing-based modelling approach , 1988 .

[7]  Adel W. Sadek,et al.  Dynamic Traffic Assignment: Genetic Algorithms Approach , 1997 .

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

[9]  Ismail Chabini.  Analytical Dynamic Network Loading Problem: Formulation, Solution Algorithms, and Computer Implementations , 2001 .

[10]  B Wie,et al.  DYNAMIC SYSTEM OPTIMAL TRAFFIC ASSIGNMENT ON CONGESTED MULTIDESTINATION NETWORKS , 1990 .

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

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

[13]  Bruce N Janson,et al.  Dynamic traffic assignment for urban road networks , 1991 .

[14]  Shing Chung Josh Wong,et al.  A predictive dynamic traffic assignment model in congested capacity-constrained road networks , 2000 .

[15]  P Gower,et al.  CONTRAM, STRUCTURE OF THE MODEL , 1989 .

[16]  N B Taylor.  CONTRAM 5: AN ENHANCED TRAFFIC ASSIGNMENT MODEL , 1990 .

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

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

[19]  Hani S. Mahmassani,et al.  Dynamic Traffic Assignment and Simulation for Advanced Network Informatics (DYNASMART) , 1995 .

[20]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

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

[22]  M O Ghali,et al.  NEW DYNAMIC MODEL TO EVALUATE THE PERFORMANCE OF URBAN TRAFFIC CONTROL SYSTEMS AND ROUTE GUIDANCE STRATEGIES , 1991 .

[23]  Bin Ran,et al.  A link-based variational inequality model for dynamic departure time/route choice , 1996 .

[24]  Yosef Sheffi,et al.  Urban Transportation Networks: Equilibrium Analysis With Mathematical Programming Methods , 1985 .

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

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

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