Abstract
This paper addresses the problem faced by a central controller seeking to optimize overall network performance through the provision of real-time routing information to suitably equipped motorists. Conceptual and mathematical formulations are presented for various scenarios that arise based on the amount of information available to the controller. Principal elements of a dynamic assignment formulation for electronic route guidance systems are discussed, and the associated difficulties for solution methodologies are illustrated. The ideal case of known time-dependent origin-destination flows over the whole planning horizon is formulated as a dynamic system-optimal assignment problem. Extensions and variants of the basic formulation are discussed for incomplete information availability to the central controller.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Boyce, D. E. (1991). “Dynamic User-Optimal Traffic Assignment: A New Model and Solution Technique”, submitted to Transportation Science.
Carey, M. (1986). “A Constraint Qualification for a Dynamic Traffic Assignment Model”,Transportation Science, Vol. 20, pp 55–58.
Carey, M. (1987). “Optimal Time Varying Flows On Congested Networks”, Operations Research, Vol.35, No. 1, pp 58–69.
Carey, M. (1992). “Nonconvexity of the Dynamic Assignment Problem”, Transportation Research, Vol. 26B, No. 2, pp 127–133.
Dreyfus, S. E. (1969). “An Appraisal of Some Shortest-Path Algorithms”, Operations Research 17, pp 395–412.
Friesz, T. L., Luque, J., Tobin, R.L. and Wie, B.W. (1989). “Dynamic Network Traffic Assignment Considered as a Continuous 35 Time Optimal Control Problem”, Operations Research, Vol.37, No. 6, pp 893–901.
Ghali, M. O. and Smith, M.J. (1992). “Optimal Dynamic Traffic-Assignment on a Congested City Network”, presented at the 2nd International Capri Seminar on Urban Traffic Network, Capri, Italy.
Ho, J. K. (1980). “A Successive Linear Optimization Approach to the Dynamic Traffic Assignment Problem”, Transportation Science 14, pp 295–305.
Janson, B. N. (1991). “Dynamic Traffic Assignment with Schedule Delay”, Presented at the 71st TRB Annual Meeting, Washington D.C., 1992.
Kaufman, D. E., Smith, R.L. (1990). “Fastest Paths in Time-Dependent Networks for IVHS Application”, IVHS Journal, Vol.1, No. 1, pp 1–11.
Mahmassani, H.S., Peeta, S. (1993). “Network Performance Under System Optimal and User Equilibrium Dynamic Assignments: Implications for ATIS”, forthcoming in Transportation Research Record, TRB, 1993.
Mahmassani, H. S., Peeta, S., Chang, G., Junchaya, T. (1992). “A Review of Dynamic Assignment and Traffic Simulation Models for ADIS/ATMS Applications”, Technical Report DTFH61-90-R-00074-1, Center for Transportation Research, The University of Texas at Austin.
Mahmassani, H. S., Jayakrishnan, R. (1991). “System Performance and User Response under Real-Time Information in a Congested Traffic Corridor”, Transportation Research, Vol. 25A, No. 5, pp 293–307.
Mahmassani, H. S., Hu, T, Jayakrishnan, R. (1992). “Dynamic Traffic Assignment and Simulation for Advanced Network Informatics”, The Proceedings of the Second International Capri Seminar on Urban Traffic Networks, Capri, Italy, July 5–8, 1992. 36
Merchant, D. K., and Nemhauser, G. L. (1978). “A Model and an Algorithm for the Dynamic Traffic Assignment Problems”, Transportation Science, Vol. 12, No. 3, August 1978, pp 183–199.
Midler, J. L. (1969). “A Stochastic Multiperiod Multimode Transportation Model”, Transportation Science 3, pp 1–7.
Papageorgiou, M., Messmer, A. and Senninger, H. (1990) “Dynamic Network Traffic Assignment Via Feedback Regulation”.
Ran, B., and Shimazaki, T. (1989). “A General Model and Algorithm for the Dynamic Traffic Assignment Problems”, Proceedings of the Fifth World Conference on Transport Research, Yokohoma, Japan.
Ran, B., Boyce, D. E. and LeBianc, L. J. (1993). “A New Class of Instantaneous Dynamic User-Optimal Traffic Assignment Models”, Operations Research, Vol. 41, No. 1, 1993.
Sheffi, Y. (1985). Urban Transportation Networks: “Equilibrium Analysis with Mathematical Programming Methods”, (Prentice-Hall, NJ).
Sheffi, Y., Powell, W. (1982). “An Algorithm for the Equilibrium Assignment Problem with Random Link Times”, Networks 12, pp 191–207.
Smith, M. J. (1991). “A New Dynamic Traffic Model and the Existence and Calculation of Dynamic User Equilibria on Congested Capacity-Constrained Road Networks”, Presented at the 71st Annual Meeting of TRB, Washington D.C., 1992.
Wie, B. W. (1990). “Dynamic Analysis of User Optimized Network Flows With Elastic Travel Demand”, Presented at the 70th Annual Meeting of TRB, Washington, D.C., 1991.
Ziliaskopoulos, A., Mahmassani, H. S. (1992). “Design and Implementation of a Shortest Path Algorithm with Time-Dependent Arc Costs”, Proceedings of the 5th Advanced Technology Conference, Washington D.C., 1992, pp 1072–1093.
Ziliaskopoulos, A., Mahmassani, H. S. (1993). “A Time-Dependent Shortest Path Algorithm For Real-Time Intelligent Vehicle/Highway Systems Applications”, forthcoming Transportation Research Record.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin · Heidelberg
About this paper
Cite this paper
Mahmassani, H.S., Peeta, S. (1995). System Optimal Dynamic Assignment for Electronic Route Guidance in a Congested Traffic Network. In: Gartner, N.H., Improta, G. (eds) Urban Traffic Networks. Transportation Analysis. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-79641-8_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-79641-8_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-79643-2
Online ISBN: 978-3-642-79641-8
eBook Packages: Springer Book Archive