Abstract
This paper compares modeling of traffic flow on networks in such a manner that total user cost is minimized with the modeling of flow so that an equilibrium is achieved. A detailed comparison of the output from these two models is presented for a 76 arc, 24 node sketch planning network used to model the city of Sioux Falls, South Dakota. The results indicate that the difference between the two sets of flows is small enough to justify the simplifying assumption that total user cost is minimized. Such an assumption is often made in network design or link addition models to achieve computational ease, particularly in the context of multiple objectives.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Beckmann, M., McGuire, C.B. and Winsten, C., Studies in the Economics of Transportation, New Haven, Connecticut, Yale University Press (1956).
Comsis Corporation, Traffic Assignment; Methods-Applications-Products. Prepared for Urban Planning Division, Office of Planning, Federal Highway Administration, Preliminary- Subject to Review (1972).
Dreyfus, S.E., “An Appraisal of Some Shortest Path Algorithms”, Operations Research, 394–412 (1969).
Jackson, L.F. et al., “Equilibrium Models”, Search and Choice in Transport System Planning, Vol. IX, Massachusetts Institute of Technology (1968).
LeBlanc, L.J., “Mathematical Programming Algorithms for Large Scale Network Equilibrium and Network Design Problems”, Ph.D. Dissertation, Dept. of Industrial Engineering and Management Sciences, Northwestern University (1973).
LeBlanc, L.J., Morlok, E,K, and Pierskalla, W.P., “An Accurate and Efficient Approach to Equilibrium Traffic Assignment on Congested Networks”, Transportation Research Record 491 - Interactive Graphics and Transportation Systems Planning, 12–33, (1974).
Martin, B.V. and Manheim, M.L., “A Research Program for Comparison of Traffic Assignment Techniques”, Highway Research Record 88, 69–84 (1965).
Murchland, J.D., “Braess’ Paradox of Traffic Flow”, Transportation Research 391–394 (1970).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1976 Springer-Verlag Berlin · Heidelberg
About this paper
Cite this paper
LeBlanc, L.J., Morlok, E.K. (1976). An Analysis and Comparison of Behavioral Assumptions in Traffic Assignment. In: Florian, M.A. (eds) Traffic Equilibrium Methods. Lecture Notes in Economics and Mathematical Systems, vol 118. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-48123-9_21
Download citation
DOI: https://doi.org/10.1007/978-3-642-48123-9_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07620-9
Online ISBN: 978-3-642-48123-9
eBook Packages: Springer Book Archive