{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T23:30:05Z","timestamp":1773617405258,"version":"3.50.1"},"reference-count":19,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":9536,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1980,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>An optimization algorithm for the traffic assignment problem is presented. It is based on determining, for the flow corresponding to each origin at a time, a set of disjoint circuits with the most negative total marginal cost, followed by a unidimensional optimization along these circuits. The proposed method was compared to other well known approaches on randomly generated networks. In most cases the proposed method proved to be highly efficient, particularly when appropriate tighter stopping rules were used. In this sense, it was seen that when stopping rules were based on insufficiently tight tolerances, substantial errors could appear in the equilibrium traffic assignment.<\/jats:p>","DOI":"10.1002\/net.3230100303","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T11:38:51Z","timestamp":1178883531000},"page":"197-209","source":"Crossref","is-referenced-by-count":8,"title":["An algorithm for the traffic assignment problem"],"prefix":"10.1002","volume":"10","author":[{"given":"Andr\u00e9s","family":"Weintraub","sequence":"first","affiliation":[]},{"given":"Jaime","family":"Gonz\u00e1lez","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.7.2.168"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.8.3.203"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/0041-1647(75)90030-1"},{"issue":"2","key":"e_1_2_1_5_2","article-title":"The Traffic Assignment Problem for a General Network,","volume":"37","author":"Dafermos S. C.","year":"1969","journal-title":"J. Res. Nat. Bur. Stand. Sec. B"},{"key":"e_1_2_1_6_2","volume-title":"Flows in Transportation Networks","author":"Potts R. B.","year":"1972"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.9.1.43"},{"key":"e_1_2_1_8_2","first-page":"225","article-title":"Attitudes of Driver Determine Choice Between Alternate Highways,","volume":"34","author":"Michaels R. M.","year":"1965","journal-title":"Public Roads"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.21.1.87"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/321694.321699"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230030105"},{"key":"e_1_2_1_12_2","unstructured":"A.WeintraubandJ.Gonzalez \u201cAn Efficient Algorithm for the Traffic Assignment Problem \u201d Working Paper 77\/07\/C Departmento de Industrias University of Chile (1972). Presented at the TIMS\/ORSA Meeting Atlanta GA November1977."},{"key":"e_1_2_1_13_2","unstructured":"A.Weintraub \u201cOptimal Flows and Games: The Multicommodity Flow Problem in Integers \u201d Working Paper 76\/21\/C Departmento de Industrias University of Chile (1976)."},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.10.4.374"},{"key":"e_1_2_1_15_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01584319"},{"key":"e_1_2_1_16_2","doi-asserted-by":"publisher","DOI":"10.1080\/05695557508975006"},{"key":"e_1_2_1_17_2","unstructured":"M.Florian \u201cAn Improved Method for a Multicommodity Convex Cost Flow Problem \u201d presented at the ORSA\/TIMS Meeting Atlanta GA November 1977."},{"key":"e_1_2_1_18_2","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.8.4.321"},{"key":"e_1_2_1_19_2","doi-asserted-by":"crossref","unstructured":"S.Nguyen \u201cA Unified Approach to Equilibrium Methods for Traffic Assignment \u201d presented at the International Symposium of Traffic Equilibrium Methods Montreal1975.","DOI":"10.1007\/978-3-642-48123-9_8"},{"key":"e_1_2_1_20_2","unstructured":"A.Weintraub andF.Barahona \u201cA Dual Algorithm for the Assignment Problem \u201d Working Paper 79\/02\/C Departamento de Industrias Universidad de Chile."}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230100303","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230100303","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T10:31:33Z","timestamp":1699785093000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230100303"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,9]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1980,9]]}},"alternative-id":["10.1002\/net.3230100303"],"URL":"https:\/\/doi.org\/10.1002\/net.3230100303","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1980,9]]}}}