{"id":"https://openalex.org/W2085152474","doi":"https://doi.org/10.1109/itsc.2011.6083070","title":"Hierarchical time-dependent shortest path algorithm for dynamic traffic assignment systems","display_name":"Hierarchical time-dependent shortest path algorithm for dynamic traffic assignment systems","publication_year":2011,"publication_date":"2011-10-01","ids":{"openalex":"https://openalex.org/W2085152474","doi":"https://doi.org/10.1109/itsc.2011.6083070","mag":"2085152474"},"language":"en","primary_location":{"id":"doi:10.1109/itsc.2011.6083070","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itsc.2011.6083070","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 14th International IEEE Conference on Intelligent Transportation Systems (ITSC)","raw_type":"proceedings-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/A5038207720","display_name":"Yang Gao","orcid":"https://orcid.org/0000-0002-2150-5986"},"institutions":[{"id":"https://openalex.org/I138006243","display_name":"University of Arizona","ror":"https://ror.org/03m2x1q45","country_code":"US","type":"education","lineage":["https://openalex.org/I138006243"]},{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Yang Gao","raw_affiliation_strings":["Cornell University, Ithaca, NY, USA","University of Arizona, Tucson, AZ 85721. USA"],"affiliations":[{"raw_affiliation_string":"Cornell University, Ithaca, NY, USA","institution_ids":["https://openalex.org/I205783295"]},{"raw_affiliation_string":"University of Arizona, Tucson, AZ 85721. USA","institution_ids":["https://openalex.org/I138006243"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103750432","display_name":"Yi\u2010Chang Chiu","orcid":null},"institutions":[{"id":"https://openalex.org/I138006243","display_name":"University of Arizona","ror":"https://ror.org/03m2x1q45","country_code":"US","type":"education","lineage":["https://openalex.org/I138006243"]},{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yi-Chang Chiu","raw_affiliation_strings":["University of Arizona, Tucson, AZ, USA","Cornell University Ithaca NY 14850 USA"],"affiliations":[{"raw_affiliation_string":"University of Arizona, Tucson, AZ, USA","institution_ids":["https://openalex.org/I138006243"]},{"raw_affiliation_string":"Cornell University Ithaca NY 14850 USA","institution_ids":["https://openalex.org/I205783295"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5038207720"],"corresponding_institution_ids":["https://openalex.org/I138006243","https://openalex.org/I205783295"],"apc_list":null,"apc_paid":null,"fwci":2.76784909,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.91623968,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"728","last_page":"733"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11344","display_name":"Traffic Prediction and Management Techniques","score":0.9980000257492065,"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/computer-science","display_name":"Computer science","score":0.7549301385879517},{"id":"https://openalex.org/keywords/flexibility","display_name":"Flexibility (engineering)","score":0.7278062105178833},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6714779138565063},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5251619219779968},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5159733891487122},{"id":"https://openalex.org/keywords/travel-time","display_name":"Travel time","score":0.4427134394645691},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.4172626733779907},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.409807026386261},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.35386723279953003},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3200826048851013},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.28868600726127625},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13345468044281006},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.12799283862113953}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7549301385879517},{"id":"https://openalex.org/C2780598303","wikidata":"https://www.wikidata.org/wiki/Q65921492","display_name":"Flexibility (engineering)","level":2,"score":0.7278062105178833},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6714779138565063},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5251619219779968},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5159733891487122},{"id":"https://openalex.org/C2985733770","wikidata":"https://www.wikidata.org/wiki/Q1233007","display_name":"Travel time","level":2,"score":0.4427134394645691},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.4172626733779907},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.409807026386261},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35386723279953003},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3200826048851013},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.28868600726127625},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13345468044281006},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.12799283862113953},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C22212356","wikidata":"https://www.wikidata.org/wiki/Q775325","display_name":"Transport engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/itsc.2011.6083070","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itsc.2011.6083070","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 14th International IEEE Conference on Intelligent Transportation Systems (ITSC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.7799999713897705}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1503349161","https://openalex.org/W1514550500","https://openalex.org/W1985327268","https://openalex.org/W2079274727","https://openalex.org/W2123988414","https://openalex.org/W2166236009","https://openalex.org/W3137299218"],"related_works":["https://openalex.org/W2198982833","https://openalex.org/W2767202586","https://openalex.org/W4293054712","https://openalex.org/W2375775343","https://openalex.org/W2388654557","https://openalex.org/W2360981904","https://openalex.org/W2365712669","https://openalex.org/W2161960576","https://openalex.org/W1990043277","https://openalex.org/W2349797546"],"abstract_inverted_index":{"This":[0],"paper":[1],"proposes":[2],"a":[3,110],"Hierarchical":[4],"Time-Dependent":[5],"Shortest":[6],"Path":[7],"(HTDSP)":[8],"algorithm":[9,62],"system":[10,87],"that":[11,59],"applies":[12],"the":[13,60,84],"hierarchical":[14],"search":[15],"strategy":[16],"in":[17,100,109],"dynamic":[18,93],"traffic":[19,94],"networks":[20],"with":[21],"discrete":[22],"and":[23,42,74,81,96,104],"deterministic":[24],"travel":[25],"costs.":[26],"Four":[27],"types":[28],"of":[29,52,83],"TDSP":[30,77],"query":[31],"experiments,":[32],"namely,":[33],"quasi-normal":[34],"one-to-one":[35,38],"queries,":[36,39,44],"random":[37],"one-to-all":[40],"queries":[41],"all-to-one":[43],"were":[45],"conducted":[46],"on":[47],"an":[48],"urban":[49],"street":[50],"network":[51],"Tucson,":[53],"Arizona.":[54],"The":[55,79],"numerical":[56],"results":[57],"suggest":[58],"proposed":[61,85],"provides":[63],"near":[64],"optimal":[65],"solutions":[66],"at":[67],"low":[68],"computational":[69],"cost":[70],"for":[71,91],"both":[72],"single":[73],"multiple":[75],"sources":[76],"queries.":[78],"flexibility":[80],"efficiency":[82],"HTDSP":[86],"implies":[88],"its":[89],"suitability":[90],"large-scale":[92],"assignment":[95],"online":[97],"routing":[98],"applications":[99],"which":[101],"origin":[102],"destination":[103],"departure":[105],"time":[106],"are":[107],"required":[108],"highly":[111],"disaggregate":[112],"manner.":[113]},"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}