{"id":"https://openalex.org/W4416513209","doi":"https://doi.org/10.1109/access.2025.3635886","title":"A Hybrid PPO-GNN Framework for Adaptive Vehicle Routing Under Uncertainty: Application to Fuel Delivery Logistics","display_name":"A Hybrid PPO-GNN Framework for Adaptive Vehicle Routing Under Uncertainty: Application to Fuel Delivery Logistics","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W4416513209","doi":"https://doi.org/10.1109/access.2025.3635886"},"language":"en","primary_location":{"id":"doi:10.1109/access.2025.3635886","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2025.3635886","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1109/access.2025.3635886","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5027470494","display_name":"Majdi Argoubi","orcid":"https://orcid.org/0000-0002-6560-5153"},"institutions":[{"id":"https://openalex.org/I8636806","display_name":"University of Sousse","ror":"https://ror.org/00dmpgj58","country_code":"TN","type":"education","lineage":["https://openalex.org/I8636806"]}],"countries":["TN"],"is_corresponding":true,"raw_author_name":"Majdi Argoubi","raw_affiliation_strings":["Department of Quantitative Methods, University of Sousse, Sousse, Tunisia"],"raw_orcid":"https://orcid.org/0000-0002-6560-5153","affiliations":[{"raw_affiliation_string":"Department of Quantitative Methods, University of Sousse, Sousse, Tunisia","institution_ids":["https://openalex.org/I8636806"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063854289","display_name":"Khaled Mili","orcid":"https://orcid.org/0000-0002-6309-5452"},"institutions":[{"id":"https://openalex.org/I4626487","display_name":"King Faisal University","ror":"https://ror.org/00dn43547","country_code":"SA","type":"education","lineage":["https://openalex.org/I4626487"]}],"countries":["SA"],"is_corresponding":false,"raw_author_name":"Khaled Mili","raw_affiliation_strings":["Department of Quantitative Methods, College of Business, King Faisal University, Al-Ahsa, Saudi Arabia"],"raw_orcid":"https://orcid.org/0000-0002-6309-5452","affiliations":[{"raw_affiliation_string":"Department of Quantitative Methods, College of Business, King Faisal University, Al-Ahsa, Saudi Arabia","institution_ids":["https://openalex.org/I4626487"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5027470494"],"corresponding_institution_ids":["https://openalex.org/I8636806"],"apc_list":{"value":1850,"currency":"USD","value_usd":1850},"apc_paid":{"value":1850,"currency":"USD","value_usd":1850},"fwci":1.0627,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.8439249,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":98},"biblio":{"volume":"13","issue":null,"first_page":"202500","last_page":"202523"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9138000011444092,"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.9138000011444092,"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/T11942","display_name":"Transportation and Mobility Innovations","score":0.006000000052154064,"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"}},{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.0044999998062849045,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/scalability","display_name":"Scalability","score":0.656000018119812},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.5809000134468079},{"id":"https://openalex.org/keywords/reinforcement-learning","display_name":"Reinforcement learning","score":0.5713000297546387},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5041000247001648},{"id":"https://openalex.org/keywords/bridging","display_name":"Bridging (networking)","score":0.4986000061035156},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.42179998755455017},{"id":"https://openalex.org/keywords/adaptability","display_name":"Adaptability","score":0.4180000126361847},{"id":"https://openalex.org/keywords/stochastic-optimization","display_name":"Stochastic optimization","score":0.36070001125335693},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.3492000102996826}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7684999704360962},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.656000018119812},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.629800021648407},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.5809000134468079},{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.5713000297546387},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5041000247001648},{"id":"https://openalex.org/C174348530","wikidata":"https://www.wikidata.org/wiki/Q188635","display_name":"Bridging (networking)","level":2,"score":0.4986000061035156},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.42179998755455017},{"id":"https://openalex.org/C177606310","wikidata":"https://www.wikidata.org/wiki/Q5674297","display_name":"Adaptability","level":2,"score":0.4180000126361847},{"id":"https://openalex.org/C194387892","wikidata":"https://www.wikidata.org/wiki/Q1747770","display_name":"Stochastic optimization","level":2,"score":0.36070001125335693},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.3492000102996826},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.34529998898506165},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.34220001101493835},{"id":"https://openalex.org/C2778820799","wikidata":"https://www.wikidata.org/wiki/Q3454688","display_name":"Cost reduction","level":2,"score":0.32820001244544983},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.3260999917984009},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.3140999972820282},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.30709999799728394},{"id":"https://openalex.org/C100776233","wikidata":"https://www.wikidata.org/wiki/Q2532492","display_name":"Bridge (graph theory)","level":2,"score":0.2985999882221222},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.28839999437332153},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.27730000019073486},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.27709999680519104},{"id":"https://openalex.org/C8272713","wikidata":"https://www.wikidata.org/wiki/Q176737","display_name":"Stochastic process","level":2,"score":0.27070000767707825},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2702000141143799},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2689000070095062},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.2669000029563904},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.2587999999523163},{"id":"https://openalex.org/C79487989","wikidata":"https://www.wikidata.org/wiki/Q934680","display_name":"Vehicle dynamics","level":2,"score":0.2533999979496002}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/access.2025.3635886","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2025.3635886","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:6c9af21d91f441758383156d2280cfdd","is_oa":true,"landing_page_url":"https://doaj.org/article/6c9af21d91f441758383156d2280cfdd","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Access, Vol 13, Pp 202500-202523 (2025)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1109/access.2025.3635886","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2025.3635886","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6284995783","display_name":null,"funder_award_id":"KFU254186","funder_id":"https://openalex.org/F4320322804","funder_display_name":"Deanship of Scientific Research, King Faisal University"}],"funders":[{"id":"https://openalex.org/F4320322804","display_name":"Deanship of Scientific Research, King Faisal University","ror":"https://ror.org/00dn43547"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Optimizing":[0],"fuel":[1,143,237],"delivery":[2,144],"operations":[3],"presents":[4],"significant":[5],"challenges":[6],"due":[7],"to":[8,85,123,151,167,209,212],"stochastic":[9,57,233],"demand,":[10,180],"dynamic":[11],"travel":[12],"conditions,":[13],"and":[14,49,62,70,133,175,196,229,239],"complex":[15],"operational":[16,96],"constraints.":[17],"While":[18],"traditional":[19,189],"optimization":[20],"provides":[21,226],"rigorous":[22],"formulations,":[23],"it":[24],"becomes":[25],"computationally":[26],"intractable":[27],"for":[28,214,232],"large-scale":[29,137],"networks.":[30],"This":[31],"paper":[32],"proposes":[33],"a":[34,56,91,108,227],"novel":[35],"hybrid":[36],"framework":[37,158,201],"that":[38,104,155],"synergistically":[39],"integrates":[40],"Deep":[41],"Reinforcement":[42],"Learning":[43],"(DRL),":[44],"Graph":[45],"Neural":[46],"Networks":[47],"(GNNs),":[48],"deterministic":[50,65],"constraint":[51,182],"validation.":[52],"We":[53],"first":[54],"formulate":[55],"model":[58],"capturing":[59],"demand":[60],"uncertainty":[61],"derive":[63],"its":[64],"equivalent":[66],"using":[67],"chance":[68],"constraints":[69],"recourse":[71],"strategies.":[72],"Our":[73],"solution":[74,231],"employs":[75],"Proximal":[76],"Policy":[77],"Optimization":[78],"(PPO)":[79],"augmented":[80],"with":[81,100,181,221],"GNN-based":[82],"spatial":[83],"encoding":[84],"learn":[86],"adaptive":[87],"routing":[88,235],"policies,":[89],"while":[90,119],"post-decision":[92],"validation":[93],"mechanism":[94],"ensures":[95],"feasibility.":[97,199],"Rigorous":[98],"comparison":[99],"Gurobi":[101],"10.0.1":[102],"establishes":[103],"our":[105,156],"approach":[106],"achieves":[107],"2.8%":[109],"optimality":[110],"gap":[111,130],"on":[112,125,136,141],"small":[113],"instances":[114],"where":[115],"exact":[116,120],"solutions":[117],"exist,":[118],"methods":[121],"fail":[122],"converge":[124,210],"medium-scale":[126],"networks":[127,145],"(16.7%":[128],"MIP":[129],"after":[131],"24h)":[132],"exhaust":[134],"memory":[135],"instances.":[138],"Extensive":[139],"experiments":[140],"real-world":[142],"from":[146,149],"Tunisia":[147],"(ranging":[148],"10":[150],"100":[152],"nodes)":[153],"demonstrate":[154],"PPO-GNN":[157],"significantly":[159],"outperforms":[160],"classical":[161,215],"approaches":[162],"across":[163],"all":[164],"scales.":[165],"Compared":[166],"standard":[168],"DRL,":[169],"we":[170],"achieve":[171],"7.2\u20138.5%":[172],"cost":[173,195],"reduction":[174],"72\u201378%":[176],"decrease":[177],"in":[178,194,198,236],"unmet":[179],"violations":[183],"reduced":[184],"by":[185],"over":[186],"75%.":[187],"Against":[188],"heuristics,":[190],"improvements":[191],"reach":[192],"11.7%":[193],"67%":[197],"The":[200],"demonstrates":[202],"superior":[203],"scalability,":[204],"requiring":[205],"only":[206],"31,400\u201335,200":[207],"episodes":[208],"compared":[211],"42,100\u201346,200":[213],"DRL.":[216],"By":[217],"bridging":[218],"learning-based":[219],"adaptability":[220],"optimization-based":[222],"rigor,":[223],"this":[224],"work":[225],"practical":[228],"scalable":[230],"vehicle":[234],"logistics":[238],"beyond.":[240]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-05-06T08:25:59.206177","created_date":"2025-11-23T00:00:00"}