Metaheuristics are widely employed to solve hard optimization problems, like vehicle routing problems (VRP), for which exact solution methods are impractical. In particular, local search …
S Li, Z Yan, C Wu - Advances in Neural Information …, 2021 - proceedings.neurips.cc
Vehicle routing problems (VRPs) form a class of combinatorial problems with wide practical applications. While previous heuristic or learning-based works achieve decent solutions on …
J Zhao, M Mao, X Zhao, J Zou - IEEE Transactions on Intelligent …, 2020 - ieeexplore.ieee.org
Different variants of the Vehicle Routing Problem (VRP) have been studied for decades. State-of-the-art methods based on local search have been developed for VRPs, while still …
Finding the best sequence of local search operators that yields the optimal performance of Variable Neighborhood Search (VNS) is an important open research question in the field of …
ABSTRACT eCommerce, postal and logistics' planners require to solve large-scale capacitated vehicle routing problems (CVRPs) on a daily basis. CVRP problems are NP …
T Vidal - Computers & Operations Research, 2022 - Elsevier
The vehicle routing problem is one of the most studied combinatorial optimization topics, due to its practical importance and methodological interest. Yet, despite extensive …
The Vehicle Routing Problem (VRP) is a well-known NP-hard combinatorial optimization problem, which has wide spread applications in real world, such as logistics, bus route …
This paper provides a systematic overview of machine learning methods applied to solve NP- hard Vehicle Routing Problems (VRPs). Recently, there has been a great interest from both …
IP Souza, MCS Boeres, REN Moraes - Swarm and Evolutionary …, 2023 - Elsevier
Abstract The Capacitated Vehicle Routing Problem is a well-known combinatorial problem. In this paper, we propose a hybrid algorithm based on a discrete adaptation of the …