The formulation of static assignment models, with variable and fixed demand, based on Wardrop's first principle, are presented for deterministic and stochastic models. The main algorithms used to obtain solutions for these network equilibrium models are given for each class of assignment problems. Calibration and validation issues are considered.
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
Aashtiani, H.Z., Magnanti, T.L.: Equilibria on a Congested Transportation Network. SIAM Journal on Algebraic Discrete Methods, 2, 213–226 (1981)
Arezki, Y., Van Vliet, D.: A Full Analytical Implementation of the PARTAN/- Frank-Wolfe Algorithm for Equilibrium Assignment. Transportation Science, 24, 58–62 (1990)
Beckmann, M.J., McGuire, C.B., Winsten, C.B.: Studies in the Economics of Transportation. Yale University Press, New Haven, Connecticut (1956)
Bruynooghe, M., Gibert, A., Sakarovitch, M.: Une Méthode D’affectation du Trafic. In: Leutzbach, W., Baron, P. (eds) Proceedings of the 4th International Symposium on the Theory of Road Traffic Flow, Beiträge zur Theorie des Verkehrsflusses Strassenbau und Strassenverkehrstechnik, Vol. 86, Karlsruhe, Germany, Herausgegeben von Bundesminister für Verkehr, Abteilung Strassenbau, Bonn, 198–204 (1968,1969)
Dafermos, S.: An Extended Traffic Assignment Model with Applications to Two-Way Traffic. Transportation Science, 5, 366–389 (1971)
Dafermos, S.: An Iterative Scheme for Variational Inequalities. Mathematical Programming, 26, 40–47 (1983)
Dafermos, S.: Traffic Equilibrium and Variational Inequalities. Transportation Science, 14, 42–54 (1980)
Dafermos, S., Nagurney, A.: Sensitivity Analysis for the Asymmetric Network Equilibrium Problem. Mathematical Programming, 28, 174–184 (1984)
Daganzo, C.F., Sheffi, Y.: On Stochastic Models of Traffic Assignment. Transportation Science, 11, 253–274 (1977)
Dow, P., Van Vliet, D.: Capacity Restrained Road Assignment. Traffic Engineering and Control, 20, 261–273 (1979)
Evans, S.P.: Derivation and Analysis of Some Models for Combining Trip Distribution and Assignment. Transportation Research, 10, 37–57 (1976)
Florian, M., Guélat, Y., Spiess, H.: An Efficient Implementation of the PARTAN Variant of the Linear Approximation for the Network Equilibrium Problem. Networks, 17, 319–339 (1987)
Florian, M., Hearn, D.: Network Equilibrium Models and Algorithms. In: Ball, M.O. et al. (eds) Handbooks in OR and MS, Vol. 8, Ch. 6, North-Holland, Amsterdam, 485–550 (1995)
Florian, M., Nguyen, S.: An Application and Validation of Equilibrium Trip Assignment Methods. Transportation Science, 10, 379–389 (1976)
Florian, M., Spiess, H.: On Binary Mode Choice/Assignment Models. Transportation Science, 17, 32–47 (1983)
Frank, M., Wolfe, P.: An Algorithm for Quadratic Programming, Naval Research Logistics Quarterly, 3, 95–110 (1956)
Hall, M.: Properties of the Equilibrium State in Transportation Networks. Transportation Science, 12, 208–216 (1978)
Hearn, D.W., Lawphongpanich, S., Ventura, Y.A.: Finiteness in Restricted Simplicial Decomposition. Operations Research Letters, 4, 125–130 (1985)
Hearn, D.W., Lawphongpanich, S., Ventura, Y.A.: Restricted Simplicial Decomposition: Computation and Extensions. Mathematical Programming Study, 31, 99–118 (1987)
Knight, F.H.: Some Fallacies in the Interpretation of Social Costs. Quarterly Journal of Economics, 38, 306–312 (1924)
LeBlanc, L.J., Helgason, R.V., Boyce, D.E.: Improved Efficiency of the Frank-Wolfe Algorithm for Convex Network Programs. Transportation Science, 19, 445–462 (1985)
LeBlanc, L.J., Morlok, E.K., Pierskalla, W.P.: An efficient Approach to Solving the Road Network Equilibrium Traffic Assignment Problem. Transportation Research, 5, 309–318 (1975)
Luenberger, D.G.: Introduction to Linear and Non-linear Programming. Addison-Wesley, Reading, Massachusetts (1965)
Nguyen, S.: A Unified Approach to Equilibrium Methods for Traffic Assignment. In: Florian, M. (ed) Proceedings of a Conference on Traffic Equilibrium Methods, 1974, Lecture Notes in Economics and Mathematical Systems, 118, Springer-Verlag, Berlin, 148–182 (1976)
Patricksson, P.: The Traffic Assignment Problem: Models and Methods. VNU Science Press, Utrecht, 223 (1993)
Powell, W.B., Sheffi, Y.: The Convergence of Equilibrium Algorithms with Predetermined Step Sizes. Transportation Science, 16, 45–55 (1982)
Sheffi, Y., Powell, W.B.: An Algorithm for the Equilibrium Assignment Problem with Random Link Times. Networks, 12, 191–207 (1982)
Smith, M.J.: Existence, Uniqueness and Stability of Traffic Equilibria. Transportation Research B, 13, 295–304 (1979)
von Hohenbalken, B.: Simplicial Decomposition in Nonlinear Programming Algorithms. Mathematical Programming, 13, 49–68 (1977)
Wardrop, J.G.: Some Theoretical Aspects of Road Traffic Research. In: Proceedings of Institute of Civil Engineers, Part II, 325–378 (1952)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Florian, M., Hearn, D.W. (2008). Traffic Assignment: Equilibrium Models. In: Chinchuluun, A., Pardalos, P.M., Migdalas, A., Pitsoulis, L. (eds) Pareto Optimality, Game Theory And Equilibria. Springer Optimization and Its Applications, vol 17. Springer, New York, NY. https://doi.org/10.1007/978-0-387-77247-9_22
Download citation
DOI: https://doi.org/10.1007/978-0-387-77247-9_22
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-77246-2
Online ISBN: 978-0-387-77247-9
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)