A Deep Reinforcement Learning-Based Adaptive Large Neighborhood Search for Capacitated Electric Vehicle Routing Problems

被引:0
|
作者
Wang, Chao [1 ]
Cao, Mengmeng [2 ]
Jiang, Hao [1 ]
Xiang, Xiaoshu [3 ,4 ]
Zhang, Xingyi [5 ]
机构
[1] Anhui Univ, Engn Res Ctr Autonomous Unmanned Syst Technol, Sch Artificial Intelligence,Minist Educ, Informat Mat & Intelligent Sensing Lab Anhui Prov, Hefei 230601, Peoples R China
[2] Anhui Univ, Sch Comp Sci & Technol, Hefei 230601, Peoples R China
[3] Anhui Univ, Inst Phys Sci, Hefei 230601, Peoples R China
[4] Anhui Univ, Inst Informat Technol, Hefei 230601, Peoples R China
[5] Anhui Univ, Sch Comp Sci & Technol, Key Lab Intelligent Comp & Signal Proc, Minist Educ, Hefei 230601, Peoples R China
来源
IEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTATIONAL INTELLIGENCE | 2025年 / 9卷 / 01期
基金
中国国家自然科学基金;
关键词
Adaptive large neighborhood search; capacitated electric vehicle routing problem; deep reinforcement learning; adaptive operator selection; TIME WINDOWS; ALGORITHM;
D O I
10.1109/TETCI.2024.3444698
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The Capacitated Electric Vehicle Routing Problem (CEVRP) poses a novel challenge within the field of vehicle routing optimization, as it requires consideration of both customer service requirements and electric vehicle recharging schedules. In addressing the CEVRP, Adaptive Large Neighborhood Search (ALNS) has garnered widespread acclaim due to its remarkable adaptability and versatility. However, the original ALNS, using a weight-based scoring method, relies solely on the past performances of operators to determine their weights, thereby failing to capture crucial information about the ongoing search process. Moreover, it often employs a fixed single charging strategy for the CEVRP, neglecting the potential impact of alternative charging strategies on solution improvement. Therefore, this study treats the selection of operators as a Markov Decision Process and introduces a novel approach based on Deep Reinforcement Learning (DRL) for operator selection. This approach enables adaptive selection of both destroy and repair operators, alongside charging strategies, based on the current state of the search process. More specifically, a state extraction method is devised to extract features not only from the problem itself but also from the solutions generated during the iterative process. Additionally, a novel reward function is designed to guide the DRL network in selecting an appropriate operator portfolio for the CEVRP. Experimental results demonstrate that the proposed algorithm excels in instances with fewer than 100 customers, achieving the best values in 7 out of 8 test instances. It also maintains competitive performance in instances with over 100 customers and requires less time compared to population-based methods.
引用
收藏
页码:131 / 144
页数:14
相关论文
共 50 条
  • [41] Deep Reinforcement Learning for the Electric Vehicle Routing Problem With Time Windows
    Lin, Bo
    Ghaddar, Bissan
    Nathwani, Jatin
    IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2022, 23 (08) : 11528 - 11538
  • [42] An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and synchronized visits
    Liu, Ran
    Tao, Yangyi
    Xie, Xiaolei
    COMPUTERS & OPERATIONS RESEARCH, 2019, 101 : 250 - 262
  • [43] Large neighborhood search for multi-trip vehicle routing
    Francois, Veronique
    Arda, Yasemin
    Crama, Yves
    Laporte, Gilbert
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 255 (02) : 422 - 441
  • [44] Deep Reinforcement Learning-Based Routing on Software-Defined Networks
    Kim, Gyungmin
    Kim, Yohan
    Lim, Hyuk
    IEEE ACCESS, 2022, 10 : 18121 - 18133
  • [45] Hybridizing large neighborhood search and exact methods for generalized vehicle routing problems with time windows
    Dumez, Dorian
    Tilk, Christian
    Irnich, Stefan
    Lehuede, Fabien
    Peton, Olivier
    EURO JOURNAL ON TRANSPORTATION AND LOGISTICS, 2021, 10
  • [46] Optimization-Based Adaptive Large Neighborhood Search for the Production Routing Problem
    Adulyasak, Yossiri
    Cordeau, Jean-Francois
    Jans, Raf
    TRANSPORTATION SCIENCE, 2014, 48 (01) : 20 - 45
  • [47] A large neighborhood search-based matheuristic for the load-dependent electric vehicle routing problem with time windows
    Rastani, Sina
    Catay, Bulent
    ANNALS OF OPERATIONS RESEARCH, 2023, 324 (1-2) : 761 - 793
  • [48] The mixed fleet vehicle routing problem with partial recharging by multiple chargers: Mathematical model and adaptive large neighborhood search
    Donmez, Sercan
    Koc, Cagri
    Altiparmak, Fulya
    TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2022, 167
  • [49] An Adaptive Large Neighborhood Search for the green mixed fleet vehicle routing problem with realistic energy consumption and partial recharges
    Yu, Vincent F.
    Jodiawan, Panca
    Gunawan, Aldy
    APPLIED SOFT COMPUTING, 2021, 105
  • [50] A unified-adaptive large neighborhood search metaheuristic for periodic location-routing problems
    Koc, Cagri
    TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2016, 68 : 265 - 284