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

被引:19
作者
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 条
[41]   A reinforcement learning hyper-heuristic algorithm for the distributed flowshops scheduling problem under consideration of emergency order insertion [J].
Zhao, Fuqing ;
Liu, Yuebao ;
Xu, Tianpeng ;
Jonrinaldi .
APPLIED SOFT COMPUTING, 2024, 167
[42]   A hybrid approach for Capacitated Vehicle Routing Problem with Time Windows based on Conflict-Driven Clause Learning and Reinforcement Learning [J].
Christy, A. ;
Shyry, Prayla S. ;
Praveena, Anto ;
Helen, Suji L. .
2024 5TH INTERNATIONAL CONFERENCE ON INNOVATIVE TRENDS IN INFORMATION TECHNOLOGY, ICITIIT 2024, 2024,
[43]   A fast simulated annealing heuristic for the multi-depot two-echelon vehicle routing problem with delivery options [J].
Yu, Vincent F. ;
Lin, Shih-Wei ;
Zhou, Lin ;
Baldacci, Roberto .
TRANSPORTATION LETTERS-THE INTERNATIONAL JOURNAL OF TRANSPORTATION RESEARCH, 2024, 16 (08) :921-932
[44]   NeuHH: A Neuromorphic-Inspired Hyper-Heuristic Framework for Solving the Capacitated Single-Allocation p-Hub Location Routing Problem [J].
Danach, Kassem ;
Harb, Hassan ;
Amine, Semaan ;
Belhor, Mariem .
VEHICLES, 2025, 7 (02)
[45]   A Generative Hyper-Heuristic based on Multi-Objective Reinforcement Learning: the UAV Swarm Use Case [J].
Duflo, Gabriel ;
Danoy, Gregoire ;
Talbi, El-Ghazali ;
Bouvry, Pascal .
2022 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2022,
[46]   A hybrid simulated annealing and variable neighborhood search algorithm for the close-open electric vehicle routing problem [J].
Stamadianos, Themistoklis ;
Kyriakakis, Nikolaos A. ;
Marinaki, Magdalene ;
Marinakis, Yannis .
ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2023,
[47]   A hyper-heuristic with two guidance indicators for bi-objective mixed-shift vehicle routing problem with time windows [J].
Binhui Chen ;
Rong Qu ;
Ruibin Bai ;
Wasakorn Laesanklang .
Applied Intelligence, 2018, 48 :4937-4959
[48]   Parallel hyper heuristic algorithm based on reinforcement learning for the corridor allocation problem and parallel row ordering problem [J].
Liu, Junqi ;
Zhang, Zeqiang ;
Liu, Silu ;
Zhang, Yu ;
Wu, Tengfei .
ADVANCED ENGINEERING INFORMATICS, 2023, 56
[49]   A hybrid approach based on genetic algorithm and nearest neighbor heuristic for solving the capacitated vehicle routing problem [J].
de Araujo Lima, Stanley Jefferson ;
de Araujo, Sidnei Alves ;
Triguis Schimit, Pedro Henrique .
ACTA SCIENTIARUM-TECHNOLOGY, 2018, 40
[50]   A Discrete JAYA Algorithm Based on Reinforcement Learning and Simulated Annealing for the Traveling Salesman Problem [J].
Xu, Jun ;
Hu, Wei ;
Gu, Wenjuan ;
Yu, Yongguang .
MATHEMATICS, 2023, 11 (14)