{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T06:21:38Z","timestamp":1781072498483,"version":"3.54.1"},"reference-count":10,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"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":["Mathematics and Computers in Simulation"],"published-print":{"date-parts":[[2002,7]]},"DOI":"10.1016\/s0378-4754(01)00437-2","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T20:48:57Z","timestamp":1034628537000},"page":"509-518","source":"Crossref","is-referenced-by-count":94,"title":["Computational study of state-of-the-art path-based traffic assignment algorithms"],"prefix":"10.1016","volume":"59","author":[{"given":"Anthony","family":"Chen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Der-Horng","family":"Lee","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"R.","family":"Jayakrishnan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0378-4754(01)00437-2_BIB1","unstructured":"M. Bazaraa, C. Shetty, Nonlinear Programming: Theory and Algorithms, Wiley, New York, NY, 1979."},{"key":"10.1016\/S0378-4754(01)00437-2_BIB2","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1109\/TAC.1976.1101194","article-title":"On the Goldstein\u2013Levitin\u2013Polyak gradient projection method","volume":"21","author":"Bertsekas","year":"1976","journal-title":"IEEE Trans. Auto. Control"},{"key":"10.1016\/S0378-4754(01)00437-2_BIB3","unstructured":"A. Chen, R. Jayakrishnan, A path-based gradient projection algorithm: effects of equilibration with a restricted path set under two flow update policies, preprint #981560, in: Proceedings of the Transportation Research Board Annual Meeting, Washington, DC, 1998."},{"key":"10.1016\/S0378-4754(01)00437-2_BIB4","unstructured":"A. Chen, D.-H. Lee, R. Jayakrishnan, Path-based Traffic Assignment Algorithms: Implementation and Computational Study, Working Paper, Department of Civil and Environmental Engineering, Utah State University, Utah, 2001."},{"key":"10.1016\/S0378-4754(01)00437-2_BIB5","unstructured":"O. Damberg, Sequential and Parallel Algorithms for Bipartite and Urban Traffic Networks, Linkoping Studies in Science and Technology, Dissertation No. 430, 1996."},{"key":"10.1016\/S0378-4754(01)00437-2_BIB6","first-page":"75","article-title":"A faster path-based algorithm for traffic assignment","volume":"1443","author":"Jayakrishnan","year":"1994","journal-title":"Transport. Res. Rec."},{"key":"10.1016\/S0378-4754(01)00437-2_BIB7","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/trsc.26.1.4","article-title":"Simplicial decomposition with disaggregated representation for the traffic assignment problem","volume":"26","author":"Larsson","year":"1992","journal-title":"Transport. Sci."},{"key":"10.1016\/S0378-4754(01)00437-2_BIB8","doi-asserted-by":"crossref","first-page":"106","DOI":"10.3141\/1537-15","article-title":"Computational study of a path-based algorithm and its variants for static traffic assignment","volume":"1537","author":"Sun","year":"1996","journal-title":"Transport. Res. Rec."},{"key":"10.1016\/S0378-4754(01)00437-2_BIB9","doi-asserted-by":"crossref","unstructured":"M. Tatineni, H. Edwards, D. Boyce, Comparison of the disaggregate simplicial decomposition and Frank\u2013Wolfe algorithms for user-optimal route choice, Transport. Res. Rec. 1617 (1998) 157\u2013162.","DOI":"10.3141\/1617-22"},{"key":"10.1016\/S0378-4754(01)00437-2_BIB10","unstructured":"Y. Zhang, J. Hicks, D.E. Boyce, Trip data fusion in ADVANCE, ADVANCE Working Paper, No. 43, Urban Transportation Center, University of Illinois, Chicago, 1994."}],"container-title":["Mathematics and Computers in Simulation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0378475401004372?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0378475401004372?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T18:25:00Z","timestamp":1556562300000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0378475401004372"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,7]]},"references-count":10,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2002,7]]}},"alternative-id":["S0378475401004372"],"URL":"https:\/\/doi.org\/10.1016\/s0378-4754(01)00437-2","relation":{},"ISSN":["0378-4754"],"issn-type":[{"value":"0378-4754","type":"print"}],"subject":[],"published":{"date-parts":[[2002,7]]}}}