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 …

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 …

This Ph. D. thesis has been prepared at the Department of Computer Science at the
University of Copenhagen (DIKU), during the period November 2002 to December 2005 …

Vehicle routing is a well-known optimization research topic with significant practical
importance. Among different approaches to solving vehicle routing, heuristics can produce a …

Local search has been established as a successful cornerstone to tackle the Vehicle
Routing Problem, and is included in many state-of-the-art heuristics. In this paper we aim to …

This chapter reviews some of the best metaheuristics proposed in recent years for the
Vehicle Routing Problem. These are based on local search, on population search and on …

Our model is based on the graph convolutional network (GCN) with node feature
(coordination and demand) and edge feature (the real distance between nodes) as input …

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 …

We identify 135 articles published in scholarly, academic journals from January 2005 to
June 2022 that survey various aspects of the Vehicle Routing Problem (VRP) ranging from …

This study considers the application of a genetic algorithm (GA) to the basic vehicle routing
problem (VRP), in which customers of known demand are supplied from a single depot …