{"id":"https://openalex.org/W2032394864","doi":"https://doi.org/10.1080/0305215x.2015.1005081","title":"A priorileast expected time paths in fuzzy, time-variant transportation networks","display_name":"A priorileast expected time paths in fuzzy, time-variant transportation networks","publication_year":2015,"publication_date":"2015-02-05","ids":{"openalex":"https://openalex.org/W2032394864","doi":"https://doi.org/10.1080/0305215x.2015.1005081","mag":"2032394864"},"language":"en","primary_location":{"id":"doi:10.1080/0305215x.2015.1005081","doi":"https://doi.org/10.1080/0305215x.2015.1005081","is_oa":false,"landing_page_url":"https://doi.org/10.1080/0305215x.2015.1005081","pdf_url":null,"source":{"id":"https://openalex.org/S139857051","display_name":"Engineering Optimization","issn_l":"0305-215X","issn":["0305-215X","1026-745X","1029-0273"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","dongbi-b","jufo-1","norway-1","poland-70","russia-white-list-1","vabb-shw"],"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547","https://openalex.org/P4310320449"],"host_organization_lineage_names":["Taylor & Francis","Informa"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Engineering Optimization","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/A5100335949","display_name":"Li Wang","orcid":"https://orcid.org/0000-0002-1090-9248","observed_orcids":["https://orcid.org/0000-0002-1090-9248","https://orcid.org/0000-0001-5292-3737"]},"institutions":[{"id":"https://openalex.org/I21193070","display_name":"Beijing Jiaotong University","ror":"https://ror.org/01yj56c84","country_code":"CN","type":"education","lineage":["https://openalex.org/I21193070"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Li Wang","raw_affiliation_strings":["State Key Laboratory of Rail Traffic Control and Safety, Beijing Jiaotong University, Beijing, 100044, PR China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"State Key Laboratory of Rail Traffic Control and Safety, Beijing Jiaotong University, Beijing, 100044, PR China","institution_ids":["https://openalex.org/I21193070"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049135480","display_name":"Ziyou Gao","orcid":"https://orcid.org/0000-0002-6519-4681","observed_orcids":["https://orcid.org/0000-0002-6519-4681"]},"institutions":[{"id":"https://openalex.org/I21193070","display_name":"Beijing Jiaotong University","ror":"https://ror.org/01yj56c84","country_code":"CN","type":"education","lineage":["https://openalex.org/I21193070"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ziyou Gao","raw_affiliation_strings":["State Key Laboratory of Rail Traffic Control and Safety, Beijing Jiaotong University, Beijing, 100044, PR China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"State Key Laboratory of Rail Traffic Control and Safety, Beijing Jiaotong University, Beijing, 100044, PR China","institution_ids":["https://openalex.org/I21193070"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5040786132","display_name":"Lixing Yang","orcid":"https://orcid.org/0000-0003-1628-5015","observed_orcids":["https://orcid.org/0000-0003-1628-5015"]},"institutions":[{"id":"https://openalex.org/I21193070","display_name":"Beijing Jiaotong University","ror":"https://ror.org/01yj56c84","country_code":"CN","type":"education","lineage":["https://openalex.org/I21193070"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Lixing Yang","raw_affiliation_strings":["State Key Laboratory of Rail Traffic Control and Safety, Beijing Jiaotong University, Beijing, 100044, PR China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"State Key Laboratory of Rail Traffic Control and Safety, Beijing Jiaotong University, Beijing, 100044, PR China","institution_ids":["https://openalex.org/I21193070"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5040786132"],"corresponding_institution_ids":["https://openalex.org/I21193070"],"apc_list":null,"apc_paid":null,"fwci":6.3204,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.95396029,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"48","issue":"2","first_page":"272","last_page":"298"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9580000042915344,"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.9580000042915344,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.010499999858438969,"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"}},{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.007000000216066837,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/dynamic-transportation-networks","display_name":"dynamic transportation networks","score":0.7170000076293945},{"id":"https://openalex.org/keywords/route-guidance","display_name":"route guidance","score":0.7670000195503235},{"id":"https://openalex.org/keywords/tabu-search","display_name":"tabu search","score":0.949999988079071},{"id":"https://openalex.org/keywords/linear-weighted-method","display_name":"linear weighted method","score":0.6790000200271606},{"id":"https://openalex.org/keywords/dynamic-network-routing","display_name":"dynamic network routing","score":0.3269999921321869}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.703967809677124},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5823479294776917},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.576971709728241},{"id":"https://openalex.org/C58166","wikidata":"https://www.wikidata.org/wiki/Q224821","display_name":"Fuzzy logic","level":2,"score":0.5614639520645142},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.511625349521637},{"id":"https://openalex.org/C2985733770","wikidata":"https://www.wikidata.org/wiki/Q1233007","display_name":"Travel time","level":2,"score":0.5115614533424377},{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.4878402054309845},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.4856227934360504},{"id":"https://openalex.org/C28761237","wikidata":"https://www.wikidata.org/wiki/Q7805321","display_name":"Time horizon","level":2,"score":0.44938862323760986},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.4467938244342804},{"id":"https://openalex.org/C21214244","wikidata":"https://www.wikidata.org/wiki/Q224821","display_name":"Fuzzy transportation","level":5,"score":0.42476287484169006},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36050641536712646},{"id":"https://openalex.org/C1883856","wikidata":"https://www.wikidata.org/wiki/Q3407463","display_name":"Fuzzy number","level":4,"score":0.30761411786079407},{"id":"https://openalex.org/C42011625","wikidata":"https://www.wikidata.org/wiki/Q1055058","display_name":"Fuzzy set","level":3,"score":0.2530325651168823},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13238239288330078},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.1268642544746399},{"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","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},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/0305215x.2015.1005081","doi":"https://doi.org/10.1080/0305215x.2015.1005081","is_oa":false,"landing_page_url":"https://doi.org/10.1080/0305215x.2015.1005081","pdf_url":null,"source":{"id":"https://openalex.org/S139857051","display_name":"Engineering Optimization","issn_l":"0305-215X","issn":["0305-215X","1026-745X","1029-0273"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","dongbi-b","jufo-1","norway-1","poland-70","russia-white-list-1","vabb-shw"],"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547","https://openalex.org/P4310320449"],"host_organization_lineage_names":["Taylor & Francis","Informa"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Engineering Optimization","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5378999710083008,"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure"},{"score":0.47999998927116394,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"sustainable_development_goals_aurora":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G1765697749","display_name":null,"funder_award_id":"2012CB725400","funder_id":"https://openalex.org/F4320335777","funder_display_name":"National Key Research and Development Program of China"},{"id":"https://openalex.org/G6899486100","display_name":null,"funder_award_id":"71271020, 71422002, 71401007","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320335777","display_name":"National Key Research and Development Program of China","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":45,"referenced_works":["https://openalex.org/W6222927","https://openalex.org/W608564597","https://openalex.org/W1483431698","https://openalex.org/W1486356119","https://openalex.org/W1496156369","https://openalex.org/W1598690575","https://openalex.org/W1965593276","https://openalex.org/W1972055727","https://openalex.org/W1976699101","https://openalex.org/W1978943789","https://openalex.org/W1998611916","https://openalex.org/W2009062596","https://openalex.org/W2009781633","https://openalex.org/W2018887123","https://openalex.org/W2031297693","https://openalex.org/W2034204928","https://openalex.org/W2041942953","https://openalex.org/W2046236705","https://openalex.org/W2052338628","https://openalex.org/W2067126954","https://openalex.org/W2072425957","https://openalex.org/W2086590301","https://openalex.org/W2092499098","https://openalex.org/W2104670598","https://openalex.org/W2106407153","https://openalex.org/W2109510349","https://openalex.org/W2114251562","https://openalex.org/W2124404857","https://openalex.org/W2128530362","https://openalex.org/W2144050074","https://openalex.org/W2150198213","https://openalex.org/W2161056404","https://openalex.org/W2167685210","https://openalex.org/W2169528473","https://openalex.org/W2206190669","https://openalex.org/W2227557434","https://openalex.org/W2240264416","https://openalex.org/W2444211768","https://openalex.org/W3143971390","https://openalex.org/W4230588984","https://openalex.org/W4244424643","https://openalex.org/W4246598646","https://openalex.org/W4254329280","https://openalex.org/W4285719527","https://openalex.org/W4385738287"],"related_works":["https://openalex.org/W1992129517","https://openalex.org/W2114251562","https://openalex.org/W2344975577","https://openalex.org/W7098860372","https://openalex.org/W2502575662","https://openalex.org/W2283495068","https://openalex.org/W7096101779","https://openalex.org/W1990362808","https://openalex.org/W2040119901","https://openalex.org/W7167619586"],"abstract_inverted_index":{"Dynamics":[0],"and":[1,95,148,153],"fuzziness":[2],"are":[3,142],"two":[4,14,139],"significant":[5],"characteristics":[6],"of":[7,22,31,134,150],"real-world":[8],"transportation":[9],"networks.":[10],"To":[11,37],"capture":[12],"these":[13],"features":[15],"theoretically,":[16],"this":[17,104],"article":[18,105],"proposes":[19],"the":[20,45,58,63,77,83,89,108,124,128,132,146,151],"concept":[21],"a":[23,29,70],"fuzzy,":[24],"time-variant":[25],"network":[26],"characterized":[27],"by":[28],"series":[30],"time-dependent":[32],"fuzzy":[33,109],"link":[34],"travel":[35,47,111],"times.":[36],"find":[38],"an":[39,53,98],"effective":[40],"route":[41,59],"guidance":[42],"for":[43,75,113,123],"travelers,":[44],"expected":[46,79,110],"time":[48,80,85,112],"is":[49,67,101,121],"specifically":[50],"adopted":[51],"as":[52,69],"evaluation":[54],"criterion":[55],"to":[56,106,126,144],"assess":[57],"generation":[60],"process.":[61],"Then":[62],"shortest":[64,90],"path":[65,81,91],"problem":[66,92,125],"formulated":[68],"multi-objective":[71],"0\u20131":[72],"optimization":[73],"model":[74,152],"finding":[76],"least":[78],"over":[82],"considered":[84],"horizon.":[86],"Different":[87],"from":[88],"in":[93,103],"dynamic":[94],"random":[96],"networks,":[97],"efficient":[99],"method":[100],"proposed":[102],"calculate":[107],"each":[114],"given":[115],"path.":[116],"A":[117],"tabu":[118],"search":[119],"algorithm":[120],"designed":[122],"generate":[127],"best":[129],"solution":[130],"under":[131],"framework":[133],"linear":[135],"weighted":[136],"methods.":[137],"Finally,":[138],"numerical":[140],"experiments":[141],"performed":[143],"verify":[145],"effectiveness":[147],"efficiency":[149],"algorithm.":[154]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2}],"updated_date":"2026-10-30T12:39:25.321706","created_date":"2016-06-24T00:00:00"}