{"id":"https://openalex.org/W580726474","doi":null,"title":"CONVERGENT ALGORITHM FOR DYNAMIC TRAFFIC ASSIGNMENT","display_name":"CONVERGENT ALGORITHM FOR DYNAMIC TRAFFIC ASSIGNMENT","publication_year":1991,"publication_date":"1991-01-01","ids":{"openalex":"https://openalex.org/W580726474","mag":"580726474"},"language":"en","primary_location":{"id":"mag:580726474","doi":null,"is_oa":false,"landing_page_url":"https://trid.trb.org/view/365927","pdf_url":null,"source":{"id":"https://openalex.org/S145575934","display_name":"Transportation Research Record Journal of the Transportation Research Board","issn_l":"0361-1981","issn":["0361-1981","2169-4052"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["abdc-b","anvur-scientific","cwts-core","dongbi-b","jufo-1","norway-1","poland-40","russia-white-list-2","vabb-shw"],"host_organization":"https://openalex.org/P4310320017","host_organization_name":"SAGE Publishing","host_organization_lineage":["https://openalex.org/P4310320017"],"host_organization_lineage_names":["SAGE Publishing"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Transportation Research Record Journal of the Transportation Research Board","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/A5062173469","display_name":"Bruce N. Janson","orcid":"https://orcid.org/0000-0003-2901-8506","observed_orcids":["https://orcid.org/0000-0003-2901-8506"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Bruce N. Janson","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0003-2901-8506","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5062173469"],"corresponding_institution_ids":[],"apc_list":{"value":3650,"currency":"USD","value_usd":3650},"apc_paid":null,"fwci":23.4373,"has_fulltext":false,"cited_by_count":51,"citation_normalized_percentile":{"value":0.99074074,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":98},"biblio":{"volume":null,"issue":"1328","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.9878000020980835,"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.9878000020980835,"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.007199999876320362,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.0005000000237487257,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/dynamic-traffic-assignment","display_name":"dynamic traffic assignment","score":0.9549999833106995},{"id":"https://openalex.org/keywords/dynamic-user-equilibrium","display_name":"dynamic user equilibrium","score":0.9649999737739563},{"id":"https://openalex.org/keywords/frank-wolfe-algorithm","display_name":"Frank-Wolfe algorithm","score":0.9549999833106995},{"id":"https://openalex.org/keywords/linear-combinations","display_name":"linear combinations","score":0.6029999852180481},{"id":"https://openalex.org/keywords/origin-destination-paths","display_name":"origin-destination paths","score":0.6930000185966492},{"id":"https://openalex.org/keywords/real-time-traffic-management","display_name":"real-time traffic management","score":0.6840000152587891}],"concepts":[{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.623197078704834},{"id":"https://openalex.org/C73000952","wikidata":"https://www.wikidata.org/wiki/Q17007827","display_name":"Discretization","level":2,"score":0.6207388043403625},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.6026963591575623},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5872844457626343},{"id":"https://openalex.org/C207512268","wikidata":"https://www.wikidata.org/wiki/Q3074551","display_name":"Traffic flow (computer networking)","level":2,"score":0.583587646484375},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5477614998817444},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5473712086677551},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5061842799186707},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4602682888507843},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.4597596824169159},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.45705080032348633},{"id":"https://openalex.org/C85044808","wikidata":"https://www.wikidata.org/wiki/Q620614","display_name":"Assignment problem","level":2,"score":0.42816174030303955},{"id":"https://openalex.org/C2988166257","wikidata":"https://www.wikidata.org/wiki/Q924286","display_name":"Traffic network","level":2,"score":0.4273974299430847},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4266761541366577},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3372446894645691},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.12248927354812622},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","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},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:580726474","doi":null,"is_oa":false,"landing_page_url":"https://trid.trb.org/view/365927","pdf_url":null,"source":{"id":"https://openalex.org/S145575934","display_name":"Transportation Research Record Journal of the Transportation Research Board","issn_l":"0361-1981","issn":["0361-1981","2169-4052"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["abdc-b","anvur-scientific","cwts-core","dongbi-b","jufo-1","norway-1","poland-40","russia-white-list-2","vabb-shw"],"host_organization":"https://openalex.org/P4310320017","host_organization_name":"SAGE Publishing","host_organization_lineage":["https://openalex.org/P4310320017"],"host_organization_lineage_names":["SAGE Publishing"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Transportation Research Record Journal of the Transportation Research Board","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.6182000041007996,"id":"https://metadata.un.org/sdg/11"},{"display_name":"Industry, innovation and infrastructure","score":0.4943999946117401,"id":"https://metadata.un.org/sdg/9"}],"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/W1968740528","https://openalex.org/W2141563056","https://openalex.org/W1985444474","https://openalex.org/W2909506251","https://openalex.org/W2060167057","https://openalex.org/W2893234069","https://openalex.org/W575112944","https://openalex.org/W4409507764","https://openalex.org/W2835100664","https://openalex.org/W2043290239"],"abstract_inverted_index":{"A":[0],"link":[1,30],"flow":[2,31,48],"formulation":[3,32],"and":[4,25,177,212,224],"a":[5,52,161],"convergent":[6,95],"solution":[7,163],"algorithm":[8,97],"for":[9,18,142,219],"the":[10,45,56,100,123,178,191],"dynamic":[11,96],"user":[12,58],"equilibrium":[13,59],"(DUE)":[14],"traffic":[15,220],"assignment":[16,61,125],"problem":[17,62],"road":[19],"networks":[20,211],"with":[21,63,158,214],"multiple":[22],"trip":[23,144],"origins":[24],"destinations":[26],"are":[27,147],"presented.":[28],"The":[29,152],"does":[33,44],"not":[34],"implicitly":[35],"assume":[36],"complete":[37],"enumeration":[38],"of":[39,55,71,80,103,127,136,154,160],"all":[40],"origin-destination":[41],"paths":[42,70],"as":[43,199],"equivalent":[46],"path":[47],"formulation.":[49],"DUE":[50,111,173,192],"is":[51,130,156],"temporal":[53],"generalization":[54],"static":[57],"(SUE)":[60],"additional":[64],"constraints":[65],"to":[66,92,106,110,138,149,171,186],"ensure":[67],"temporally":[68,87],"continuous":[69],"flow.":[72],"Whereas":[73],"SUE":[74],"can":[75,85,168,203],"be":[76,150,169,204],"solved":[77],"by":[78],"methods":[79,84],"linear":[81,104],"combinations,":[82],"these":[83],"create":[86],"discontinuous":[88],"flows":[89],"if":[90],"applied":[91,170],"DUE.":[93],"This":[94],"(CDA)":[98],"uses":[99],"Frank-Wolfe":[101],"method":[102],"combinations":[105],"find":[107],"successive":[108],"solutions":[109,187],"while":[112],"holding":[113],"node":[114],"time":[115,134],"intervals":[116,135],"fixed":[117],"from":[118],"each":[119],"origin.":[120],"In":[121],"DUE,":[122],"full":[124],"period":[126],"several":[128],"hours":[129],"discretized":[131],"into":[132],"shorter":[133],"10":[137],"15":[139],"min":[140],"each,":[141],"which":[143],"departure":[145],"matrices":[146],"assumed":[148],"known.":[151],"performance":[153],"CDA":[155,167,183,202],"compared":[157],"that":[159,182,188],"heuristic":[162],"procedure":[164],"called":[165],"DTA.":[166],"solving":[172],"on":[174,209],"large":[175],"networks,":[176],"examples":[179],"presented":[180],"show":[181],"consistently":[184],"converges":[185],"closely":[189],"satisfy":[190],"optimality":[193],"conditions.":[194],"With":[195],"computational":[196],"advances":[197],"such":[198],"parallel":[200],"computing,":[201],"run":[205],"in":[206],"near":[207],"real-time":[208],"large-scale":[210],"used":[213],"in-vehicle":[215],"route":[216],"advisory":[217],"systems":[218],"management":[221],"during":[222],"evacuations":[223],"special":[225],"events.":[226]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":4}],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2016-06-24T00:00:00"}