{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,12]],"date-time":"2026-04-12T21:46:58Z","timestamp":1776030418514,"version":"3.50.1"},"reference-count":31,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2001,11,1]],"date-time":"2001-11-01T00:00:00Z","timestamp":1004572800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2001,11]]},"DOI":"10.1016\/s0377-2217(00)00287-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T21:07:57Z","timestamp":1027631277000},"page":"27-41","source":"Crossref","is-referenced-by-count":53,"title":["A self-adaptive projection and contraction algorithm for the traffic assignment problem with path-specific costs"],"prefix":"10.1016","volume":"135","author":[{"given":"Anthony","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hong K.","family":"Lo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hai","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(00)00287-3_BIB1","unstructured":"Aashtiani, H., 1979. The multi-modal traffic assignment problem. Ph.D. Thesis, Operations Research Center, MIT, Cambridge, MA"},{"key":"10.1016\/S0377-2217(00)00287-3_BIB2","series-title":"Nonlinear Programming: Theory and Algorithms","author":"Bazaraa","year":"1993"},{"key":"10.1016\/S0377-2217(00)00287-3_BIB3","doi-asserted-by":"crossref","unstructured":"Bernstein, D., Gabriel, G., 1997. Solving the nonadditive traffic equilibrium problem. In: Pardalos, P., Hearn, D., Hager, W. (Eds.), Proceedings of the Network Optimization Conference. Springer, New York, pp. 72\u2013102","DOI":"10.1007\/978-3-642-59179-2_5"},{"key":"10.1016\/S0377-2217(00)00287-3_BIB4","doi-asserted-by":"crossref","unstructured":"Cascetta, E., Russo, F., Vitetta, A., 1997. Stochastic user equilibrium assignment with explicit path enumeration: Comparison of models and algorithms. In: Proceedings of the International Federation of Automatic Control: Transportation Systems. Chania, Greece, pp. 1078\u20131084","DOI":"10.1016\/S1474-6670(17)43956-5"},{"key":"10.1016\/S0377-2217(00)00287-3_BIB5","unstructured":"Chen, A., Lee, D.-H., 1999. Path-based algorithms for large scale traffic equilibrium problem: A comparison between DSD and GP. Paper presented at the 79th Annual Meeting of Transportation Research Board"},{"key":"10.1016\/S0377-2217(00)00287-3_BIB6","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1007\/BF01584073","article-title":"On the basic theorem of complementarity","volume":"1","author":"Eaves","year":"1971","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(00)00287-3_BIB7","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1080\/02331939208843795","article-title":"A special Newton-type optimization method","volume":"24","author":"Fischer","year":"1992","journal-title":"Optimization"},{"issue":"4","key":"10.1016\/S0377-2217(00)00287-3_BIB8","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1287\/trsc.31.4.337","article-title":"The traffic equilibrium problem with nonadditive path costs","volume":"31","author":"Gabriel","year":"1997","journal-title":"Transportation Science"},{"issue":"1","key":"10.1016\/S0377-2217(00)00287-3_BIB9","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1023\/A:1009621108971","article-title":"Nonadditive shortest paths: subprobelms in multi-agent competitive network model","volume":"6","author":"Gabriel","year":"2000","journal-title":"Computational and Mathematical Organization Theory"},{"key":"10.1016\/S0377-2217(00)00287-3_BIB10","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF01182323","article-title":"A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming","volume":"25","author":"He","year":"1992","journal-title":"Applied Mathematics and Optimization"},{"key":"10.1016\/S0377-2217(00)00287-3_BIB11","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF00939669","article-title":"On a class of iterative projection and contraction methods for linear programming","volume":"78","author":"He","year":"1993","journal-title":"Journal of Optimization Theory and Applications"},{"key":"10.1016\/S0377-2217(00)00287-3_BIB12","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/BF01581141","article-title":"A new method for a class of linear variational inequalities","volume":"66","author":"He","year":"1994","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(00)00287-3_BIB13","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s002110050048","article-title":"Solving a class of linear projection equations","volume":"68","author":"He","year":"1994","journal-title":"Numerische Mathematik"},{"issue":"1","key":"10.1016\/S0377-2217(00)00287-3_BIB14","first-page":"54","article-title":"A modified projection and contraction method for a class of linear complementarity problems","volume":"14","author":"He","year":"1996","journal-title":"Journal of Computational Mathematics"},{"key":"10.1016\/S0377-2217(00)00287-3_BIB15","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s002459900037","article-title":"A class of projection and contraction methods for monotone variational inequalities","volume":"35","author":"He","year":"1997","journal-title":"Applied Mathematics and Optimization"},{"key":"10.1016\/S0377-2217(00)00287-3_BIB16","first-page":"35","article-title":"The extra gradient method for finding saddle points and other problems","volume":"12","author":"Korpelevich","year":"1977","journal-title":"Matekon"},{"key":"10.1016\/S0377-2217(00)00287-3_BIB17","unstructured":"Lo, H.K., 1997. A path-based traffic assignment formulation. Paper presented at the 76th Annual Meeting of Transportation Research Board"},{"key":"10.1016\/S0377-2217(00)00287-3_BIB18","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1016\/S0191-2615(99)00035-1","article-title":"Traffic equilibrium problem with route-specific costs: Formulation and algorithms","volume":"34","author":"Lo","year":"1999","journal-title":"Transportation Research B"},{"key":"10.1016\/S0377-2217(00)00287-3_BIB19","series-title":"Transportation and Traffic Theory","first-page":"327","article-title":"A dynamic traffic assignment formulation that encapsulates the cell transmission model","author":"Lo","year":"1999"},{"key":"10.1016\/S0377-2217(00)00287-3_BIB20","series-title":"Introduction to Linear and Nonlinear Programming","author":"Luenberger","year":"1973"},{"key":"10.1016\/S0377-2217(00)00287-3_BIB21","series-title":"Network Economics, A Variational Inequality Approach","author":"Nagurney","year":"1993"},{"key":"10.1016\/S0377-2217(00)00287-3_BIB22","series-title":"Projected Dynamical Systems and Variational Inequality with Applications","author":"Nagurney","year":"1996"},{"key":"10.1016\/S0377-2217(00)00287-3_BIB23","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1287\/trsc.18.2.185","article-title":"An efficient method for computing traffic equilibria in networks with asymmetric transportation costs","volume":"18","author":"Nguyen","year":"1984","journal-title":"Transportation Science"},{"key":"10.1016\/S0377-2217(00)00287-3_BIB24","unstructured":"Scott, K., Bernstein, D., 1997. Solving a best path when the value of the time function is nonlinear. Paper presented at the 79th Annual Meeting of Transportation Research Board"},{"key":"10.1016\/S0377-2217(00)00287-3_BIB25","series-title":"Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods","author":"Sheffi","year":"1985"},{"key":"10.1016\/S0377-2217(00)00287-3_BIB26","doi-asserted-by":"crossref","first-page":"1814","DOI":"10.1137\/S0363012994268655","article-title":"Modified projection-type methods for monotone variational inequalities","volume":"34","author":"Solodov","year":"1996","journal-title":"SIAM Journal of Control and Optimization"},{"key":"10.1016\/S0377-2217(00)00287-3_BIB27","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF02192286","article-title":"A class of iterative methods for solving nonlinear projection equations","volume":"91","author":"Sun","year":"1996","journal-title":"Journal of Optimization Theory and Applications"},{"key":"10.1016\/S0377-2217(00)00287-3_BIB28","first-page":"183","article-title":"A projection and contraction method for the nonlinear complementarity problem and its extensions","volume":"16","author":"Sun","year":"1994","journal-title":"Mathematica Numerica Sinica"},{"key":"10.1016\/S0377-2217(00)00287-3_BIB29","doi-asserted-by":"crossref","unstructured":"Wardrop, J.G., 1952. Some theoretical aspects of road traffic research. In: Proceedings of the Institute of Civil Engineers, Part II, 1, pp. 325\u2013378","DOI":"10.1680\/ipeds.1952.11362"},{"issue":"2","key":"10.1016\/S0377-2217(00)00287-3_BIB30","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/S0191-2615(99)00044-2","article-title":"A path-based traffic assignment algorithm using the TRANSYT traffic model","volume":"35","author":"Wong","year":"2001","journal-title":"Transportation Research B"},{"key":"10.1016\/S0377-2217(00)00287-3_BIB31","unstructured":"Yang, H., He, B.S., 1998. Neural network based dynamic method for solving general network equilibrium problems. Working Paper, Hong Kong University of Science and Technology"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221700002873?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221700002873?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T17:50:08Z","timestamp":1555782608000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221700002873"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,11]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,11]]}},"alternative-id":["S0377221700002873"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(00)00287-3","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2001,11]]}}}