Approximation to Optimal Dynamic Traffic Assignment of Peak Period Traffic to a Congested City Network
We present a vehicle-by-vehicle deterministic queueing traffic assignment model for minimising total travel delay in a congested road network. The model routes drivers, one at a time, according to the marginal delay of each link. This is regarded as a combination of the delay caused by each driver to others travelling in the whole network, and the travel delay experienced by the driver himself. This yields an approximate system optimal routeing pattern and the corresponding road prices needed to cause the user equilibrium traffic pattern, which would arise from each driver minimising only his own travel delays, to be the approximate system optimal one. A key characteristic of the model presented is that it is applicable to (multi-commodity) networks having many origin-destination pairs and many bottlenecks. The model has evolved as a result of the initial study on this problem in Ghali and Smith , and basically extends the model in that paper. Computational results comparing network performance of applying the model of this paper against that of the previous paper as well as against network performance due to the natural user equilibrium networks are provided.
KeywordsOptimal Route Traffic Assignment Link Bottleneck Single Vehicle Dynamic Traffic Assignment
Unable to display preview. Download preview PDF.
- M. O. Ghali and M. J. Smith. “A Model for the Dynamic System Optimum Traffic Assignment Problem”. Paper presented at the 71st Annual Meeting of the Transportation Research Board, Washington, 1992, and to appear in Transportation Research-B, 1994.Google Scholar
- T. L. Friesz, F. J. Luque, R. L. Tobin and B. W. Wie. “Dynamic Network Traffic Assignment Considered as a Continuous Time Optimal Problem”. Operations Research 35, 58–69, 1989.Google Scholar
- M. O. Ghali and M. J. Smith. “Traffic Assignment, Traffic Control and Road pricing”. Proceedings of the 12th International Symposium on Transportation and Traffic Theory. Editor: C. Daganzo. Elsevier, New York, 147–170, 1993.Google Scholar
- M. J. Smith and M. O. Ghali. “The dynamics of traffic assignment and traffic control”. Paper presented at the joint Italian/USA Seminar on Congested Urban Networks: Traffic Control and Dynamic Equilibrium, Capri, April 1989, and is published in Transportation Research, Vol. 24B, pp. 409–422, 1990.Google Scholar
- M. J. Smith and M. O. Ghali. “Dynamic traffic assignment and dynamic traffic control”. Proceedings of the llth International Symposium on Transportation and Traffic Theory. Editor: M. Koshi. Elsevier, New York, London and Amsterdam, 223–263, 1990.Google Scholar
- NB Taylor. CONTRAM 5: “An Enhanced Traffic Assignment Model”. Transport Research Laboratory, Crowthorne, United Kingdom, 1990.Google Scholar
- R. Bellman. “On a Routing Problem”. Quart. Appl. Math., Vol 16, 87–90, 1958.Google Scholar
- D. E. Kaufman and R. L. Smith. “Fastest Paths in Time-Dependent Networks for Intelligent Vehicle-Highway Systems Applications”. IVHS Journal, 1 (1), 1–11, 1993.Google Scholar