{"id":"https://openalex.org/W2116465486","doi":"https://doi.org/10.1109/cso.2010.138","title":"Travel Time Reliability-Based Optimal Path Finding","display_name":"Travel Time Reliability-Based Optimal Path Finding","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W2116465486","doi":"https://doi.org/10.1109/cso.2010.138","mag":"2116465486"},"language":"en","primary_location":{"id":"doi:10.1109/cso.2010.138","doi":"https://doi.org/10.1109/cso.2010.138","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cso.2010.138","pdf_url":null,"source":{"id":"https://openalex.org/S7407088120","display_name":"International Joint Conference on Computational Sciences and Optimization (CSO)","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":"2010 Third International Joint Conference on Computational Science and Optimization","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/A5029337544","display_name":"Shuopeng Wang","orcid":"https://orcid.org/0000-0003-0780-7037","observed_orcids":["https://orcid.org/0000-0003-0780-7037","https://orcid.org/0000-0001-7591-6847"]},"institutions":[{"id":"https://openalex.org/I25757504","display_name":"China University of Mining and Technology","ror":"https://ror.org/01xt2dr21","country_code":"CN","type":"education","lineage":["https://openalex.org/I25757504"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Shuopeng Wang","raw_affiliation_strings":["Department of Mathematics, China University of Mining and Technology, Xuzhou, China","Dept. of Math., China Univ. of Min. & Technol., Xuzhou, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, China University of Mining and Technology, Xuzhou, China","institution_ids":["https://openalex.org/I25757504"]},{"raw_affiliation_string":"Dept. of Math., China Univ. of Min. & Technol., Xuzhou, China","institution_ids":["https://openalex.org/I25757504"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100784389","display_name":"Hu Shao","orcid":"https://orcid.org/0000-0001-7816-0707","observed_orcids":["https://orcid.org/0000-0001-7816-0707"]},"institutions":[{"id":"https://openalex.org/I25757504","display_name":"China University of Mining and Technology","ror":"https://ror.org/01xt2dr21","country_code":"CN","type":"education","lineage":["https://openalex.org/I25757504"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Hu Shao","raw_affiliation_strings":["Department of Mathematics, China University of Mining and Technology, Xuzhou, China","Dept. of Math., China Univ. of Min. & Technol., Xuzhou, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, China University of Mining and Technology, Xuzhou, China","institution_ids":["https://openalex.org/I25757504"]},{"raw_affiliation_string":"Dept. of Math., China Univ. of Min. & Technol., Xuzhou, China","institution_ids":["https://openalex.org/I25757504"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Li Tao","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I25757504","display_name":"China University of Mining and Technology","ror":"https://ror.org/01xt2dr21","country_code":"CN","type":"education","lineage":["https://openalex.org/I25757504"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Li Tao","raw_affiliation_strings":["Department of Physics, China University of Mining and Technology, Xuzhou, China","Dept. of Phys., China Univ. of Min. & Technol., Xuzhou, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Physics, China University of Mining and Technology, Xuzhou, China","institution_ids":["https://openalex.org/I25757504"]},{"raw_affiliation_string":"Dept. of Phys., China Univ. of Min. & Technol., Xuzhou, China","institution_ids":["https://openalex.org/I25757504"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041070362","display_name":"Qinjian Ni","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I25757504","display_name":"China University of Mining and Technology","ror":"https://ror.org/01xt2dr21","country_code":"CN","type":"education","lineage":["https://openalex.org/I25757504"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Qinjian Ni","raw_affiliation_strings":["Department of Physics, China University of Mining and Technology, Xuzhou, China","Dept. of Phys., China Univ. of Min. & Technol., Xuzhou, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Physics, China University of Mining and Technology, Xuzhou, China","institution_ids":["https://openalex.org/I25757504"]},{"raw_affiliation_string":"Dept. of Phys., China Univ. of Min. & Technol., Xuzhou, China","institution_ids":["https://openalex.org/I25757504"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I25757504"],"apc_list":null,"apc_paid":null,"fwci":0.7065,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.82940109,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"531","last_page":"534"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9911999702453613,"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.9911999702453613,"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.001500000013038516,"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/T11489","display_name":"Air Traffic Management and Optimization","score":0.0006000000284984708,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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/travel-time-reliability","display_name":"travel time reliability","score":0.996999979019165},{"id":"https://openalex.org/keywords/optimal-path-finding","display_name":"optimal path finding","score":0.9440000057220459},{"id":"https://openalex.org/keywords/k-shortest-paths","display_name":"k-shortest paths","score":0.7120000123977661},{"id":"https://openalex.org/keywords/network-uncertainty","display_name":"network uncertainty","score":0.7329999804496765},{"id":"https://openalex.org/keywords/stochastic-travel-times","display_name":"stochastic travel times","score":0.7480000257492065},{"id":"https://openalex.org/keywords/risk-taking","display_name":"risk-taking","score":0.9409999847412109},{"id":"https://openalex.org/keywords/heuristic-algorithms","display_name":"heuristic algorithms","score":0.699999988079071}],"concepts":[{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.8008756637573242},{"id":"https://openalex.org/C32638748","wikidata":"https://www.wikidata.org/wiki/Q5437051","display_name":"Fast path","level":4,"score":0.7444546222686768},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.652525782585144},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.6092694401741028},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.6021243929862976},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6001286506652832},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.584419846534729},{"id":"https://openalex.org/C43214815","wikidata":"https://www.wikidata.org/wiki/Q7310987","display_name":"Reliability (semiconductor)","level":3,"score":0.5630216002464294},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5555689930915833},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.5294924378395081},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5141015648841858},{"id":"https://openalex.org/C2985733770","wikidata":"https://www.wikidata.org/wiki/Q1233007","display_name":"Travel time","level":2,"score":0.44057902693748474},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.4348936676979065},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.372060626745224},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29504820704460144},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.27214205265045166},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.24822315573692322},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.14822852611541748},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.11203873157501221},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.1009553074836731},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09197172522544861},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.08386960625648499},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.06916823983192444},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"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/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cso.2010.138","doi":"https://doi.org/10.1109/cso.2010.138","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cso.2010.138","pdf_url":null,"source":{"id":"https://openalex.org/S7407088120","display_name":"International Joint Conference on Computational Sciences and Optimization (CSO)","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":"2010 Third International Joint Conference on Computational Science and Optimization","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5378999710083008,"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure"}],"sustainable_development_goals_aurora":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1986564315","https://openalex.org/W2016049811","https://openalex.org/W2034204928","https://openalex.org/W2039114216","https://openalex.org/W2057742448","https://openalex.org/W2062568266","https://openalex.org/W2066145367","https://openalex.org/W2089845007","https://openalex.org/W2091253199","https://openalex.org/W2094192904","https://openalex.org/W2114251562","https://openalex.org/W2131058166","https://openalex.org/W3119350768"],"related_works":["https://openalex.org/W1971136991","https://openalex.org/W2528578218","https://openalex.org/W2765786618","https://openalex.org/W1974399255","https://openalex.org/W2057983864","https://openalex.org/W580019420","https://openalex.org/W657216361","https://openalex.org/W3107972891","https://openalex.org/W2467558505","https://openalex.org/W2341264174"],"abstract_inverted_index":{"A":[0,162],"heuristic":[1],"solution":[2],"algorithm":[3,127],"for":[4],"travel":[5,21,41,63,71,91,101],"time":[6,42,64,72],"reliability-based":[7],"path":[8,35,52,78,87,105,117,133,138,153,160],"finding":[9,120],"problem":[10],"is":[11,65,83,106,128,140,165],"proposed":[12,176],"in":[13,51,80,142,158],"this":[14,31,57,81],"paper.":[15],"Due":[16,93],"to":[17,67,84,94,108,130,145,168],"network":[18,47],"uncertainties,":[19],"the":[20,46,59,76,86,95,99,103,113,121,124,147,151,170,175],"times":[22],"are":[23],"not":[24,44],"deterministic":[25],"and":[26,172],"suffer":[27],"from":[28],"fluctuations.":[29],"Under":[30],"circumstance,":[32],"traditional":[33],"optimal":[34,77,104,122,148,152],"methods":[36],"based":[37],"on":[38],"least":[39],"expected":[40],"can":[43,154],"capture":[45],"user's":[48],"risk-taking":[49],"behaviors":[50],"finding.":[53],"In":[54],"reorganization":[55],"of":[56,61,98,174],"limitation,":[58],"definition":[60],"effective":[62,90,100],"introduced":[66],"take":[68],"into":[69],"account":[70],"reliability":[73],"issue.":[74],"Then,":[75,150],"defined":[79],"paper":[82],"find":[85,109],"with":[88],"minimum":[89],"time.":[92],"non-additive":[96],"property":[97],"time,":[102],"difficult":[107],"unless":[110],"enumerate":[111],"all":[112],"paths.":[114],"To":[115],"avoid":[116],"enumeration":[118],"while":[119],"path,":[123],"k-shortest":[125],"paths":[126],"adopted":[129],"generate":[131],"a":[132],"set":[134,139],"by":[135],"iterations.":[136],"This":[137],"generated":[141],"an":[143],"attempt":[144],"include":[146],"path.":[149],"be":[155],"easily":[156],"found":[157],"such":[159],"set.":[161],"numerical":[163],"example":[164],"carried":[166],"out":[167],"show":[169],"applications":[171],"efficiency":[173],"algorithm.":[177]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-10-27T15:51:10.671819","created_date":"2016-06-24T00:00:00"}