{"id":"https://openalex.org/W1989859352","doi":"https://doi.org/10.4236/jtts.2013.34027","title":"Optimal Path Finding Method Study Based on Stochastic Travel Time","display_name":"Optimal Path Finding Method Study Based on Stochastic Travel Time","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W1989859352","doi":"https://doi.org/10.4236/jtts.2013.34027","mag":"1989859352"},"language":"en","primary_location":{"id":"doi:10.4236/jtts.2013.34027","doi":"https://doi.org/10.4236/jtts.2013.34027","is_oa":true,"landing_page_url":"https://doi.org/10.4236/jtts.2013.34027","pdf_url":"http://www.scirp.org/journal/PaperDownload.aspx?paperID=37830","source":{"id":"https://openalex.org/S2764408700","display_name":"Journal of Transportation Technologies","issn_l":"2160-0473","issn":["2160-0473","2160-0481"],"is_oa":true,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310320480","host_organization_name":"Scientific Research Publishing","host_organization_lineage":["https://openalex.org/P4310320480"],"host_organization_lineage_names":["Scientific Research Publishing"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Transportation Technologies","raw_type":"journal-article"},"volume":null,"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"http://www.scirp.org/journal/PaperDownload.aspx?paperID=37830","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101718841","display_name":"Zhanquan Sun","orcid":"https://orcid.org/0000-0001-9655-3555","observed_orcids":["https://orcid.org/0000-0001-9655-3555"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhanquan Sun","raw_affiliation_strings":["Key Laboratory for Computer Network of Shandong Province, Shandong Computer Science Center, Jinan, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Key Laboratory for Computer Network of Shandong Province, Shandong Computer Science Center, Jinan, China","institution_ids":[]}]},{"author_position":"middle","author":{"id":null,"display_name":"Weidong Gu","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Weidong Gu","raw_affiliation_strings":["Key Laboratory for Computer Network of Shandong Province, Shandong Computer Science Center, Jinan, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Key Laboratory for Computer Network of Shandong Province, Shandong Computer Science Center, Jinan, China","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100527139","display_name":"Yanling Zhao","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yanling Zhao","raw_affiliation_strings":["Key Laboratory for Computer Network of Shandong Province, Shandong Computer Science Center, Jinan, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Key Laboratory for Computer Network of Shandong Province, Shandong Computer Science Center, Jinan, China","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100754261","display_name":"Chunmei Wang","orcid":"https://orcid.org/0000-0001-8576-2933","observed_orcids":["https://orcid.org/0000-0001-8576-2933"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chunmei Wang","raw_affiliation_strings":["Key Laboratory for Computer Network of Shandong Province, Shandong Computer Science Center, Jinan, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Key Laboratory for Computer Network of Shandong Province, Shandong Computer Science Center, Jinan, China","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.33033771,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"03","issue":"04","first_page":"260","last_page":"265"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9672999978065491,"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.9672999978065491,"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.008200000040233135,"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.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/optimal-path-finding","display_name":"optimal path finding","score":0.7670000195503235},{"id":"https://openalex.org/keywords/stochastic-travel-times","display_name":"stochastic travel times","score":0.9779999852180481},{"id":"https://openalex.org/keywords/shortest-path","display_name":"shortest path","score":0.824999988079071},{"id":"https://openalex.org/keywords/bayesian-estimation","display_name":"Bayesian estimation","score":0.7889999747276306},{"id":"https://openalex.org/keywords/improved-genetic-algorithm","display_name":"improved genetic algorithm","score":0.8090000152587891},{"id":"https://openalex.org/keywords/time-constrained-routing","display_name":"time-constrained routing","score":0.5059999823570251}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6843658089637756},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.6388319730758667},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6099312901496887},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5850641131401062},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5701967477798462},{"id":"https://openalex.org/C149441793","wikidata":"https://www.wikidata.org/wiki/Q200726","display_name":"Probability distribution","level":2,"score":0.5057601928710938},{"id":"https://openalex.org/C2985733770","wikidata":"https://www.wikidata.org/wiki/Q1233007","display_name":"Travel time","level":2,"score":0.5043219327926636},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.4741082787513733},{"id":"https://openalex.org/C207201462","wikidata":"https://www.wikidata.org/wiki/Q182505","display_name":"Bayes' theorem","level":3,"score":0.46766960620880127},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2681301236152649},{"id":"https://openalex.org/C107673813","wikidata":"https://www.wikidata.org/wiki/Q812534","display_name":"Bayesian probability","level":2,"score":0.1877419650554657},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.17660418152809143},{"id":"https://openalex.org/C22212356","wikidata":"https://www.wikidata.org/wiki/Q775325","display_name":"Transport engineering","level":1,"score":0.14944639801979065},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.1414215862751007},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1222047209739685},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.10838627815246582},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.4236/jtts.2013.34027","doi":"https://doi.org/10.4236/jtts.2013.34027","is_oa":true,"landing_page_url":"https://doi.org/10.4236/jtts.2013.34027","pdf_url":"http://www.scirp.org/journal/PaperDownload.aspx?paperID=37830","source":{"id":"https://openalex.org/S2764408700","display_name":"Journal of Transportation Technologies","issn_l":"2160-0473","issn":["2160-0473","2160-0481"],"is_oa":true,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310320480","host_organization_name":"Scientific Research Publishing","host_organization_lineage":["https://openalex.org/P4310320480"],"host_organization_lineage_names":["Scientific Research Publishing"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Transportation Technologies","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.4236/jtts.2013.34027","doi":"https://doi.org/10.4236/jtts.2013.34027","is_oa":true,"landing_page_url":"https://doi.org/10.4236/jtts.2013.34027","pdf_url":"http://www.scirp.org/journal/PaperDownload.aspx?paperID=37830","source":{"id":"https://openalex.org/S2764408700","display_name":"Journal of Transportation Technologies","issn_l":"2160-0473","issn":["2160-0473","2160-0481"],"is_oa":true,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310320480","host_organization_name":"Scientific Research Publishing","host_organization_lineage":["https://openalex.org/P4310320480"],"host_organization_lineage_names":["Scientific Research Publishing"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Transportation Technologies","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.7207000255584717}],"study_designs":[],"awards":[{"id":"https://openalex.org/G8865924040","display_name":null,"funder_award_id":"61004115","funder_id":"https://openalex.org/F4320309856","funder_display_name":"National Youth Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320309856","display_name":"National Youth Science Foundation","ror":"https://ror.org/054yz2f06"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1989859352.pdf","grobid_xml":"https://content.openalex.org/works/W1989859352.grobid-xml"},"referenced_works_count":17,"referenced_works":["https://openalex.org/W1517411378","https://openalex.org/W1969483458","https://openalex.org/W1976699101","https://openalex.org/W2007572995","https://openalex.org/W2042022756","https://openalex.org/W2048608180","https://openalex.org/W2114251562","https://openalex.org/W2117473144","https://openalex.org/W2137073837","https://openalex.org/W2160062684","https://openalex.org/W2166236009","https://openalex.org/W2168148394","https://openalex.org/W2169528473","https://openalex.org/W2227557434","https://openalex.org/W2278766352","https://openalex.org/W2494779131","https://openalex.org/W3011100434"],"related_works":["https://openalex.org/W2079384354","https://openalex.org/W2101365705","https://openalex.org/W2116465486","https://openalex.org/W2543705200","https://openalex.org/W2511448261","https://openalex.org/W1990362808","https://openalex.org/W2025676321","https://openalex.org/W3146291007","https://openalex.org/W2952212901","https://openalex.org/W2036868106"],"abstract_inverted_index":{"Finding":[0],"optimal":[1,139],"path":[2,18,66],"in":[3],"a":[4,46,50,68,103,150],"given":[5],"network":[6],"is":[7,44,67,77,91,106,115,134,147],"an":[8],"important":[9],"content":[10],"of":[11,58,88,102,143],"intelligent":[12],"transportation":[13],"information":[14],"service.":[15],"Static":[16],"shortest":[17,65],"has":[19,121],"been":[20,29],"studied":[21],"widely":[22],"and":[23],"many":[24],"efficient":[25],"searching":[26],"methods":[27],"have":[28],"developed,":[30],"for":[31,127],"example":[32],"Dijkstra\u2019s":[33],"algorithm,":[34],"Floyd-Warshall,":[35],"Bellman-Ford,":[36],"A*":[37],"et":[38],"al.":[39],"However,":[40],"practical":[41,151],"travel":[42,83,89],"time":[43,90,129],"not":[45],"constant":[47],"value":[48],"but":[49],"stochastic":[51,60],"value.":[52],"How":[53],"to":[54,62,79,94,109,116,125,136],"take":[55],"full":[56],"use":[57],"the":[59,64,118,122,138,144],"character":[61],"find":[63,117],"significant":[69],"problem.":[70],"In":[71],"this":[72],"paper,":[73],"GPS":[74],"floating":[75],"car":[76],"used":[78,135],"detect":[80],"road":[81],"section\u2019s":[82],"time.":[84],"The":[85,98,112,141],"probability":[86,100,110,124],"distribution":[87,101],"estimated":[92],"according":[93,108],"Bayes":[95],"estimation":[96],"method.":[97],"combined":[99],"feasible":[104],"route":[105,119],"calculated":[107],"operation.":[111],"objective":[113],"function":[114],"that":[120],"biggest":[123],"arrive":[126],"desired":[128],"thresholds.":[130],"Improved":[131],"Genetic":[132],"Algorithm":[133],"calculate":[137],"path.":[140],"efficiency":[142],"proposed":[145],"method":[146],"illustrated":[148],"with":[149],"example.":[152]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-10-30T12:39:25.321706","created_date":"2016-06-24T00:00:00"}