Abstract
We provide an equivalent formulation of a previously proposed noniterative algorithm (see A. Maugeri, Appl. Math. Optim. 16, 169–185, 1987) for the traffic equilibrium problem. Moreover, under the strict monotonicity assumption, we provide an improved algorithm which enlarges the range of applicability of the previous algorithm and decreases considerably its computational effort. Our algorithm is based on a general algorithm for variational inequalities (see O. Mancino, G. Stampacchia, J. Optim. Theory Appl. 9, 3–23, 1972), which we further develop and adapt to the traffic equilibrium problem. Both our proofs and the algorithm exploit directly the equilibrium conditions which characterize our problem.
Similar content being viewed by others
References
Maugeri, A.: Convex programming, variational inequalities, and applications to the traffic equilibrium problem. Appl. Math. Optim. 16, 169–185 (1987)
Mancino, O., Stampacchia, G.: Convex programming and variational inequalities. J. Optim. Theory Appl. 9, 3–23 (1972)
Giannessi, F., Maugeri, A. (eds.): Variational Inequalities and Network Equilibrium Problems. Plenum, New York (1995)
Facchinei, F., Pang, J.S.: Finite-Dimensional Variational Inequalities and Complementarity Problems. Springer, New York (2003)
Dafermos, S.: Traffic equilibrium and variational inequalities. Transp. Sci. 14, 42–54 (1980)
Patriksson, M.: The Traffic Assignment Problem. VSP, Utrecht (1994)
Smith, M.J.: The existence, uniqueness and stability of traffic equilibrium. Transp. Res. 138, 295–304 (1979)
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by F. Giannessi.
Rights and permissions
About this article
Cite this article
Raciti, F., Falsaperla, P. Improved Noniterative Algorithm for Solving the Traffic Equilibrium Problem. J Optim Theory Appl 133, 401–411 (2007). https://doi.org/10.1007/s10957-007-9230-0
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10957-007-9230-0