{"id":"https://openalex.org/W7214940373","doi":"https://doi.org/10.1155/int/6250567","title":"Risk\u2010Aware Route Optimization Using Minimum Spanning Tree Initialization and a Transferable Reinforcement Learning Policy","display_name":"Risk\u2010Aware Route Optimization Using Minimum Spanning Tree Initialization and a Transferable Reinforcement Learning Policy","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7214940373","doi":"https://doi.org/10.1155/int/6250567"},"language":"en","primary_location":{"id":"doi:10.1155/int/6250567","doi":"https://doi.org/10.1155/int/6250567","is_oa":true,"landing_page_url":"https://doi.org/10.1155/int/6250567","pdf_url":"https://onlinelibrary.wiley.com/doi/pdfdirect/10.1155/int/6250567","source":{"id":"https://openalex.org/S57950554","display_name":"International Journal of Intelligent Systems","issn_l":"0884-8173","issn":["0884-8173","1098-111X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","ccf-c","cwts-core","dongbi-c","jufo-1","norway-1","poland-100","russia-white-list-1"],"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Intelligent Systems","raw_type":"journal-article"},"volume":null,"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://onlinelibrary.wiley.com/doi/pdfdirect/10.1155/int/6250567","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5047354409","display_name":"\u0130hsan \u00d6m\u00fcr Bucak","orcid":"https://orcid.org/0000-0002-9112-3932","observed_orcids":["https://orcid.org/0000-0002-9112-3932"]},"institutions":[{"id":"https://openalex.org/I344703621","display_name":"I\u011fd\u0131r \u00dcniversitesi","ror":"https://ror.org/05jstgx72","country_code":"TR","type":"education","lineage":["https://openalex.org/I344703621"]}],"countries":["TR"],"is_corresponding":true,"raw_author_name":"\u0130hsan \u00d6m\u00fcr Bucak","raw_affiliation_strings":["Computer Engineering Department Igdir University  Igdir 76002 T\u00fcrkiye  igdir.edu.tr"],"raw_orcid":"https://orcid.org/0000-0002-9112-3932","affiliations":[{"raw_affiliation_string":"Computer Engineering Department Igdir University  Igdir 76002 T\u00fcrkiye  igdir.edu.tr","institution_ids":["https://openalex.org/I344703621"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5047354409"],"corresponding_institution_ids":["https://openalex.org/I344703621"],"apc_list":{"value":2700,"currency":"USD","value_usd":2700},"apc_paid":{"value":2700,"currency":"USD","value_usd":2700},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.71649021,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"2026","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.975600004196167,"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"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.975600004196167,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.010099999606609344,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.003700000001117587,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/traveling-salesman-problem","display_name":"traveling salesman problem","score":0.8700000047683716},{"id":"https://openalex.org/keywords/infrastructure-inspection","display_name":"infrastructure inspection","score":0.6959999799728394},{"id":"https://openalex.org/keywords/logistics-routing","display_name":"logistics routing","score":0.7179999947547913}],"concepts":[{"id":"https://openalex.org/C114466953","wikidata":"https://www.wikidata.org/wiki/Q6034165","display_name":"Initialization","level":2,"score":0.7232000231742859},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6704000234603882},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6348000168800354},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.6173999905586243},{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.5115000009536743},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4708999991416931},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.44279998540878296},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.44130000472068787},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.3903000056743622},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.38530001044273376},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.38089999556541443},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.36250001192092896},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.3377000093460083},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.33059999346733093},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.3199999928474426},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29269999265670776},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.28929999470710754},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.28380000591278076},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.2825999855995178},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.2770000100135803},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.27079999446868896},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2653000056743622},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.26409998536109924},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.2531999945640564},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2531000077724457},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.25099998712539673}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1155/int/6250567","doi":"https://doi.org/10.1155/int/6250567","is_oa":true,"landing_page_url":"https://doi.org/10.1155/int/6250567","pdf_url":"https://onlinelibrary.wiley.com/doi/pdfdirect/10.1155/int/6250567","source":{"id":"https://openalex.org/S57950554","display_name":"International Journal of Intelligent Systems","issn_l":"0884-8173","issn":["0884-8173","1098-111X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","ccf-c","cwts-core","dongbi-c","jufo-1","norway-1","poland-100","russia-white-list-1"],"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Intelligent Systems","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1155/int/6250567","doi":"https://doi.org/10.1155/int/6250567","is_oa":true,"landing_page_url":"https://doi.org/10.1155/int/6250567","pdf_url":"https://onlinelibrary.wiley.com/doi/pdfdirect/10.1155/int/6250567","source":{"id":"https://openalex.org/S57950554","display_name":"International Journal of Intelligent Systems","issn_l":"0884-8173","issn":["0884-8173","1098-111X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","ccf-c","cwts-core","dongbi-c","jufo-1","norway-1","poland-100","russia-white-list-1"],"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Intelligent Systems","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","score":0.7207000255584717,"id":"https://metadata.un.org/sdg/9"}],"study_designs":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320322626","display_name":"T\u00fcrkiye Bilimsel ve Teknolojik Ara\u015ft\u0131rma Kurumu","ror":"https://ror.org/04w9kkr77"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7214940373.pdf","grobid_xml":"https://content.openalex.org/works/W7214940373.grobid-xml"},"referenced_works_count":18,"referenced_works":["https://openalex.org/W32403112","https://openalex.org/W1601649239","https://openalex.org/W1965680834","https://openalex.org/W2017927472","https://openalex.org/W2042986967","https://openalex.org/W2399100674","https://openalex.org/W3009304813","https://openalex.org/W3047863327","https://openalex.org/W3158360589","https://openalex.org/W4299796063","https://openalex.org/W4400357656","https://openalex.org/W4406856938","https://openalex.org/W4408490733","https://openalex.org/W4410226509","https://openalex.org/W4413319032","https://openalex.org/W4415043895","https://openalex.org/W4415445264","https://openalex.org/W4416010497"],"related_works":["https://openalex.org/W2288721111","https://openalex.org/W6904026154","https://openalex.org/W7222845649","https://openalex.org/W7215076209","https://openalex.org/W7221676349","https://openalex.org/W6941464075","https://openalex.org/W2387415567","https://openalex.org/W2553199071","https://openalex.org/W7171540331","https://openalex.org/W2802374795"],"abstract_inverted_index":{"Efficient":[0],"route":[1],"planning":[2],"is":[3,104,110,129],"a":[4,23,56,67,79,91,117,122,124,184],"central":[5],"challenge":[6],"in":[7,112],"applications":[8],"such":[9,51],"as":[10],"autonomous":[11],"area":[12],"monitoring,":[13],"infrastructure":[14],"inspection,":[15],"and":[16,97,132,137,181,219],"logistics,":[17],"where":[18],"an":[19],"agent":[20,86],"must":[21],"visit":[22],"set":[24],"of":[25,116,147,204],"locations":[26],"while":[27,223],"accounting":[28],"not":[29,213,239],"only":[30],"for":[31,36,73,257],"travel":[32],"distance":[33,96],"but":[34,47],"also":[35],"spatially":[37],"varying":[38],"traversal":[39],"risk.":[40],"Classical":[41],"distance\u2010only":[42],"optimizers":[43],"minimize":[44],"path":[45],"length":[46],"are":[48],"blind":[49],"to":[50,190],"nongeometric":[52],"costs.":[53],"We":[54],"propose":[55],"hybrid":[57],"framework":[58],"that":[59,94,105,237],"integrates":[60],"minimum":[61],"spanning":[62],"tree":[63],"(MST)\u2013based":[64],"initialization":[65],"with":[66,234,241],"transferable":[68],"reinforcement\u2010learning":[69],"(RL)":[70],"refinement":[71],"policy":[72,188],"risk\u2010aware":[74],"routing.":[75],"The":[76,100],"MST":[77,171,205],"provides":[78],"structured,":[80],"low\u2010cost":[81],"initial":[82],"tour;":[83],"the":[84,106,160,170,202,254],"RL":[85,187],"then":[87],"refines":[88],"it":[89],"under":[90],"multicriteria":[92,165],"cost":[93,166,209],"combines":[95],"risk":[98],"exposure.":[99],"key":[101],"design":[102],"choice":[103],"policy\u2019s":[107],"action\u2010value":[108],"function":[109],"linear":[111],"instance\u2010independent,":[113],"size\u2010normalized":[114],"features":[115],"candidate":[118],"edge":[119],"exchange.":[120],"As":[121],"result,":[123],"single":[125],"10\u2010parameter":[126],"weight":[127],"vector":[128],"trained":[130],"once":[131],"deployed":[133],"on":[134,261],"unseen":[135,138],"instances":[136,146,152],"problem":[139,242],"sizes":[140],"without":[141],"any":[142],"per\u2010instance":[143],"retraining.":[144],"Across":[145],"15\u2013100":[148],"nodes":[149],"(30":[150],"independent":[151],"per":[153,228],"size;":[154],"12":[155],"at":[156,178,192,230],"n":[157,193,231],"=":[158,194,232],"100),":[159],"proposed":[161],"MST\u2013RL":[162],"method":[163,255],"reduces":[164],"by":[167],"16%\u201327%":[168],"over":[169],"baseline":[172],"(":[173],"p":[174,196],"<":[175,197],"10":[176,198],"\u22123":[177,199],"every":[179],"size)":[180],"decisively":[182],"outperforms":[183],"randomly":[185],"initialized":[186],"(up":[189],"44%":[191],"100,":[195,233],"),":[200],"confirming":[201],"value":[203],"initialization.":[206],"It":[207],"attains":[208],"competitive":[210],"with,":[211],"though":[212],"superior":[214],"to,":[215],"exhaustive":[216],"local":[217],"search":[218],"ant":[220],"colony":[221],"optimization":[222],"running":[224],"24\u2013126":[225],"\u00d7":[226],"faster":[227],"instance":[229],"inference":[235],"time":[236],"does":[238],"grow":[240],"size.":[243],"A":[244],"reward\u2010weight":[245],"sweep":[246],"demonstrates":[247],"controllable":[248],"distance\u2013risk":[249],"trade\u2010offs.":[250],"These":[251],"properties":[252],"make":[253],"attractive":[256],"on\u2010board,":[258],"real\u2010time":[259],"deployment":[260],"resource\u2010constrained":[262],"hardware.":[263]},"counts_by_year":[],"updated_date":"2026-10-04T09:36:47.201465","created_date":"2026-10-01T00:00:00"}