A new Hyper-heuristic based on Adaptive Simulated Annealing and Reinforcement Learning for the Capacitated Electric Vehicle Routing Problem

被引:4
|
作者
Rodriguez-Esparza, Erick [1 ]
Masegosa, Antonio D. [1 ,2 ]
Oliva, Diego [3 ]
Onieva, Enrique [1 ]
机构
[1] Univ Deusto, Fac Engn, DeustoTech, Ave Univ 24, Bilbao 48007, Spain
[2] Ikerbasque, Basque Fdn Sci, Plaza Euskadi 5, Bilbao 48009, Spain
[3] Univ Guadalajara, Dept Ingn Electrofoton, CUCEI, Ave Revoluc 1500, Guadalajara 44430, Jal, Mexico
关键词
Last-mile logistics; Hyper-heuristic; Electric vehicles; Capacitated electric vehicle routing problem; Combinatorial optimization; Reinforcement learning; TIME WINDOWS; LOCAL SEARCH; OPTIMIZATION; IMPACT; FLEET;
D O I
10.1016/j.eswa.2024.124197
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Electric vehicles (EVs) have been adopted in urban areas to reduce environmental pollution and global warming due to the increasing number of freight vehicles. However, there are still deficiencies in routing the trajectories of last-mile logistics that continue to impact social and economic sustainability. For that reason, in this paper, a hyper-heuristic (HH) approach called Hyper-heuristic Adaptive Simulated Annealing with Reinforcement Learning (HHASARL) is proposed. It is composed of a multi-armed bandit method and the self-adaptive Simulated Annealing (SA) metaheuristic algorithm for solving the problem called Capacitated Electric Vehicle Routing Problem (CEVRP). Due to the limited number of charging stations and the travel range of EVs, the EVs must require battery recharging moments in advance and reduce travel times and costs. The implementation of the HH improves multiple minimum best-known solutions and obtains the best mean values for some high-dimensional instances for the proposed benchmark for the IEEE WCCI2020 competition.
引用
收藏
页数:15
相关论文
共 50 条
  • [1] Hyper-heuristic for the capacitated vehicle routing problem with policy gradient
    Zhang J.-L.
    Sun Y.-S.
    Zhao Y.-W.
    Yu M.-F.
    Jiang Y.-Y.
    Kongzhi Lilun Yu Yingyong/Control Theory and Applications, 2024, 41 (06): : 1111 - 1122
  • [2] A novel reinforcement learning-based hyper-heuristic for heterogeneous vehicle routing problem
    Qin, Wei
    Zhuang, Zilong
    Huang, Zizhao
    Huang, Haozhe
    COMPUTERS & INDUSTRIAL ENGINEERING, 2021, 156
  • [3] A Simulated Annealing Heuristic for the Capacitated Green Vehicle Routing Problem
    Normasari, Nur Mayke Eka
    Yu, Vincent F.
    Bachtiyar, Candra
    Sukoyo
    MATHEMATICAL PROBLEMS IN ENGINEERING, 2019, 2019
  • [4] A Flexible and Adaptive Hyper-heuristic Approach for (Dynamic) Capacitated Vehicle Routing Problems
    Garrido, Pablo
    Castro, Carlos
    FUNDAMENTA INFORMATICAE, 2012, 119 (01) : 29 - 60
  • [5] An Improved Genetic Programming Hyper-Heuristic for the Uncertain Capacitated Arc Routing Problem
    MacLachlan, Jordan
    Mei, Yi
    Branke, Juergen
    Zhang, Mengjie
    AI 2018: ADVANCES IN ARTIFICIAL INTELLIGENCE, 2018, 11320 : 432 - 444
  • [6] PHH: Policy-Based Hyper-Heuristic With Reinforcement Learning
    Udomkasemsub, Orachun
    Sirinaovakul, Booncharoen
    Achalakul, Tiranee
    IEEE ACCESS, 2023, 11 : 52026 - 52049
  • [7] A simulated annealing heuristic for the hybrid vehicle routing problem
    Yu, Vincent F.
    Redi, A. A. N. Perwira
    Hidayat, Yosi Agustina
    Wibowo, Oktaviyanto Jimat
    APPLIED SOFT COMPUTING, 2017, 53 : 119 - 132
  • [8] Swarm intelligence-based hyper-heuristic for the vehicle routing problem with prioritized customers
    Tarhini, Abbas
    Danach, Kassem
    Harfouche, Antoine
    ANNALS OF OPERATIONS RESEARCH, 2022, 308 (1-2) : 549 - 570
  • [9] A Combined Generative and Selective Hyper-heuristic for the Vehicle Routing Problem
    Sim, Kevin
    Hart, Emma
    GECCO'16: PROCEEDINGS OF THE 2016 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2016, : 1093 - 1100
  • [10] Adaptive temperature control of simulated annealing for solving capacitated vehicle routing problem
    Turky, Ayad M.
    COMPUTER COMMUNICATION AND MANAGEMENT, 2011, 5 : 80 - 82