Paper
28 April 2023 A MAB-based hyper-heuristic for vehicle routing problem with time window
Yan-e Hou, Bingbing Liu, Gaojuan Fan
Author Affiliations +
Proceedings Volume 12626, International Conference on Signal Processing, Computer Networks, and Communications (SPCNC 2022); 126260A (2023) https://doi.org/10.1117/12.2674549
Event: International Conference on Signal Processing, Computer Networks, and Communications (SPCNC 2022), 2022, Zhuhai, China
Abstract
In order to efficiently solve the vehicle routing problem with time window (VRPTW), a hyper-heuristic algorithm based on reinforcement learning was proposed. Firstly, the performance of the underlying heuristic algorithm was evaluated, and then a multi-armed bandit (MAB) algorithm was used to select the low-level heuristic algorithm. At the same time, a simulated annealing-based acceptance rule was used to determine whether to accept the solution obtained by each lowlevel heuristic to ensure the diversity of solutions. Experiments was carried out on some VRPTW benchmark instances, and the results show that the proposed algorithm is effective and stable.
© (2023) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Yan-e Hou, Bingbing Liu, and Gaojuan Fan "A MAB-based hyper-heuristic for vehicle routing problem with time window", Proc. SPIE 12626, International Conference on Signal Processing, Computer Networks, and Communications (SPCNC 2022), 126260A (28 April 2023); https://doi.org/10.1117/12.2674549
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Algorithm development

Algorithms

Design and modelling

Windows

Algorithm testing

Java

Mathematical optimization

Back to Top