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
基金
中国国家自然科学基金;
关键词
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 条
  • [1] An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
    Ribeiro, Glaydston Mattos
    Laporte, Gilbert
    COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (03) : 728 - 735
  • [2] A reinforcement learning-Variable neighborhood search method for the capacitated Vehicle Routing Problem
    Kalatzantonakis, Panagiotis
    Sifaleras, Angelo
    Samaras, Nikolaos
    EXPERT SYSTEMS WITH APPLICATIONS, 2023, 213
  • [3] Adaptive Large Neighborhood Search Metaheuristic for the Capacitated Vehicle Routing Problem with Parcel Lockers
    Saker, Amira
    Eltawil, Amr
    Ali, Islam
    LOGISTICS-BASEL, 2023, 7 (04):
  • [4] Neural Large Neighborhood Search for the Capacitated Vehicle Routing Problem
    Hottung, Andre
    Tierney, Kevin
    ECAI 2020: 24TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2020, 325 : 443 - 450
  • [5] An adaptive large neighborhood search heuristic for dynamic vehicle routing problems
    Chen, Shifeng
    Chen, Rong
    Wang, Gai-Ge
    Gao, Jian
    Sangaiah, Arun Kumar
    COMPUTERS & ELECTRICAL ENGINEERING, 2018, 67 : 596 - 607
  • [6] A Deep Reinforcement Learning-Based Adaptive Search for Solving Time-Dependent Green Vehicle Routing Problem
    Yue, Bin
    Ma, Junxu
    Shi, Jinfa
    Yang, Jie
    IEEE ACCESS, 2024, 12 : 33400 - 33419
  • [7] An Adaptive Large Neighborhood Search Heuristic for the Electric Vehicle Routing Problems with Time Windows and Recharging Strategies
    Duan, Ya-ru
    Hu, Yong-shi
    Wu, Peng
    JOURNAL OF ADVANCED TRANSPORTATION, 2023, 2023
  • [8] Adaptive large neighborhood search for the dynamic vehicle routing problem with electric vehicles
    Wang, Sihan
    Liu, Yang
    Huang, Xuyan
    Sun, Wei
    2023 35TH CHINESE CONTROL AND DECISION CONFERENCE, CCDC, 2023, : 3776 - 3780
  • [9] A Hybrid of Deep Reinforcement Learning and Local Search for the Vehicle Routing Problems
    Zhao, Jiuxia
    Mao, Minjia
    Zhao, Xi
    Zou, Jianhua
    IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2021, 22 (11) : 7208 - 7218
  • [10] A review and ranking of operators in adaptive large neighborhood search for vehicle routing problems
    Voigt, Stefan
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2025, 322 (02) : 357 - 375