A partial linearization method for the traffic assignment problem

References

• Aashtiani , H.Z. 1979 . “ Ph.D. dissertation, Operations Research Center ” . In The multi-modal traffic assignment problem , Cambridge , MA : Massachusetts Institute of Technology .
   Google Scholar
• Asmuth , R.L. 1978 . Traffic network equilibria , Stanford , CA : Stanford Unversity . Technical Report SOL-78-2
   Google Scholar
• Bazaraa , M.S. and Shetty , C.M. 1979 . Nonlinear Programming: Theory and Algorithms , New York , New York : John Wiley & Sons . NY
   Google Scholar
• Beck , P. , Lasdon , L. and Engqvist , M. 1983 . A reduced gradient algorithm for nonlinear network problems . ACM Transactions on Mathematical Software , 9 : 57 – 70 .
   Web of Science ®Google Scholar
• Beckmann , M.J. , McGuire , C.B. and Winsten , C. 1956 . Studies in the Economics of Transportation , New Haven , CT : Yale University Press .
   Google Scholar
• Bertsekas , D.P. and El Baz , D. 1987 . Distributed asynchronous relaxation methods for convex network flow problems . SIAM Journal on Control and Optimization , 25 : 74 – 85 .
   Web of Science ®Google Scholar
• Bertsekas , D.P. , Hosein , P.A. and Tseng , P. 1987 . Relaxation methods for network flow problems with convex are costs . SIAM Journal on Control and Optimization , 25 : 1219 – 1243 .
   Web of Science ®Google Scholar
• Bregman , I.M. 1967 . The relaxation method of finding the common point of convex sets and operation to the solution of problems in convex programming . USSR Computers Mathematical and Mathematical Physics , 7 : 200 – 217 .
   Google Scholar
• Bruynooghe , M. , Gibert , A. and Sakarovitch , M. Une méthode d’affectation du trafic . Fourth International Symposium on the Theory of Traffic Flow . 1968 , Karlsruhe . Edited by: Lentzbach , W. and Baron , P. Vol. 86 , pp. 198 – 204 . Bonn : Beiträge zur Theorie des Verkehrsflusses Strassenbau und Strassenverkehrstechnik Heft, Herausgegeben von Bundesminister für Verkehr, Abteilung Strassenbau .
   Google Scholar
• Bureau of Public Roads . 1964 . Traffic Assignment Manual , Washington , D.C : U.S. Government Printing Office .
   Google Scholar
• Censor , Y. 1981 . Row-action methods for huge and sparse systems and their applications . SlAM Review , 23 : 444 – 466 .
   Web of Science ®Google Scholar
• Curet , N.D. 1992 . On the dual coordinate ascent approach for nonlinear networks . Computers and Operations Research , 20 : 133 – 140 .
   Web of Science ®Google Scholar
• Dafermos , S. 1980 . Traffic equilibria and variational inequalities . Transportation Science , 14 : 42 – 54 .
   Web of Science ®Google Scholar
• Dafermos , S.C. and Sparrow , E.T. 1969 . The traffic assignment problem for a general network . Journal of Research of the National Bureau of Standards , 73B : 91 – 118 .
   Google Scholar
• Everett , H. 1963 . Generalized Lagrange multiplier method for solving problems of optimum allocation of resources . Operations Research , 11 : 399 – 417 .
   Web of Science ®Google Scholar
• Frank , M. and Wolfe , P. 1956 . An algorithm for quadratic programming . Naval Research Logistics Quarterly , 3 : 95 – 110 .
   Google Scholar
• Hearn , D.W. , Lawphongpanich , S. and Nguyen , S. 1984 . Convex programming formulations of the asymmetric traffic assignment problem . Transportation Research , 18B : 357 – 365 .
   Google Scholar
• Hearn , D.W. , Lawphongpanich , S. and Ventura , J.A. 1987 . Restricted simplicia1 decomposition: Computation and extensions . Mathematical Programming Study , 31 : 99 – 118 .
   Web of Science ®Google Scholar
• Von Hohenbalken , B. 1975 . A finite algorithm to maximize certain pseudoconcave functions on polytopes . Mathematical Programming , 9 : 189 – 206 .
   Web of Science ®Google Scholar
• Von Hohenbalken , B. 1977 . Simplicial decomposition in nonlinear programming algorithms . Mathematical Programming , 13 : 49 – 68 .
   Web of Science ®Google Scholar
• Kennington , J.L. and Helgason , R.V. 1980 . Algorithms for Network Programming , New York : John Wiley & sons . N.Y
   Google Scholar
• Lamond , B. and Stewart , N.F. 1981 . Bregman’s balancing method . Transportation Research , 15B : 239 – 248 .
   Google Scholar
• Larsson , T. and Migdalas , A. 1990 . An algorithm for nonlinear programs over Cartesian product sets . Optimization , 21 : 535 – 542 .
   Google Scholar
• Lawphongpanich , S. and Hearn , D.W. 1984 . Simplicial decomposition of the asymmetric traffic assignment problem . Transportation Research , 18B : 123 – 133 .
   Google Scholar
• LeBlanc , L.J. , Morlok , E.K. and Pierskalla , W.P. 1975 . An efficient approach to solving the road network equilibrium traffic assignment problem . Transportation Research , 9 : 309 – 318 .
   Google Scholar
• Luenberger , D.G. 1984 . Linear and Nonlinear Programming , Reading , MA : Addison Wesley .
   Google Scholar
• Meyer , G.G.L. 1974 . Accelerated Frank-Wolfe algorithms . SIAM Journal on Control , 12 : 655 – 663 .
   Web of Science ®Google Scholar
• Netter , M. and Sender , J.G. 1970 . Equilibre offre-demande et tarification sur un réseau de transport , Arcueil , , France : Institut de Recherche des Transport .
   Google Scholar
• Nguyen , S. 1974 . An algorithm for the traffic assignment problem . Transportation Science , 8 : 302 – 316 .
   Google Scholar
• Nguyen , S. and Dupuis , C. 1984 . An efficient method for computing traffic equilibria in networks with asymmetric transportation costs . Transportation Science , 18 : 185 – 202 .
   Web of Science ®Google Scholar
• Ortega , J.M. and Rheinboldt , W.C. 1970 . Iterative Solution of Nonlinear Equations in Several Variables , New York : Academic Press .
   Google Scholar
• Patriksson M. The trafic assignment problem—theory and algorithms Linköping Institute of Technology, Department of Mathematics Linköping , , Sweden 1990 Report LiTH-MAT-R- 90-29
   Google Scholar
• Patriksson M. Partial linearization methods in non linear programming Linköping Institute of Technology, Department of Mathematics Linköping , , Sweden 1991 Report LiTH-MAT-R- 91-11, Forthcoming in Journal of Optimization Theory and Applications 78, 1993
   Google Scholar
• Patriksson M. A unified description of iterative algorirhms for rrafic equilibria Linköping Institute of Technology, Department of Mathematics Linköping , , Sweden 1991 Report LiTHMAT- R-91-35, Forthcoming in European Journal of Operational Research
   Google Scholar
• Petersen , E.R. 1975 . A primal-dual traffic assignment algorithm . Management Science , 22 : 87 – 95 .
   Web of Science ®Google Scholar
• Pigou , A.C. 1920 . The Economics of Welfare , London : MacMillan & Co .
   Google Scholar
• Smith , M.J. 1979 . The existence, uniqueness and stability of traffic equilibria . Transportation Research , 13B : 295 – 304 .
   Google Scholar
• Wardrop , J.G. 1952 . Some theoritical aspects of road traffic research . Proceedings of the Instituition of civil Engineering , Part II, 1 : 325 – 378 .
   Google Scholar
• Wolfe , P. 1970 . “ Convergence theory in nonlinear programming ” . In Integer and nonlinear programming , Edited by: Abadie , J. 1 – 36 . Amsterdam : North-Holland .
   Google Scholar
• Zenios , S.A. and Mulvey , J.M. 1985 . Relaxation techniques for strictly convex network problems . Annals of Operations Research , 5 : 517 – 538 . 1986
   Google Scholar
• Zenios , S.A. and Mulvey , J.M. 1988 . A distributed algorithm for convex network optimization problems . Parallel Computing , 6 : 45 – 56 .
   Web of Science ®Google Scholar