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 条
  • [31] Hybrid adaptive large neighborhood search for vehicle routing problemswith depot location decisions
    Voigt, Stefan
    Frank, Markus
    Fontaine, Pirmin
    Kuhn, Heinrich
    COMPUTERS & OPERATIONS RESEARCH, 2022, 146
  • [32] Adaptive large neighborhood search for the vehicle routing problem with synchronization constraints at the delivery location
    Sarasola, Briseida
    Doerner, Karl F.
    NETWORKS, 2020, 75 (01) : 64 - 85
  • [33] An efficient hybrid adaptive large neighborhood search method for the capacitated team orienteering problem
    Hammami, Farouk
    EXPERT SYSTEMS WITH APPLICATIONS, 2024, 249
  • [34] An enhanced adaptive large neighborhood search for fatigue-conscious electric vehicle routing and scheduling problem considering driver heterogeneity
    Tan, Weihua
    Yuan, Xiaofang
    Zhang, Xizheng
    Wang, Jinlei
    EXPERT SYSTEMS WITH APPLICATIONS, 2023, 218
  • [35] Real-World Vehicle Routing Using Adaptive Large Neighborhood Search
    Sassmann, Vojtech
    Rudova, Hana
    Gabonnay, Michal
    Sobotka, Vaclav
    EVOLUTIONARY COMPUTATION IN COMBINATORIAL OPTIMIZATION, EVOCOP 2023, 2023, 13987 : 34 - 49
  • [36] An Adaptive Large Neighborhood Search for a Green Vehicle Routing Problem with Depot Sharing
    Wu, Zixuan
    Lou, Ping
    Hu, Jianmin
    Zeng, Yuhang
    Fan, Chuannian
    MATHEMATICS, 2025, 13 (02)
  • [37] Adaptive large variable neighborhood search for a multiperiod vehicle and technician routing problem
    Graf, Benjamin
    NETWORKS, 2020, 76 (02) : 256 - 272
  • [38] An Improved Adaptive Large Neighborhood Search Algorithm for the Heterogeneous Fixed Fleet Vehicle Routing Problem
    Wu, Yan
    Yang, Wang
    He, Guochao
    Zhao, Shennan
    PROCEEDINGS OF 2017 8TH IEEE INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING AND SERVICE SCIENCE (ICSESS 2017), 2017, : 657 - 663
  • [39] An adaptive large-neighborhood search heuristic for a multi-period vehicle routing problem
    Dayarian, Iman
    Crainic, Teodor Gabriel
    Gendreau, Michel
    Rei, Walter
    TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2016, 95 : 95 - 123
  • [40] Adaptive Large Neighborhood Search for Vehicle Routing Problem with Cross-Docking
    Gunawan, Aldy
    Widjaja, Audrey Tedja
    Vansteenwegen, Pieter
    Yu, Vincent F.
    2020 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2020,