Published 2010-05-26
Keywords
- Traffic assignment methods,
- equilibrium assignment networks,
- not congested networks
How to Cite
Abstract
Experimenting with different methods of traffc assignment is presented, using prototype network traffc. 21 simulations were performed, using seven methods of allocating three levels of traffc. We use the following traffc assignment methods: All-or-Nothing Assignment, Stochastic Assignment, Incremental Assignment, Capacity Restraint, User Equilibrium, Stochastic User Equilibrium and System Optimum Assignment. We use three kinds of matrixes: a dense, half and half empty. In networks that are not congested, the results show that is indifferent to use one or another traffc assignment method, as the results converge to the system optimum assignment equilibrium.
Downloads
References
J. de D. Ortúzar, and L. G. Willumsen, Modelling Transport. Second Edition, John Wiley & Sons Inc., Chichester, 1995.
L. Márquez, Modelación de la Demanda de Transporte con TransCAD, primera edición, Universidad Pedagógica y Tecnológica de Colombia, Tunja, 2006, p. 151.
R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Networks flows: Theory, algorithms, and applications, first edition, Prentice Hall, New Jersey, 1993, p. 108.
Y. Sheffi, Urban Transportation Networks: Equilibrium analysis with mathematical programming methods, first edition, Massachusetts Institute of Technology, Prentice Hall, New Jersey, 1984, p. 313.
Caliper Corporation, Travel Demand Modeling with TransCAD 4.8. User’s Guide, Caliper Corporation. Newton, Massachusetts, 2005, p. 162.
M. Patriksson, The Traffic Assignment Problem: Models and methods, Linköping Institute of Technology. Linköping, Sweden, 1994, p. 152.