Traffic Simulation with Dynameq

Dynameq is a simulation-based dynamic traffic assignment (DTA ) model. This model employs an iterative solution method to find the user-optimal assignment of time-varying origin–destination demands to paths through a road network where the path travel times – which depend on the assigned path flows – are time-varying and determined using a detailed traffic simulation model. Increasing congestion and the use of increasingly sophisticated measures to manage it – such as adaptive traffic control, reserved, reversible and tolled lanes, and time-varying congestion pricing – have created a need for models that are more detailed and realistic than static assignment models traditionally used in transportation planning. DTA models have begun to fill that need and have been successfully applied on real-world networks of significant size. This chapter provides a description of the assignment and simulation models that comprise the software, a discussion of fundamental concepts such as user-equilibrium and stability , an introduction to calibration methodology for simulation-based DTA, and a brief description of a typical project.

[1]  Gordon F. Newell,et al.  A simplified car-following theory: a lower order model , 2002 .

[2]  Mike McDonald,et al.  Car-following: a historical review , 1999 .

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

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

[5]  J. S. Wang Statistical Theory of Superlattices with Long-Range Interaction. I. General Theory , 1938 .

[6]  Michael Schreckenberg,et al.  A cellular automaton model for freeway traffic , 1992 .

[7]  J. B. Rosen The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints , 1960 .

[8]  Michel Bierlaire,et al.  DynaMIT: a simulation-based system for traffic prediction and guidance generation , 1998 .

[9]  Sungjoon Lee,et al.  A cell transmission based assignment-simulation model for integrated freeway/surface street systems , 1996 .

[10]  M. Lighthill,et al.  On kinematic waves I. Flood movement in long rivers , 1955, Proceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences.

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

[12]  D. Hearn,et al.  Simplical decomposition of the asymmetric traffic assignment problem , 1984 .

[13]  George L. Nemhauser,et al.  A Column Generation Algorithm for Optimal Traffic Assignment , 1973 .

[14]  Ludovic Leclercq,et al.  Do microscopic merging models reproduce the observed priority sharing ratio in congestion , 2009 .

[15]  Stella Dafermos,et al.  An Extended Traffic Assignment Model with Applications to Two-Way Traffic , 1971 .

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

[17]  J. F. Gabard Car-Following Models , 1991 .

[18]  David G. Luenberger,et al.  Linear and nonlinear programming , 1984 .

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

[20]  J. Wardrop ROAD PAPER. SOME THEORETICAL ASPECTS OF ROAD TRAFFIC RESEARCH. , 1952 .

[21]  Markos Papageorgiou,et al.  Dynamic modeling, assignment, and route guidance in traffic networks , 1990 .

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

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

[24]  Michael Mahut A DISCRETE FLOW MODEL FOR DYNAMIC NETWORK LOADING , 2001 .