{"id":"https://openalex.org/W1996952174","doi":"https://doi.org/10.1002/net.3230100303","title":"An algorithm for the traffic assignment problem","display_name":"An algorithm for the traffic assignment problem","publication_year":1980,"publication_date":"1980-09-01","ids":{"openalex":"https://openalex.org/W1996952174","doi":"https://doi.org/10.1002/net.3230100303","mag":"1996952174"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230100303","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230100303","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5004756987","display_name":"Andr\u00e9s Weintraub","orcid":"https://orcid.org/0000-0003-0440-0311"},"institutions":[{"id":"https://openalex.org/I69737025","display_name":"University of Chile","ror":"https://ror.org/047gc3g35","country_code":"CL","type":"education","lineage":["https://openalex.org/I69737025"]}],"countries":["CL"],"is_corresponding":true,"raw_author_name":"Andr\u00e9s Weintraub","raw_affiliation_strings":["Departamento de Industrias Universidad de Chile, Santiago, Chile"],"affiliations":[{"raw_affiliation_string":"Departamento de Industrias Universidad de Chile, Santiago, Chile","institution_ids":["https://openalex.org/I69737025"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110994981","display_name":"Jaime Gonz\u00e1lez","orcid":null},"institutions":[{"id":"https://openalex.org/I69737025","display_name":"University of Chile","ror":"https://ror.org/047gc3g35","country_code":"CL","type":"education","lineage":["https://openalex.org/I69737025"]}],"countries":["CL"],"is_corresponding":false,"raw_author_name":"Jaime Gonz\u00e1lez","raw_affiliation_strings":["Departamento de Matema\u0301ticas Universidad de Chile, Santiago, Chile","Departamento de Matematicas, Universidad de Chile, Santiago, Chile"],"affiliations":[{"raw_affiliation_string":"Departamento de Matema\u0301ticas Universidad de Chile, Santiago, Chile","institution_ids":["https://openalex.org/I69737025"]},{"raw_affiliation_string":"Departamento de Matematicas, Universidad de Chile, Santiago, Chile","institution_ids":["https://openalex.org/I69737025"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5004756987"],"corresponding_institution_ids":["https://openalex.org/I69737025"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":2.2258,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.87993039,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"10","issue":"3","first_page":"197","last_page":"209"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9969000220298767,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12546","display_name":"Smart Parking Systems Research","score":0.9939000010490417,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.7246667146682739},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6270017623901367},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5779639482498169},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.576037585735321},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5404636859893799},{"id":"https://openalex.org/keywords/assignment-problem","display_name":"Assignment problem","score":0.5394436120986938},{"id":"https://openalex.org/keywords/traffic-flow","display_name":"Traffic flow (computer networking)","score":0.41700413823127747},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3133171796798706},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.08815640211105347}],"concepts":[{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.7246667146682739},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6270017623901367},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5779639482498169},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.576037585735321},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5404636859893799},{"id":"https://openalex.org/C85044808","wikidata":"https://www.wikidata.org/wiki/Q620614","display_name":"Assignment problem","level":2,"score":0.5394436120986938},{"id":"https://openalex.org/C207512268","wikidata":"https://www.wikidata.org/wiki/Q3074551","display_name":"Traffic flow (computer networking)","level":2,"score":0.41700413823127747},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3133171796798706},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.08815640211105347},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230100303","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230100303","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1906178366","https://openalex.org/W1968206787","https://openalex.org/W1980584881","https://openalex.org/W1993305973","https://openalex.org/W2003912133","https://openalex.org/W2006122291","https://openalex.org/W2012044979","https://openalex.org/W2041809674","https://openalex.org/W2092941378","https://openalex.org/W2118407251","https://openalex.org/W2149342630","https://openalex.org/W2156920109","https://openalex.org/W2207506470","https://openalex.org/W4234612342","https://openalex.org/W6651965038"],"related_works":["https://openalex.org/W1971174658","https://openalex.org/W2099195351","https://openalex.org/W4256429076","https://openalex.org/W2012063272","https://openalex.org/W2348092930","https://openalex.org/W2062850566","https://openalex.org/W4308716484","https://openalex.org/W2098284475","https://openalex.org/W2587900963","https://openalex.org/W4385901209"],"abstract_inverted_index":{"Abstract":[0],"An":[1],"optimization":[2,42],"algorithm":[3],"for":[4,16],"the":[5,17,32,63,100],"traffic":[6,102],"assignment":[7],"problem":[8],"is":[9,12],"presented.":[10],"It":[11],"based":[13,90],"on":[14,56,91],"determining,":[15],"flow":[18],"corresponding":[19],"to":[20,51,67],"each":[21],"origin":[22],"at":[23],"a":[24,26,40],"time,":[25],"set":[27],"of":[28],"disjoint":[29],"circuits":[30],"with":[31],"most":[33,61],"negative":[34],"total":[35],"marginal":[36],"cost,":[37],"followed":[38],"by":[39],"unidimensional":[41],"along":[43],"these":[44],"circuits.":[45],"The":[46],"proposed":[47,64],"method":[48,65],"was":[49,83],"compared":[50],"other":[52],"well":[53],"known":[54],"approaches":[55],"randomly":[57],"generated":[58],"networks.":[59],"In":[60,79],"cases":[62],"proved":[66],"be":[68],"highly":[69],"efficient,":[70],"particularly":[71],"when":[72,86],"appropriate":[73],"tighter":[74],"stopping":[75,87],"rules":[76,88],"were":[77,89],"used.":[78],"this":[80],"sense,":[81],"it":[82],"seen":[84],"that":[85],"insufficiently":[92],"tight":[93],"tolerances,":[94],"substantial":[95],"errors":[96],"could":[97],"appear":[98],"in":[99],"equilibrium":[101],"assignment.":[103]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}