{"id":"https://openalex.org/W2054737302","doi":"https://doi.org/10.1109/itsc.2011.6082871","title":"Variable time discretization for a time-dependent shortest path algorithm","display_name":"Variable time discretization for a time-dependent shortest path algorithm","publication_year":2011,"publication_date":"2011-10-01","ids":{"openalex":"https://openalex.org/W2054737302","doi":"https://doi.org/10.1109/itsc.2011.6082871","mag":"2054737302"},"language":"en","primary_location":{"id":"doi:10.1109/itsc.2011.6082871","doi":"https://doi.org/10.1109/itsc.2011.6082871","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itsc.2011.6082871","pdf_url":null,"source":{"id":"https://openalex.org/S4363607737","display_name":"IEEE International Conference on Intelligent Transportation Systems (ITSC)","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":"conference"},"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"},"volume":null,"type":"conference-paper","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/A5000881841","display_name":"Ye Tian","orcid":"https://orcid.org/0000-0002-2225-7566","observed_orcids":["https://orcid.org/0000-0002-2225-7566"]},"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"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ye Tian","raw_affiliation_strings":["University of Arizona, Tucson, AZ, USA","University of Arizona, Tucson, AZ 85721. USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Arizona, Tucson, AZ, USA","institution_ids":["https://openalex.org/I138006243"]},{"raw_affiliation_string":"University of Arizona, Tucson, AZ 85721. USA","institution_ids":["https://openalex.org/I138006243"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103750432","display_name":"Yi\u2010Chang Chiu","orcid":null,"observed_orcids":[]},"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"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yi-Chang Chiu","raw_affiliation_strings":["University of Arizona, Tucson, AZ, USA","University of Arizona, Tucson, AZ 85721. USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Arizona, Tucson, AZ, USA","institution_ids":["https://openalex.org/I138006243"]},{"raw_affiliation_string":"University of Arizona, Tucson, AZ 85721. USA","institution_ids":["https://openalex.org/I138006243"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038207720","display_name":"Yang Gao","orcid":"https://orcid.org/0000-0002-2150-5986","observed_orcids":["https://orcid.org/0000-0002-2150-5986"]},"institutions":[{"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":"Yang Gao","raw_affiliation_strings":["Cornell University, Ithaca, NY, USA","Cornell University, Ithaca, NY, USA, 14853"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Cornell University, Ithaca, NY, USA","institution_ids":["https://openalex.org/I205783295"]},{"raw_affiliation_string":"Cornell University, Ithaca, NY, USA, 14853","institution_ids":["https://openalex.org/I205783295"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6114,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.79168975,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"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.9643999934196472,"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.9643999934196472,"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.007899999618530273,"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.007300000172108412,"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/time-dependent-shortest-path","display_name":"time-dependent shortest path","score":0.8669999837875366},{"id":"https://openalex.org/keywords/time-dependent-travel-times","display_name":"time-dependent travel times","score":0.8679999709129333},{"id":"https://openalex.org/keywords/memory-allocation","display_name":"memory allocation","score":0.7910000085830688},{"id":"https://openalex.org/keywords/index-of-dispersion","display_name":"dispersion index","score":0.8569999933242798},{"id":"https://openalex.org/keywords/travel-time-variance","display_name":"travel time variance","score":0.9020000100135803}],"concepts":[{"id":"https://openalex.org/C73000952","wikidata":"https://www.wikidata.org/wiki/Q17007827","display_name":"Discretization","level":2,"score":0.9001375436782837},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.6760735511779785},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6013306379318237},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5622187256813049},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5612150430679321},{"id":"https://openalex.org/C196083921","wikidata":"https://www.wikidata.org/wiki/Q7915758","display_name":"Variance (accounting)","level":2,"score":0.47940441966056824},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4290943145751953},{"id":"https://openalex.org/C2985733770","wikidata":"https://www.wikidata.org/wiki/Q1233007","display_name":"Travel time","level":2,"score":0.4272286891937256},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.38019269704818726},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36629951000213623},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.23536095023155212},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.08513125777244568},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C121955636","wikidata":"https://www.wikidata.org/wiki/Q4116214","display_name":"Accounting","level":1,"score":0.0},{"id":"https://openalex.org/C22212356","wikidata":"https://www.wikidata.org/wiki/Q775325","display_name":"Transport engineering","level":1,"score":0.0},{"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/C144133560","wikidata":"https://www.wikidata.org/wiki/Q4830453","display_name":"Business","level":0,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/itsc.2011.6082871","doi":"https://doi.org/10.1109/itsc.2011.6082871","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itsc.2011.6082871","pdf_url":null,"source":{"id":"https://openalex.org/S4363607737","display_name":"IEEE International Conference on Intelligent Transportation Systems (ITSC)","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":"conference"},"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":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W204348808","https://openalex.org/W1969483458","https://openalex.org/W1985327268","https://openalex.org/W1986652726","https://openalex.org/W2041942953","https://openalex.org/W2085152474","https://openalex.org/W2114251562","https://openalex.org/W2123988414","https://openalex.org/W2144050074","https://openalex.org/W2169528473","https://openalex.org/W2227557434","https://openalex.org/W2319958627","https://openalex.org/W2623293810"],"related_works":["https://openalex.org/W2052312410","https://openalex.org/W4200413328","https://openalex.org/W63403264","https://openalex.org/W2390543351","https://openalex.org/W2389864641","https://openalex.org/W571152315","https://openalex.org/W2368571405","https://openalex.org/W2032575331","https://openalex.org/W2807088699","https://openalex.org/W1482461946"],"abstract_inverted_index":{"This":[0],"paper":[1],"introduces":[2],"a":[3,9,33,60,75,79,86,110,114],"variable":[4,133],"time":[5,88,134,145],"discretization":[6,89,135],"strategy":[7,15,43,100,136],"for":[8,24,65],"time-dependent":[10,25,105],"A\u2217shortest":[11],"path":[12],"algorithm.":[13],"The":[14,41,68,98,119],"is":[16,44,101],"aimed":[17],"at":[18],"determining":[19],"the":[20,47,51,55,104,124,131],"optimal":[21],"memory":[22,39,129],"allocation":[23],"travel":[26,52,71,96],"times":[27,72],"data":[28],"in":[29,95,103],"order":[30],"to":[31,84,92],"achieve":[32],"desirable":[34],"compromise":[35],"between":[36],"accuracy":[37,140],"and":[38,78,107],"usage.":[40],"proposed":[42,99,132],"based":[45],"on":[46,113],"dispersion":[48],"index":[49],"of":[50,127,143],"times/costs":[53],"over":[54],"entire":[56],"analysis":[57],"period,":[58],"as":[59],"result,":[61],"producing":[62],"different":[63],"intervals":[64],"each":[66],"link.":[67],"links":[69],"with":[70,109,123],"that":[73,122,142],"have":[74,85],"higher":[76,139],"variance":[77],"lower":[80],"mean":[81],"will":[82],"need":[83],"shorter":[87],"length":[90],"due":[91],"greater":[93],"fluctuation":[94],"times.":[97],"implemented":[102],"A\u2217algorithm":[106],"tested":[108],"numerical":[111],"experiment":[112],"Tucson,":[115],"AZ,":[116],"traffic":[117],"network.":[118],"results":[120],"show":[121],"same":[125],"amount":[126],"computer":[128],"usage,":[130],"achieves":[137],"much":[138],"than":[141],"uniform":[144],"discretization.":[146]},"counts_by_year":[{"year":2023,"cited_by_count":3},{"year":2013,"cited_by_count":1}],"updated_date":"2026-10-05T09:50:58.205359","created_date":"2016-06-24T00:00:00"}