{"id":"https://openalex.org/W2136444822","doi":"https://doi.org/10.1287/trsc.1040.0112","title":"Updating Paths in Time-Varying Networks Given Arc Weight Changes","display_name":"Updating Paths in Time-Varying Networks Given Arc Weight Changes","publication_year":2005,"publication_date":"2005-11-01","ids":{"openalex":"https://openalex.org/W2136444822","doi":"https://doi.org/10.1287/trsc.1040.0112","mag":"2136444822"},"language":"en","primary_location":{"id":"doi:10.1287/trsc.1040.0112","doi":"https://doi.org/10.1287/trsc.1040.0112","is_oa":false,"landing_page_url":"https://doi.org/10.1287/trsc.1040.0112","pdf_url":null,"source":{"id":"https://openalex.org/S130252234","display_name":"Transportation Science","issn_l":"0041-1655","issn":["0041-1655","1526-5447"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["abdc-a-star","anvur-class-a","anvur-scientific","cwts-core","dongbi-a","jufo-2","norway-2","poland-200","russia-white-list-1","vabb-shw"],"host_organization":"https://openalex.org/P4310315699","host_organization_name":"Institute for Operations Research and the Management Sciences","host_organization_lineage":["https://openalex.org/P4310315699"],"host_organization_lineage_names":["Institute for Operations Research and the Management Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Transportation Science","raw_type":"journal-article"},"volume":null,"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/A5041629278","display_name":"Elise D. Miller-Hooks","orcid":"https://orcid.org/0000-0002-6849-2916","observed_orcids":["https://orcid.org/0000-0002-6849-2916"]},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Elise Miller-Hooks","raw_affiliation_strings":["Department of Civil and Environmental Engineering, 1173 Glenn Martin Hall, University of Maryland, College Park, Maryland 20742"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Civil and Environmental Engineering, 1173 Glenn Martin Hall, University of Maryland, College Park, Maryland 20742","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":null,"display_name":"Baiyu Yang","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I1334696734","display_name":"American Airlines (United States)","ror":"https://ror.org/05jh79p16","country_code":"US","type":"company","lineage":["https://openalex.org/I1334696734"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Baiyu Yang","raw_affiliation_strings":["Operations Research and Decision Support, American Airlines, 4333 Amon Carter Boulevard, MD 5358, Fort Worth, Texas 76155","Operations Research and Decision Support, American Airlines, 4333 Amon Carter Boulevard, MD 5358, Fort Worth, Texas 76155#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Operations Research and Decision Support, American Airlines, 4333 Amon Carter Boulevard, MD 5358, Fort Worth, Texas 76155","institution_ids":["https://openalex.org/I1334696734"]},{"raw_affiliation_string":"Operations Research and Decision Support, American Airlines, 4333 Amon Carter Boulevard, MD 5358, Fort Worth, Texas 76155#TAB#","institution_ids":["https://openalex.org/I1334696734"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.4549,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.94126803,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"39","issue":"4","first_page":"451","last_page":"464"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.5996000170707703,"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.5996000170707703,"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.364300012588501,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.020600000396370888,"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/shortest-path","display_name":"shortest path","score":0.8199999928474426},{"id":"https://openalex.org/keywords/dynamic-networks","display_name":"dynamic networks","score":0.9300000071525574},{"id":"https://openalex.org/keywords/reoptimization","display_name":"reoptimization","score":0.8180000185966492},{"id":"https://openalex.org/keywords/dynamic-shortest-path","display_name":"dynamic shortest path","score":0.5649999976158142},{"id":"https://openalex.org/keywords/travel-time","display_name":"travel time","score":0.4970000088214874},{"id":"https://openalex.org/keywords/intelligent-transportation-systems","display_name":"intelligent transportation systems","score":0.7960000038146973},{"id":"https://openalex.org/keywords/real-time-routing","display_name":"real-time routing","score":0.652999997138977},{"id":"https://openalex.org/keywords/stochastic-networks","display_name":"stochastic networks","score":0.6579999923706055},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"shortest path tree","score":0.6100000143051147}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6577498912811279},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6011541485786438},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5969192385673523},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5948247909545898},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5832557678222656},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.579340934753418},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5633540153503418},{"id":"https://openalex.org/C2778536092","wikidata":"https://www.wikidata.org/wiki/Q4785038","display_name":"Arc routing","level":3,"score":0.5629457831382751},{"id":"https://openalex.org/C2985733770","wikidata":"https://www.wikidata.org/wiki/Q1233007","display_name":"Travel time","level":2,"score":0.4966128468513489},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.4740467071533203},{"id":"https://openalex.org/C83415579","wikidata":"https://www.wikidata.org/wiki/Q161973","display_name":"Arc (geometry)","level":2,"score":0.4407179355621338},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2847977876663208},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21092340350151062},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.13675454258918762},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.12241989374160767},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.11735224723815918},{"id":"https://openalex.org/C22212356","wikidata":"https://www.wikidata.org/wiki/Q775325","display_name":"Transport engineering","level":1,"score":0.10839909315109253},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.10726392269134521},{"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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1287/trsc.1040.0112","doi":"https://doi.org/10.1287/trsc.1040.0112","is_oa":false,"landing_page_url":"https://doi.org/10.1287/trsc.1040.0112","pdf_url":null,"source":{"id":"https://openalex.org/S130252234","display_name":"Transportation Science","issn_l":"0041-1655","issn":["0041-1655","1526-5447"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["abdc-a-star","anvur-class-a","anvur-scientific","cwts-core","dongbi-a","jufo-2","norway-2","poland-200","russia-white-list-1","vabb-shw"],"host_organization":"https://openalex.org/P4310315699","host_organization_name":"Institute for Operations Research and the Management Sciences","host_organization_lineage":["https://openalex.org/P4310315699"],"host_organization_lineage_names":["Institute for Operations Research and the Management Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Transportation Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.6773999929428101}],"study_designs":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W204348808","https://openalex.org/W570927969","https://openalex.org/W1524281075","https://openalex.org/W1528656006","https://openalex.org/W1563096767","https://openalex.org/W1583205259","https://openalex.org/W1603765807","https://openalex.org/W1964416868","https://openalex.org/W1986652726","https://openalex.org/W1990043277","https://openalex.org/W1996548298","https://openalex.org/W2000783039","https://openalex.org/W2005395736","https://openalex.org/W2013731263","https://openalex.org/W2015648019","https://openalex.org/W2029706450","https://openalex.org/W2033471184","https://openalex.org/W2038363912","https://openalex.org/W2048815087","https://openalex.org/W2059547694","https://openalex.org/W2062266989","https://openalex.org/W2079274727","https://openalex.org/W2087989168","https://openalex.org/W2089338760","https://openalex.org/W2089853005","https://openalex.org/W2097458838","https://openalex.org/W2114251562","https://openalex.org/W2115847261","https://openalex.org/W2119312244","https://openalex.org/W2166236009","https://openalex.org/W2227557434","https://openalex.org/W2338905098","https://openalex.org/W2402297148","https://openalex.org/W2406576746","https://openalex.org/W2734968239"],"related_works":["https://openalex.org/W2390543351","https://openalex.org/W4399992187","https://openalex.org/W2048815087","https://openalex.org/W2272817479","https://openalex.org/W2139290948","https://openalex.org/W7098860372","https://openalex.org/W2290962274","https://openalex.org/W2087489341","https://openalex.org/W1969261977","https://openalex.org/W2794328882"],"abstract_inverted_index":{"Many":[0],"transportation":[1,7],"applications,":[2],"including":[3],"applications":[4],"in":[5,19,60,81,104,124,129,142,152,178,180,194],"intelligent":[6],"systems,":[8],"require":[9],"the":[10,22,31,39,68,78,83,88,113,143],"solution":[11,80,86,95],"of":[12,15,28,30,70,183],"a":[13,26,71],"series":[14],"shortest":[16,126],"path":[17,46,127],"problems":[18],"which":[20],"only":[21],"travel":[23,150],"time":[24,62,106],"along":[25],"set":[27],"arcs":[29],"network":[32,184],"change":[33],"from":[34,77,112],"one":[35],"problem":[36,51],"instance":[37,52],"to":[38,48,102],"next.":[40],"One":[41],"could":[42],"use":[43,69,123,193],"an":[44],"existing":[45],"algorithm":[47,73],"solve":[49],"each":[50],"independently":[53],"as":[54,107],"it":[55,135],"arises.":[56],"However,":[57],"significant":[58],"savings":[59],"computation":[61],"can":[63,166,189],"often":[64],"be":[65,190],"achieved":[66],"through":[67],"reoptimization":[72,120,139],"that":[74,137],"would":[75],"begin":[76],"prior":[79],"determining":[82],"updated":[84,168],"optimal":[85],"for":[87,98,122,145,192],"given":[89,170],"arc":[90],"travel-time":[91,108],"changes.":[92],"Such":[93],"quick":[94],"is":[96,110],"critical":[97],"providing":[99],"routing":[100],"instructions":[101],"travelers":[103],"real":[105],"information":[109],"retrieved":[111],"traffic":[114],"network.":[115],"Numerous":[116],"works":[117],"have":[118],"presented":[119],"techniques":[121,165],"updating":[125,146],"trees":[128],"deterministic":[130],"and":[131,172,176],"static":[132],"networks;":[133],"however,":[134],"appears":[136],"no":[138],"technique":[140,188],"exists":[141],"literature":[144],"paths":[147],"where":[148],"future":[149],"times":[151],"time-varying":[153],"networks":[154],"change.":[155],"In":[156],"this":[157,187],"paper,":[158],"such":[159],"procedures":[160],"are":[161],"proposed.":[162],"The":[163],"proposed":[164],"provide":[167],"solutions":[169],"simultaneous":[171],"arbitrary":[173],"changes":[174],"(increasing":[175],"decreasing":[177],"value)":[179],"any":[181],"number":[182],"arcs.":[185],"Further,":[186],"extended":[191],"stochastic":[195],"networks.":[196]},"counts_by_year":[{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-09-27T08:07:27.782135","created_date":"2016-06-24T00:00:00"}