The vehicle routing problem (VRP) is a typical discrete combinatorial optimization problem,
and many models and algorithms have been proposed to solve the VRP and its variants …

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 …

The Vehicle Routing Problem (VRP) is one of the most intensively studied combinatorial
optimisation problems for which numerous models and algorithms have been proposed. To …

This paper is concerned with solving combinatorial optimization problems, in particular, the
capacitated vehicle routing problems (CVRP). Classical Operations Research (OR) …

This paper presents an approach to learn the local-search heuristics that iteratively improves
the solution of Vehicle Routing Problem (VRP). A local-search heuristics is composed of a …

Despite the extensive research efforts and the promising results obtained by the ML
community on Vehicle Routing Problems, most of the proposed techniques are still seldom …

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 …

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 …

The vehicle routing problem (VRP) is a difficult and well-studied combinatorial optimization
problem. We develop a parallel algorithm for the VRP that combines a heuristic local search …

This paper presents an overview of recent advances in the field of the vehicle routing
problem (VRP), based on papers published in high-quality journals during the period from …