{"id":"https://openalex.org/W149688373","doi":null,"title":"AN EFFICIENT APPROACH TO SOLVING THE ROAD NETWORK EQUILIBRIUM TRAFFIC ASSIGNMENT PROBLEM. IN: THE AUTOMOBILE","display_name":"AN EFFICIENT APPROACH TO SOLVING THE ROAD NETWORK EQUILIBRIUM TRAFFIC ASSIGNMENT PROBLEM. IN: THE AUTOMOBILE","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W149688373","mag":"149688373"},"language":"en","primary_location":{"id":"mag:149688373","doi":null,"is_oa":false,"landing_page_url":"https://trid.trb.org/view/682335","pdf_url":null,"source":{"id":"https://openalex.org/S2764695430","display_name":"Classics in Transport Analysis","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Classics in Transport Analysis","raw_type":null},"volume":null,"type":"article","indexed_in":[],"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/A5027904822","display_name":"Larry J. LeBlanc","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Larry J. LeBlanc","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5044609178","display_name":"E K Morlok","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"E K Morlok","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5031063967","display_name":"William P. Pierskalla","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"William P. Pierskalla","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.152,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.86360681,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"7","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9639000296592712,"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.9639000296592712,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.008899999782443047,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T12709","display_name":"Optimization and Mathematical Programming","score":0.005799999926239252,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"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/traffic-assignment","display_name":"traffic assignment","score":0.8740000128746033},{"id":"https://openalex.org/keywords/shortest-path","display_name":"shortest path","score":0.9240000247955322},{"id":"https://openalex.org/keywords/multi-commodity-flow","display_name":"multicommodity flow","score":0.5249999761581421},{"id":"https://openalex.org/keywords/computational-efficiency","display_name":"computational efficiency","score":0.5759999752044678},{"id":"https://openalex.org/keywords/approximate-solutions","display_name":"approximate solutions","score":0.4519999921321869}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7016631960868835},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.6693046689033508},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6166188716888428},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.6093142032623291},{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.5904061198234558},{"id":"https://openalex.org/C2988166257","wikidata":"https://www.wikidata.org/wiki/Q924286","display_name":"Traffic network","level":2,"score":0.5043641328811646},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.4754616618156433},{"id":"https://openalex.org/C207512268","wikidata":"https://www.wikidata.org/wiki/Q3074551","display_name":"Traffic flow (computer networking)","level":2,"score":0.42153021693229675},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3010595440864563},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24382176995277405},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:149688373","doi":null,"is_oa":false,"landing_page_url":"https://trid.trb.org/view/682335","pdf_url":null,"source":{"id":"https://openalex.org/S2764695430","display_name":"Classics in Transport Analysis","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Classics in Transport Analysis","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","score":0.651199996471405,"id":"https://metadata.un.org/sdg/9"}],"sustainable_development_goals_aurora":[{"display_name":"Sustainable cities and communities","score":0.47999998927116394,"id":"https://metadata.un.org/sdg/11"}],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2003912133","https://openalex.org/W2250029315","https://openalex.org/W3043239617","https://openalex.org/W2060772802","https://openalex.org/W2070189380","https://openalex.org/W7096635093","https://openalex.org/W4377224665","https://openalex.org/W2430154609","https://openalex.org/W2051622992","https://openalex.org/W313242074"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"a":[3,12,56,107],"solution":[4,10,36,121],"technique":[5],"that":[6,44,99],"requires":[7],"only":[8],"the":[9,23,38,47,63,74,80,83,100,120],"of":[11,14,52,76,82,85,102],"sequence":[13],"shortest":[15,103],"route":[16,104],"problems,":[17],"such":[18],"as":[19,79],"computing":[20,30],"time":[21,31],"for":[22,32,70,106,127],"one":[24],"dimensional":[25],"searches":[26],"being":[27],"insignificant.":[28],"The":[29],"finding":[33],"an":[34],"approximate":[35],"to":[37],"equilibrium":[39,109,130],"problem":[40,110],"was":[41],"less":[42],"than":[43],"required":[45],"by":[46,50],"simplex":[48],"method":[49],"orders":[51],"magnitude":[53],"even":[54,67],"on":[55],"fairly":[57],"small":[58],"network.":[59],"For":[60],"larger":[61],"problems":[62,73],"savings":[64],"would":[65],"be":[66,117],"greater,":[68],"since":[69],"multi-commodity":[71],"network":[72,108,129],"number":[75,101],"constraints":[77,89],"grows":[78],"square":[81],"conservation":[84],"flow":[86],"and":[87],"non-negativity":[88],"used":[90],"explicitly":[91],"in":[92],"this":[93],"technique.":[94],"Preliminary":[95],"computational":[96],"results":[97],"indicate":[98],"subproblems":[105],"with":[111],"several":[112],"hundred":[113],"nodes":[114],"will":[115],"not":[116],"excessive;":[118],"thus":[119],"approach":[122],"presented":[123],"appears":[124],"very":[125],"promising":[126],"large":[128],"problems.":[131]},"counts_by_year":[{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-10-10T17:16:08.811792","created_date":"2016-06-24T00:00:00"}