Solving non-additive traffic assignment problems: A descent method for co-coercive variational inequalities

European Journal of Operational Research

Volumn 159, Issue 3, 2004, Pages 529-544

  Han, Deren ^a   Lo, Hong K ^b  

^a NANJING NORMAL UNIVERSITY   (China)

^b HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

Co coercivity; Traffic assignment; Variational inequalities

Indexed keywords

CARBON MONOXIDE; COMPUTATIONAL METHODS; COSTS; HYDROCARBONS; OPTIMIZATION; PROBLEM SOLVING; TRAFFIC CONTROL; TRAFFIC SIGNALS;

CO-COERCIVITY; FUKUSHIMA'S METHOD; TRAFFIC ASSIGNMENT; VARIATIONAL INEQUALITIES;

OPERATIONS RESEARCH;

EID: 3342952037     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(03)00423-5     Document Type: Article

References (33)

1. Gabriel S., Bernstein D. The traffic equilibrium problem with non-additive path costs. Transportation Science. 31:1997;337-348.
2. Lo H. A dynamic traffic assignment formulation that encapsulates the cell transmission model. Cedar A. Transportation and Traffic Theory. 1999;327-350 Elsevier Science, Amsterdam.
3. Wong S.C., Yang C., Lo H. A path-based traffic assignment algorithm using the TRANSYT traffic model. Transportation Research Part B. 35:2001;163-181.
4. Bernstein D., Gabriel S. Solving the non-additive traffic equilibrium problem. Pardalos P., Hearn D., Hager W. Proceedings of the Network Optimization Conference. 1997;72-102 Springer, Berlin.
5. Lo H., Chen A. Reformulating the traffic equilibrium problem via a smooth gap function. Mathematical and Computational Models. 31:2000;179-195.
6. Lo H., Chen A. Traffic equilibrium problem with route-specific costs: Formulation and algorithms. Transportation Research Part B. 34:2000;493-513.
7. Bertsekas D.P., Gafni E.M. Projection method for variational inequalities with application to the traffic assignment problem. Mathematical Programming. 17:1982;139-159.
8. He B. A class of projection and contraction methods for monotone variational inequalities. Applied Mathematics and Optimization. 35:1997;69-76.
9. Harker P.T., Pang J.S. Finite-dimensional variational inequality and nonlinear complementarity problems: A Survey of theory, algorithms and applications. Mathematical Programming. 48:1990;161-220.
10. Taji K., Fukushima M., Ibaraki T. A globally convergent Newton method for solving strongly monotone variational inequalities. Mathematical Programming. 58:1993;369-383.
11. Ferris M.C., Pang J.S. Engineering and economic applications of complementarity problems. SIAM Review. 39:1997;669-713.
12. Ferris M.C., Kanzow C. Complementarity and related problems. Parados P.M., Resende M.G.C. Handbook on Applied Optimization. 2000;Oxford University Press, Oxford.
13. Eaves B.C. On the basic theorem of complementarity. Mathematical Programming. 1:1971;68-85.
14. Fukushima M. Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems. Mathematical Programming. 53:1992;99-110.
15. He B. A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming. Applied Mathematics and Optimization. 25:1992;247-262.
16. Cohen G. Auxiliary problem principle extended to variational inequalities. Journal of Optimization Theory and Applications. 59:1988;325-333.
17. Zhu D.L., Marcotte P. Co-coercivity and its role in the convergence of iterative schemes for solving variational inequalities. SIAM Journal of Optimality. 6:1996;714-726.
18. Tseng P. Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming. Mathematical Programming. 48:1990;249-264.
19. Noor M.A. A modified projection method for monotone variational inequalities. Applied Mathematical Letters. 12(5):1999;83-87.
20. Gafni E.M., Bertsekas D.P. Two-metric projection methods for constrained optimization. SIAM Journal of Control and Optimization. 22:1984;936-964.
21. Peng J.M. Equivalence of variational inequality problems to unconstrained minimization. Mathematical Programming. 78:1997;347-355.
22. Pang J.S. Error bounds in mathematical programming. Mathematical Programming. 79:1997;299-332.
23. Nagurney A. Network Economics: A Variational Inequality Approach. 1993;Kluwer Academics Publishers, Dordrecht.
24. Wardrop J.G. Some theoretical aspects of road traffic research. Proceedings of the Institute of Civil Engineers, Part II. 1:1952;325-378.
25. Marcotte P., Wu J.H. On iterative projection methods for the variational inequality problem. Journal of Optimization Theory and Applications. 85:1992,1995;347-362.
26. Chen A., Lo H., Yang H. A self-adaptive projection and contraction algorithm for the traffic equilibrium problem with route-specific costs. European Journal of Operational Research. 135(1):2001;27-41.
27. Nguyen S., Dupuis C. An efficient method for computing traffic equilibria in networks with asymmetric transportation costs. Transportation Science. 18:1984;185-202.
28. K. Scott and D. Bernstein, Solving a traffic equilibrium problem when path costs are non-additive, in: Paper presented at the 78th Annual Meeting of the Transportation Research Board, Washington, DC, January 1999.
29. Han D., Lo H. A new alternating direction method for a class of variational inequality problems. Journal of Optimization Theory and Applications. 112:2002;549-560.
30. Han D. A modified alternating direction method for variational inequality problems. Applied Mathematics and Optimization. 45:2002;63-74.
31. Tong C.O., Wong S.C. A stochastic transit assignment model using a dynamic schedule-based network. Transportation Research. 33B:1999;107-121.
32. K. Scott, D. Bernstein, Solving the minimum cost path problem when the value of time function is nonlinear, in: Proceedings of TRISTAN III, vol. 1, San Juan, Puerto Rico, 17-23 June 1998.
33. Lo H., Yip C.W., Wan K.H. Modeling transfers and nonlinear fare structure in multi-modal transit network. Transportation Research. 37 B:2003;149-170.