A Comparative Analysis of Heuristics for the Improved Convergence of Dynamic Traffic Assignment Models

Simulation-Based Dynamic Traffic Assignment (DTA) provides a high level of detail useful in realistic modeling for transportation planning. However, mathematical optimization of the solution algorithm is difficult because of discretized space and time, and as a result solution algorithm computation times measured in hours or even days can discourage use. This work compares and analyzes experimental results from two types of potential techniques for reducing computation time: a static traffic assignment (STA) warm start to DTA, and existing and novel heuristics from variations on the

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

[2]  Josef Stoer,et al.  Numerische Mathematik 1 , 1989 .

[3]  Robert B. Dial,et al.  A path-based user-equilibrium traffic assignment algorithm that obviates path storage and enumeration , 2006 .

[4]  S. Travis Waller,et al.  An Internet-based geographic information system that integrates data, models and users for transportation applications , 2000 .

[5]  Carlos F. Daganzo,et al.  Queue Spillovers in Transportation Networks with a Route Choice , 1998, Transp. Sci..

[6]  Michael W. Levin,et al.  Utilizing a Static-based Initial Feasible Solution to Expedite the Convergence of Dynamic Traffic Assignment Problems , 2011 .

[7]  Mike J. Smith.  The existence and calculation of traffic equilibria , 1983 .

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

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

[10]  Yi-Chang Chiu,et al.  A Gap Function Vehicle-Based Solution Procedure for Consistent and Robust Simulation-Based Dynamic Traffic Assignment , 2009 .

[11]  Y. She.  Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods , 1985 .

[12]  Shing Chung Josh Wong,et al.  Heuristic algorithms for simulation-based dynamic traffic assignment , 2010 .

[13]  Philip Wolfe,et al.  An algorithm for quadratic programming , 1956 .

[14]  Michael Florian,et al.  Comparison of Assignment Methods for Simulation-Based Dynamic-Equilibrium Traffic Assignment , 2008 .

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

[16]  Larry J. LeBlanc,et al.  AN EFFICIENT APPROACH TO SOLVING THE ROAD NETWORK EQUILIBRIUM TRAFFIC ASSIGNMENT PROBLEM. IN: THE AUTOMOBILE , 1975 .

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

[18]  Hillel Bar-Gera,et al.  Origin-Based Algorithm for the Traffic Assignment Problem , 2002, Transp. Sci..

[19]  Michael Florian,et al.  Application of a simulation-based dynamic traffic assignment model , 2008, Eur. J. Oper. Res..

[20]  R. Jayakrishnan,et al.  A FASTER PATH-BASED ALGORITHM FOR TRAFFIC ASSIGNMENT , 1994 .

[21]  Hani S. Mahmassani,et al.  Equivalent gap function-based reformulation and solution algorithm for the dynamic user equilibrium problem , 2009 .

[22]  Marguerite FRANK,et al.  The Braess paradox , 1981, Math. Program..

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

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

[25]  Yu Nie,et al.  Equilibrium analysis of macroscopic traffic oscillations , 2010 .