The formulation of static traffic 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.
KnightF. H.Some fallacies in the interpretation of social costs. Q. J. Economics, 1924, 38, 306–312.
2.
WardropJ. G.Some theoretical aspects of road traffic research. Proc. Inst. Civ. Engrs, Part II, 1952, 325–378.
3.
BeckmannM. J.McGuireC. B.WinstenC. B.Studies in the Economics of Transportation, 1956 (Yale University Press, New Haven, Connecticut).
4.
FlorianM.HearnD.Network equilibrium models and algorithms. In Handbooks in OR and MS, Vol. 8 (Eds BallM. O.), 1995, Ch. 6, pp. 485–550 (North-Holland, Amsterdam).
5.
PatrikssonP.The Traffic Assignment Problem: Models and Methods, 1993, 223 pp. (VNU Science Press, Utrecht).
6.
SmithM. J.Existence, uniqueness and stability of traffic equilibria. Transpn Res. B, 1979, 13, 295–304.
7.
DafermosS.Traffic equilibrium and variational inequalities. Transpn Sci, 1980, 14, 42–54.
8.
AashtianiH. Z.MagnantiT. L.Equilibria on a congested transportation network. SIAM J. Algebraic Discrete Meth., 1981, 2, 213–226.
9.
DafermosS.NagurneyA.Sensitivity analysis for the asymmetric network equilibrium problem. Math. Programming, 1984, 28, 174–184.
10.
HallM.Properties of the equilibrium state in transportation networks. Transpn Sci., 1978, 12, 208–216.
11.
SheffiY.PowellW. B.An algorithm for the equilibrium assignment problem with random link times. Networks, 1982, 12, 191–207.
12.
FrankM.WolfeP.An algorithm for quadratic programming. Nav. Res. Logistics Q., 1956, 3, 95–110.
13.
BruynoogheM.GibertA.SakarovitchM.Une méthode d'affectation du trafic. In Proceedings of the 4th International Symposium on The Theory of Road Traffic Flow, Beiträge zur Theorie des Verkehrsflusses Strassenbau und Strassenverkehrstechnik, Vol. 86 (Eds LeutzbachW.BaronP.), Karlsruhe, Germany, 1968, 1969, pp. 198–204 (Herausgegeben von Bundesminister für Verkehr, Abteilung Strassenbau, Bonn).
14.
LeBlancL. J.MorlokE. K.PierskallaW. P.An efficient approach to solving the road network equilibrium traffic assignment problem. Transpn Res., 1975, 5, 309–318.
15.
NguyenS.A unified approach to equilibrium methods for traffic assignment. In Proceedings of a Conference on Traffic Equilibrium Methods (Ed. FlorianM.), 1974, Lecture Notes in Economics and Mathematical Systems, Vol. 118, 1976, pp. 148–182 (Springer-Verlag, Berlin).
16.
EvansS. P.Derivation and analysis of some models for combining trip distribution and assignment. Transpn Res., 1976, 10, 37–57.
17.
LuenbergerD. G.Introduction to Linear and Nonlinear Programming, 1965 (Addison-Wesley, Reading, Massachusetts).
18.
LeBlancL. J.HelgasonR. V.BoyceD. E.Improved efficiency of the Frank-Wolfe algorithm for convex network programs. Transpn Sci., 1985, 19, 445–162.
19.
FlorianM.GuélatY.SpiessH.An efficient implementation of the PARTAN variant of the linear approximation for the network equilibrium problem. Networks, 1987, 17, 319–339.
20.
ArezkiY.Van VlietD.A full analytical implementation of the PARTAN/Frank-Wolfe algorithm for equilibrium assignment. Transpn Sci., 1990, 24, 58–62.
