Using ACCPM in a simplicial decomposition algorithm for the traffic assignment problem
 Dulce Rosas,
 Jordi Castro,
 Lídia Montero
 … show all 3 hide
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Get AccessAbstract
The purpose of the traffic assignment problem is to obtain a traffic flow pattern given a set of origindestination travel demands and flow dependent link performance functions of a road network. In the general case, the traffic assignment problem can be formulated as a variational inequality, and several algorithms have been devised for its efficient solution. In this work we propose a new approach that combines two existing procedures: the master problem of a simplicial decomposition algorithm is solved through the analytic center cutting plane method. Four variants are considered for solving the master problem. The third and fourth ones, which heuristically compute an appropriate initial point, provided the best results. The computational experience reported in the solution of real largescale diagonal and difficult asymmetric problems—including a subset of the transportation networks of Madrid and Barcelona—show the effectiveness of the approach.
 Aashtiani, H.Z., Magnanti, T.L.: A linearization and decomposition algorithm for computing urban traffic equilibria. In: Proceedings of the IEEE Large Scale Systems Symposium, pp. 8–19, 1982
 Auslender, A. (1976) Optimization. Métodes Numériques. Masson, Paris
 BarGera, H. (2002) Originbased algorithm for the traffic assignment problem. Transp. Sci. 36: pp. 398417 CrossRef
 Beckmann, M.J., McGuire, C., Wisten, C.: Studies in the economics of transportation (1956)
 Bertsekas, D.P., Gafni, E.M. (1982) Projection methods for variational inequalities with application to the traffic assignment problem. Math. Program. Study 17: pp. 139159
 Dafermos, S. (1980) Traffic equilibrium and variational inequalities. Transp. Sci. 14: pp. 4254 CrossRef
 Dafermos, S. (1982) Relaxation algorithms for the general asymmetric traffic equilibrium problem. Transp. Sci. 16: pp. 231240 CrossRef
 Denault, M., Goffin, J.L. (1999) On a primaldual analytic center cutting plan method for variational inequalities. Comput. Optim. Appl. 12: pp. 127156 CrossRef
 Facchinei, F., Pang, J.S. (2003) FiniteDimensional Variational Inequalities and Complementarity Problems, vols. I–II. Springer, New York
 Florian, M. (1986) Nonlinear cost network models in transportation analysis. Math. Program. Study 26: pp. 167196
 Florian, M., Spiess, H. (1982) The convergence of diagonalization algorithms for asymmetric network equilibrium problems. Transp. Res. 16B: pp. 477483 CrossRef
 Frank, M., Wolfe, P. (1956) An algorithm for quadratic programming. Naval Res. Logist. Q. 3: pp. 95110 CrossRef
 Fukushima, M. (1986) A relaxed projection method for variational inequalities. Math. Program. 35: pp. 5870 CrossRef
 Fukushima, M., Itoh, T. (1987) A dual approach to asymmetric traffic equilibrium problems. Math. Jpn. 32: pp. 701721
 Goffin, J.L., Haurie, A., Vial, J.P. (1992) Decomposition and nondifferentiable optimization with the projective algorithm. Manag. Sci. 382: pp. 284302 CrossRef
 Goffin, J.L., Gondzio, J., Sarkissian, R., Vial, J.P. (1997) Solving nonlinear multicommodity problems by the analytic center cutting plane method. Math. Program. 76: pp. 131154
 Goffin, J.L., Marcotte, P., Zhu, D. (1997) An analytic cutting plane method for pseudomonotone variational inequalities. Oper. Res. Lett. 20: pp. 16 CrossRef
 Goffin, J.L., Sarkissian, R., Vial, J.P. (1997) Using an interior point method for the master problem in a decomposition approach. Eur. J. Oper. Res. 101: pp. 577587 CrossRef
 Hearn, D.W., Lawphongpanich, S., Ventura, J.A. (1987) Restricted simplicial decomposition: computation and extensions. Math. Program. Study 31: pp. 99118
 Katsura, R., Fukushima, M., Ibaraki, T. (1989) Interior methods for nonlinear minimum cost network flow problems. J. Oper. Res. Soc. Jpn. 32: pp. 174199
 Larsson, T., Patriksson, M. (1992) Simplicial decomposition with disaggregated representation for the traffic assignment problem. Transp. Sci. 26: pp. 417 CrossRef
 Lawphongpanich, S., Hearn, D.W. (1984) Simplicial decomposition of the asymmetric traffic assignment problem. Transp. Res. 18B: pp. 123133 CrossRef
 Lawphongpanich, S., Hearn, D.W. (1986) Restricted simplicial decomposition with application to the traffic assignment problem. Ric. Oper. 38: pp. 97120
 LeBlanc, L.J., Morlok, E.K., Pierskalla, W.P. (1975) An efficient approach to solving the road network equilibrium traffic assignment problem. Transp. Res. 9: pp. 309318 CrossRef
 Marcotte, P. (1985) A new algorithm for solving the variational inequalities with application to the traffic assignment problem. Math. Program. Study 33: pp. 339351 CrossRef
 Marcotte, P., Dussault, J.P.: A modified newton method for solving variational inequalities. In: Proceedings of the 24th IEEE Conference on Decision and Control, vol. 33, pp. 1433–1436, 1985
 Marcotte, P., Guélat, J. (1988) Adaptation of a modified newton method for solving the asymmetric traffic equilibrium problem. Transp. Sci. 22: pp. 112124 CrossRef
 Minty, G.J. (1967) On the generalization of a direct method of the calculus of variations. Bull. Am. Math. Soc. 73: pp. 315321 CrossRef
 Montero, L.: A simplicial decomposition approach for solving the variational inequality formulation of the general traffic assignment problem for large scale networks. PhD thesis, Universitat Politècnica de Catalunya, Barcelona, Spain (1992)
 Montero, L., Barceló, J. (1996) A simplicial decomposition algorithm for solving the variational inequality formulation of the general traffic assignment problem for large scale networks. TOP 4: pp. 225256 CrossRef
 Nesterov, Y., Nemirovskii, A. (1994) InteriorPoint Polynomial Algorithms in Convex Programming. SIAM, Philadelphia
 Nesterov, Y., Vial, J.P.: Homogeneous analytic center cutting plane methods for convex problems and variational inequalities. Tech. Rep. 4 Logilab (1997)
 Newell, G. (1980) Traffic Flow on Transportation Networks. MIT Press, Cambridge
 Nguyen, S., Dupuis, C. (1984) An efficient method for computing traffic equilibria in networks with asymmetric transportation costs. Transp. Sci. 18: pp. 185202 CrossRef
 Patriksson, M. (1994) The Traffic Assignment Problem: Models and Methods. VSP B.V., Zeist
 Patriksson, M. (1998) Nonlinear Programming and Variational Inequality Problems—A Unified Approach. Kluwer Academic, Dordrecht
 Rosas, D., Castro, J., Montero, L.: Solving the traffic assignment problem using ACCPM. Tech. Rep. DR 200218, Statistics and Operation Research Department: Universitat Politècnica de Catalunya, Barcelona, Spain (2002)
 Smith, M.J. (1979) Existence, uniqueness and stability of traffic equilibria. Transp. Res. 13B: pp. 295304 CrossRef
 Smith, M.J. (1983) The existence and calculation of traffic equilibria. Transp. Res. 17B: pp. 291303 CrossRef
 Smith, M.J. (1983) An algorithm for solving asymmetric equilibrium problems with a continuous costflow function. Transp. Res. 17B: pp. 365371 CrossRef
 Solodov, M., Tseng, P. (1996) Modified projectiontype methods for monotone variational inequalities. SIAM J. Control Optim. 34: pp. 18141830 CrossRef
 Sonnevend, G.: New algorithms in convex programming based on a notion of “centre” (for systems of analytic inequalities) and on rational extrapolation, Trends Math. Optim. 311–326 (1988)
 Wardrop, J.G.: Some theoretical aspects of road traffic research. In: Proceedings of the Institute of Civil Engineers, Part II, vol. 1, pp. 325–378, 1952
 Title
 Using ACCPM in a simplicial decomposition algorithm for the traffic assignment problem
 Journal

Computational Optimization and Applications
Volume 44, Issue 2 , pp 289313
 Cover Date
 20091101
 DOI
 10.1007/s1058900791536
 Print ISSN
 09266003
 Online ISSN
 15732894
 Publisher
 Springer US
 Additional Links
 Topics
 Keywords

 Traffic assignment problem
 Variational inequalities
 Simplicial decomposition
 Analytic center cutting plane method
 Industry Sectors
 Authors

 Dulce Rosas ^{(1)}
 Jordi Castro ^{(2)}
 Lídia Montero ^{(2)}
 Author Affiliations

 1. CENIT, Universitat Politècnica de Catalunya, Jordi Girona 29, 08034, Barcelona, Spain
 2. Dept. of Statistics and Operations Research, Universitat Politècnica de Catalunya, Jordi Girona 1–3, 08034, Barcelona, Spain