{"id":"https://openalex.org/W2344975577","doi":"https://doi.org/10.1109/tits.2016.2543262","title":"The Shortest Path Problem on a Time-Dependent Network With Mixed Uncertainty of Randomness and Fuzziness","display_name":"The Shortest Path Problem on a Time-Dependent Network With Mixed Uncertainty of Randomness and Fuzziness","publication_year":2016,"publication_date":"2016-04-29","ids":{"openalex":"https://openalex.org/W2344975577","doi":"https://doi.org/10.1109/tits.2016.2543262","mag":"2344975577"},"language":"en","primary_location":{"id":"doi:10.1109/tits.2016.2543262","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tits.2016.2543262","pdf_url":null,"source":{"id":"https://openalex.org/S144771191","display_name":"IEEE Transactions on Intelligent Transportation Systems","issn_l":"1524-9050","issn":["1524-9050","1558-0016"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Intelligent Transportation Systems","raw_type":"journal-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/A5101748860","display_name":"Wei Huang","orcid":"https://orcid.org/0009-0007-9885-0028"},"institutions":[{"id":"https://openalex.org/I136765683","display_name":"Tianjin University of Technology","ror":"https://ror.org/00zbe0w13","country_code":"CN","type":"education","lineage":["https://openalex.org/I136765683"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Wei Huang","raw_affiliation_strings":["School of Computer and Communication Engineering, Tianjin University of Technology, Tianjin, China"],"affiliations":[{"raw_affiliation_string":"School of Computer and Communication Engineering, Tianjin University of Technology, Tianjin, China","institution_ids":["https://openalex.org/I136765683"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100639872","display_name":"Jinsong Wang","orcid":"https://orcid.org/0000-0002-6484-7142"},"institutions":[{"id":"https://openalex.org/I136765683","display_name":"Tianjin University of Technology","ror":"https://ror.org/00zbe0w13","country_code":"CN","type":"education","lineage":["https://openalex.org/I136765683"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jinsong Wang","raw_affiliation_strings":["School of Computer and Communication Engineering, Tianjin University of Technology, Tianjin, China"],"affiliations":[{"raw_affiliation_string":"School of Computer and Communication Engineering, Tianjin University of Technology, Tianjin, China","institution_ids":["https://openalex.org/I136765683"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5101748860"],"corresponding_institution_ids":["https://openalex.org/I136765683"],"apc_list":null,"apc_paid":null,"fwci":3.9496,"has_fulltext":false,"cited_by_count":25,"citation_normalized_percentile":{"value":0.93618591,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"17","issue":"11","first_page":"3194","last_page":"3204"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10050","display_name":"Multi-Criteria Decision Making","score":0.9922999739646912,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10050","display_name":"Multi-Criteria Decision Making","score":0.9922999739646912,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9918000102043152,"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/T10539","display_name":"Sustainable Supply Chain Management","score":0.9781000018119812,"subfield":{"id":"https://openalex.org/subfields/1408","display_name":"Strategy and Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/randomness","display_name":"Randomness","score":0.9109510183334351},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6695066690444946},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5973397493362427},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.5922799706459045},{"id":"https://openalex.org/keywords/fuzzy-logic","display_name":"Fuzzy logic","score":0.5574547648429871},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.521007776260376},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4633761942386627},{"id":"https://openalex.org/keywords/average-path-length","display_name":"Average path length","score":0.4607155919075012},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.44858503341674805},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.4282534718513489},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3996228575706482},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.19342410564422607},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.18129464983940125},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.09572169184684753},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.08290314674377441}],"concepts":[{"id":"https://openalex.org/C125112378","wikidata":"https://www.wikidata.org/wiki/Q176640","display_name":"Randomness","level":2,"score":0.9109510183334351},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6695066690444946},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5973397493362427},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.5922799706459045},{"id":"https://openalex.org/C58166","wikidata":"https://www.wikidata.org/wiki/Q224821","display_name":"Fuzzy logic","level":2,"score":0.5574547648429871},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.521007776260376},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4633761942386627},{"id":"https://openalex.org/C91886571","wikidata":"https://www.wikidata.org/wiki/Q432520","display_name":"Average path length","level":4,"score":0.4607155919075012},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44858503341674805},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.4282534718513489},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3996228575706482},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.19342410564422607},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.18129464983940125},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.09572169184684753},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.08290314674377441},{"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/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tits.2016.2543262","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tits.2016.2543262","pdf_url":null,"source":{"id":"https://openalex.org/S144771191","display_name":"IEEE Transactions on Intelligent Transportation Systems","issn_l":"1524-9050","issn":["1524-9050","1558-0016"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Intelligent Transportation Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4510300295","display_name":null,"funder_award_id":"61301140","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G7515138294","display_name":null,"funder_award_id":"61272450","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"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W6222927","https://openalex.org/W1966441918","https://openalex.org/W1979163195","https://openalex.org/W1986652726","https://openalex.org/W1990362808","https://openalex.org/W1992129517","https://openalex.org/W1994635176","https://openalex.org/W2016337964","https://openalex.org/W2018887123","https://openalex.org/W2019950953","https://openalex.org/W2036868106","https://openalex.org/W2044962958","https://openalex.org/W2050560064","https://openalex.org/W2052455426","https://openalex.org/W2062205222","https://openalex.org/W2065342991","https://openalex.org/W2095809978","https://openalex.org/W2108698488","https://openalex.org/W2111022489","https://openalex.org/W2119199785","https://openalex.org/W2125668987","https://openalex.org/W2128530362","https://openalex.org/W2133737493","https://openalex.org/W2142183404","https://openalex.org/W2142352947","https://openalex.org/W2148880811","https://openalex.org/W2160777156","https://openalex.org/W2161674430","https://openalex.org/W2345006952","https://openalex.org/W2465232242","https://openalex.org/W2912189486","https://openalex.org/W3023540311","https://openalex.org/W4230588984","https://openalex.org/W4234521054","https://openalex.org/W4301173492","https://openalex.org/W6600277277","https://openalex.org/W6677898620"],"related_works":["https://openalex.org/W2384880954","https://openalex.org/W1970871823","https://openalex.org/W2391412785","https://openalex.org/W4312420408","https://openalex.org/W2124997593","https://openalex.org/W2388813193","https://openalex.org/W2329866592","https://openalex.org/W2123631178","https://openalex.org/W2136866103","https://openalex.org/W1551300451"],"abstract_inverted_index":{"The":[0,77,120],"uncertainty":[1,24,56],"of":[2,25,48,57,84,117,127,152,193],"travel":[3,27,46],"times":[4,28,47],"on":[5,29,166],"a":[6,38,49,85,89,96,132],"time-dependent":[7,31,41,50],"network":[8,42,51],"is":[9,67,88,108,123,140,159,186],"conventionally":[10],"considered":[11],"as":[12,54],"randomness":[13,18,58],"or":[14,19],"fuzziness.":[15,60],"However,":[16],"sometimes,":[17],"fuzziness":[20],"cannot":[21],"describe":[22,149],"the":[23,26,30,64,74,82,113,118,144,150,155,163,167,170,191,194],"network.":[32,97,168],"In":[33],"this":[34,100],"paper,":[35],"we":[36,102],"introduce":[37],"random":[39,128,145],"fuzzy":[40,129,138,146],"(RFTDN),":[43],"in":[44],"which":[45,87],"are":[52,175],"represented":[53],"mixed":[55],"and":[59,91,131],"With":[61],"these":[62],"conditions,":[63],"resulting":[65],"RFTDN":[66],"far":[68],"more":[69],"complex":[70],"when":[71,94],"compared":[72],"with":[73,112],"known":[75],"networks.":[76],"complexity":[78],"stems":[79],"from":[80],"estimating":[81],"length":[83,151],"path,":[86],"basic":[90],"core":[92],"issue":[93],"analyzing":[95,180],"To":[98],"address":[99],"problem,":[101],"propose":[103],"an":[104],"optimized":[105],"method":[106,122],"that":[107,148],"suitable":[109],"to":[110,142,189],"cope":[111],"shortest":[114,164],"path":[115,165],"problem":[116],"RFTDN.":[119],"proposed":[121,171,195],"realized":[124],"by":[125,179],"means":[126],"simulation":[130,139],"new":[133],"repair-based":[134,156,172],"genetic":[135,157,173],"optimization.":[136],"Random":[137],"used":[141],"estimate":[143],"functions":[147],"arcs,":[153],"whereas":[154],"algorithm":[158],"presented":[160],"for":[161],"finding":[162],"Furthermore,":[169],"operators":[174],"demonstrated":[176],"their":[177],"effectiveness":[178],"running":[181],"time.":[182],"A":[183],"numerical":[184],"example":[185],"also":[187],"provided":[188],"show":[190],"robustness":[192],"approach.":[196]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}