{"id":"https://openalex.org/W614121883","doi":null,"title":"A DISTRIBUTED ALGORITHM FOR THE DYNAMIC TRAFFIC EQUILIBRIUM ASSIGNMENT PROBLEM","display_name":"A DISTRIBUTED ALGORITHM FOR THE DYNAMIC TRAFFIC EQUILIBRIUM ASSIGNMENT PROBLEM","publication_year":1996,"publication_date":"1996-01-01","ids":{"openalex":"https://openalex.org/W614121883","mag":"614121883"},"language":"en","primary_location":{"id":"mag:614121883","doi":null,"is_oa":false,"landing_page_url":"https://trid.trb.org/view/481272","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"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/A5086491677","display_name":"M B Wistem","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"M B Wistem","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5111490169","display_name":"Mike Smith","orcid":"https://orcid.org/0000-0002-4199-3315","observed_orcids":["https://orcid.org/0000-0002-4199-3315"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mike Smith","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-4199-3315","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":8.0889,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.95689655,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"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.8065999746322632,"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.8065999746322632,"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/T10524","display_name":"Traffic control and management","score":0.1574999988079071,"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"}},{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.0024999999441206455,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/dynamic-traffic-assignment","display_name":"dynamic traffic assignment","score":0.9940000176429749},{"id":"https://openalex.org/keywords/traffic-equilibrium","display_name":"traffic equilibrium","score":0.9200000166893005},{"id":"https://openalex.org/keywords/distributed-algorithms","display_name":"distributed algorithms","score":0.8140000104904175},{"id":"https://openalex.org/keywords/message-routing","display_name":"message routing","score":0.6679999828338623},{"id":"https://openalex.org/keywords/network-flow","display_name":"network flow","score":0.33799999952316284}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6263527274131775},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.555152177810669},{"id":"https://openalex.org/C85044808","wikidata":"https://www.wikidata.org/wiki/Q620614","display_name":"Assignment problem","level":2,"score":0.5161760449409485},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5161405801773071},{"id":"https://openalex.org/C72434380","wikidata":"https://www.wikidata.org/wiki/Q230930","display_name":"State space","level":2,"score":0.5141356587409973},{"id":"https://openalex.org/C99580578","wikidata":"https://www.wikidata.org/wiki/Q5319002","display_name":"Dynamic problem","level":2,"score":0.46844983100891113},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.448140412569046},{"id":"https://openalex.org/C2988166257","wikidata":"https://www.wikidata.org/wiki/Q924286","display_name":"Traffic network","level":2,"score":0.4457893967628479},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2159634232521057},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:614121883","doi":null,"is_oa":false,"landing_page_url":"https://trid.trb.org/view/481272","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4943999946117401,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2023981657","https://openalex.org/W610488929","https://openalex.org/W2756634329","https://openalex.org/W7095451447","https://openalex.org/W2054982047","https://openalex.org/W7052820562","https://openalex.org/W2141563056","https://openalex.org/W2103095561","https://openalex.org/W1547232111","https://openalex.org/W2337933353"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"the":[3,12,55,70,76,83],"dynamic":[4,56],"traffic":[5,38,57],"assignment":[6,58],"problem":[7,59],"has":[8],"been":[9,30],"formulated":[10],"in":[11,19,26],"space":[13],"of":[14,72,78],"splitting":[15,63],"rates.":[16],"The":[17,45],"ideas":[18],"Gallager's":[20],"method":[21],"for":[22,36],"steady-state":[23],"message":[24],"routeing":[25],"computer":[27],"networks":[28],"have":[29],"combined":[31],"with":[32],"Smith'a":[33],"Algorithm":[34],"(D)":[35],"computing":[37],"equilibria":[39],"and":[40],"then":[41],"extended":[42],"to":[43,53,69],"dynamic-state.":[44],"result":[46],"is":[47],"a":[48],"distributed":[49],"algorithm":[50],"that":[51,79],"seeks":[52],"solve":[54],"by":[60],"iteratively":[61],"adjusting":[62],"rates":[64],"at":[65],"each":[66],"junction":[67],"according":[68],"costs":[71],"reaching":[73],"destinations":[74],"from":[75],"exits":[77],"junction.":[80],"(A)":[81],"For":[82],"covering":[84],"abstract":[85],"see":[86],"IRRD":[87],"886400.":[88]},"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2026-10-16T09:59:22.235173","created_date":"2016-06-24T00:00:00"}