{"id":"https://openalex.org/W4366957285","doi":"https://doi.org/10.1109/mits.2023.3265309","title":"DRL Router: Distributional Reinforcement Learning-Based Router for Reliable Shortest Path Problems","display_name":"DRL Router: Distributional Reinforcement Learning-Based Router for Reliable Shortest Path Problems","publication_year":2023,"publication_date":"2023-04-24","ids":{"openalex":"https://openalex.org/W4366957285","doi":"https://doi.org/10.1109/mits.2023.3265309"},"language":"en","primary_location":{"id":"doi:10.1109/mits.2023.3265309","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mits.2023.3265309","pdf_url":null,"source":{"id":"https://openalex.org/S131000621","display_name":"IEEE Intelligent Transportation Systems Magazine","issn_l":"1939-1390","issn":["1939-1390","1941-1197"],"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 Intelligent Transportation Systems Magazine","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/A5033106028","display_name":"Hongliang Guo","orcid":"https://orcid.org/0000-0002-9836-3090"},"institutions":[{"id":"https://openalex.org/I24185976","display_name":"Sichuan University","ror":"https://ror.org/011ashp19","country_code":"CN","type":"education","lineage":["https://openalex.org/I24185976"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Hongliang Guo","raw_affiliation_strings":["College of Computer Science, Sichuan University (SCU), Chengdu, Sichuan, China"],"raw_orcid":"https://orcid.org/0000-0002-9836-3090","affiliations":[{"raw_affiliation_string":"College of Computer Science, Sichuan University (SCU), Chengdu, Sichuan, China","institution_ids":["https://openalex.org/I24185976"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053832436","display_name":"Wenda Sheng","orcid":"https://orcid.org/0000-0003-0132-3656"},"institutions":[{"id":"https://openalex.org/I150229711","display_name":"University of Electronic Science and Technology of China","ror":"https://ror.org/04qr3zq92","country_code":"CN","type":"education","lineage":["https://openalex.org/I150229711"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Wenda Sheng","raw_affiliation_strings":["University of Electronic Science and Technology of China, Chengdu, China"],"raw_orcid":"https://orcid.org/0000-0003-0132-3656","affiliations":[{"raw_affiliation_string":"University of Electronic Science and Technology of China, Chengdu, China","institution_ids":["https://openalex.org/I150229711"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039976419","display_name":"Chen Gao","orcid":"https://orcid.org/0000-0003-3541-6340"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Chen Gao","raw_affiliation_strings":["ETH Zurich, Zurich, Switzerland"],"raw_orcid":"https://orcid.org/0000-0003-3541-6340","affiliations":[{"raw_affiliation_string":"ETH Zurich, Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032314861","display_name":"Yaochu Jin","orcid":"https://orcid.org/0000-0003-1100-0631"},"institutions":[{"id":"https://openalex.org/I20121455","display_name":"Bielefeld University","ror":"https://ror.org/02hpadn98","country_code":"DE","type":"education","lineage":["https://openalex.org/I20121455"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Yaochu Jin","raw_affiliation_strings":["Bielefeld University, Bielefeld, Germany"],"raw_orcid":"https://orcid.org/0000-0003-1100-0631","affiliations":[{"raw_affiliation_string":"Bielefeld University, Bielefeld, Germany","institution_ids":["https://openalex.org/I20121455"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.9825,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.89889306,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":98},"biblio":{"volume":"15","issue":"5","first_page":"91","last_page":"108"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9998999834060669,"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.9998999834060669,"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.9994999766349792,"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/T11942","display_name":"Transportation and Mobility Innovations","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive 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/router","display_name":"Router","score":0.8011794686317444},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5550824403762817},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4978458881378174},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.46457040309906006},{"id":"https://openalex.org/keywords/reinforcement-learning","display_name":"Reinforcement learning","score":0.44655174016952515},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4226074814796448},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3992813229560852},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2677980661392212},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.25262904167175293},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.20222660899162292},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1521751582622528}],"concepts":[{"id":"https://openalex.org/C2775896111","wikidata":"https://www.wikidata.org/wiki/Q642560","display_name":"Router","level":2,"score":0.8011794686317444},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5550824403762817},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4978458881378174},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.46457040309906006},{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.44655174016952515},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4226074814796448},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3992813229560852},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2677980661392212},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.25262904167175293},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.20222660899162292},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1521751582622528},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/mits.2023.3265309","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mits.2023.3265309","pdf_url":null,"source":{"id":"https://openalex.org/S131000621","display_name":"IEEE Intelligent Transportation Systems Magazine","issn_l":"1939-1390","issn":["1939-1390","1941-1197"],"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 Intelligent Transportation Systems Magazine","raw_type":"journal-article"},{"id":"pmh:oai:pub.uni-bielefeld.de:2978681","is_oa":false,"landing_page_url":"https://doi.org/10.1109/MITS.2023.3265309","pdf_url":null,"source":{"id":"https://openalex.org/S4306401670","display_name":"PUB \u2013 Publications at Bielefeld University (Bielefeld University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I20121455","host_organization_name":"Bielefeld University","host_organization_lineage":["https://openalex.org/I20121455"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"http://purl.org/coar/resource_type/c_6501"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":76,"referenced_works":["https://openalex.org/W32403112","https://openalex.org/W169511987","https://openalex.org/W653434785","https://openalex.org/W1563143451","https://openalex.org/W1577646917","https://openalex.org/W1974399255","https://openalex.org/W1980505254","https://openalex.org/W1998369658","https://openalex.org/W2007204663","https://openalex.org/W2007659532","https://openalex.org/W2010760359","https://openalex.org/W2013734727","https://openalex.org/W2033564834","https://openalex.org/W2041942953","https://openalex.org/W2046236705","https://openalex.org/W2049345634","https://openalex.org/W2058135791","https://openalex.org/W2062568266","https://openalex.org/W2070361724","https://openalex.org/W2074675836","https://openalex.org/W2088336910","https://openalex.org/W2091253199","https://openalex.org/W2125916239","https://openalex.org/W2157033237","https://openalex.org/W2168482679","https://openalex.org/W2341264174","https://openalex.org/W2345006952","https://openalex.org/W2398179450","https://openalex.org/W2431210409","https://openalex.org/W2463540115","https://openalex.org/W2472493131","https://openalex.org/W2518921919","https://openalex.org/W2558902970","https://openalex.org/W2602684069","https://openalex.org/W2615600520","https://openalex.org/W2765302304","https://openalex.org/W2765786618","https://openalex.org/W2783301916","https://openalex.org/W2803308811","https://openalex.org/W2803638397","https://openalex.org/W2885153510","https://openalex.org/W2899259594","https://openalex.org/W2908598977","https://openalex.org/W2964025765","https://openalex.org/W2983617607","https://openalex.org/W2989821594","https://openalex.org/W2998868424","https://openalex.org/W2999148895","https://openalex.org/W2999214372","https://openalex.org/W3000394811","https://openalex.org/W3011437664","https://openalex.org/W3021656475","https://openalex.org/W3023210489","https://openalex.org/W3028400296","https://openalex.org/W3035407702","https://openalex.org/W3130227853","https://openalex.org/W3135462388","https://openalex.org/W3155727026","https://openalex.org/W3182805615","https://openalex.org/W3186006943","https://openalex.org/W3197032375","https://openalex.org/W3197060594","https://openalex.org/W4214717370","https://openalex.org/W4250589301","https://openalex.org/W4283213431","https://openalex.org/W4285818834","https://openalex.org/W4285819854","https://openalex.org/W4298876402","https://openalex.org/W4300852027","https://openalex.org/W6606987745","https://openalex.org/W6621644052","https://openalex.org/W6683300800","https://openalex.org/W6726740133","https://openalex.org/W6751629939","https://openalex.org/W6767112054","https://openalex.org/W6777365664"],"related_works":["https://openalex.org/W2122026593","https://openalex.org/W1588358165","https://openalex.org/W4237683758","https://openalex.org/W2582203024","https://openalex.org/W2370711413","https://openalex.org/W2375932043","https://openalex.org/W2052038519","https://openalex.org/W1980506749","https://openalex.org/W2841075164","https://openalex.org/W2375594474"],"abstract_inverted_index":{"This":[0],"article":[1,90],"studies":[2],"reliable":[3],"shortest":[4],"path":[5],"(RSP)":[6],"problems":[7],"in":[8,17,200],"stochastic":[9,27],"transportation":[10,202],"networks.":[11],"The":[12],"term":[13],"<italic":[14],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[15],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">reliability</i>":[16],"the":[18,52,87,107,114,119,136,206],"RSP":[19,60,68,83,110,138,158],"literature":[20],"has":[21],"many":[22],"definitions,":[23],"e.g.,":[24],"1)":[25,148],"maximal":[26],"on-time":[28],"arrival":[29],"probability,":[30],"2)":[31,160],"minimal":[32,40,48],"travel":[33,121,171],"time":[34,122,172],"with":[35,133,179,197],"a":[36,92,103,125,141,155],"high-confidence":[37],"constraint,":[38],"3)":[39,175],"mean":[41],"and":[42,46,70,129,183,195,208],"standard":[43],"deviation":[44],"combination,":[45],"4)":[47,184],"expected":[49],"disutility.":[50],"To":[51,85],"best":[53],"of":[54,124,157,210],"our":[55],"knowledge,":[56],"almost":[57],"all":[58],"state-of-the-art":[59],"solutions":[61],"are":[62],"designed":[63],"to":[64,78,81,106,117,135,154],"target":[65],"one":[66],"specific":[67],"objective,":[69],"it":[71,151,164,176,187],"is":[72,147,152,177],"very":[73],"difficult,":[74],"if":[75],"not":[76,166],"impossible,":[77],"adapt":[79],"them":[80],"other":[82],"objectives.":[84],"bridge":[86],"gap,":[88],"this":[89],"develops":[91],"distributional":[93],"reinforcement":[94],"learning":[95],"(DRL)-based":[96],"algorithm,":[97],"namely,":[98],"DRL-Router,":[99],"which":[100],"serves":[101],"as":[102],"universal":[104],"solution":[105],"four":[108],"aforementioned":[109],"problems.":[111],"DRL-Router":[112,146],"employs":[113],"DRL":[115],"method":[116],"approximate":[118],"full":[120],"distribution":[123,173],"given":[126],"routing":[127],"policy":[128,143],"then":[130],"makes":[131],"improvements":[132],"respect":[134],"user-defined":[137],"objective":[139,181],"through":[140],"generalized":[142],"iteration":[144],"scheme.":[145],"universal,":[149],"i.e.,":[150,163,186],"applicable":[153],"variety":[156],"objectives;":[159],"model":[161],"free,":[162],"does":[165],"rely":[167],"on":[168],"well":[169],"calibrated":[170],"models;":[174],"adaptive":[178],"navigation":[180],"changes;":[182],"fast,":[185],"performs":[188],"real-time":[189],"decision":[190],"making.":[191],"Extensive":[192],"experimental":[193],"results":[194],"comparisons":[196],"baseline":[198],"algorithms":[199],"various":[201],"networks":[203],"justify":[204],"both":[205],"accuracy":[207],"efficiency":[209],"DRL-Router.":[211]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}