The Vehicle Routing Problem: An overview of exact and approximate algorithms Page 1
European Journal of Operational Research 59 (1992) 345-358 345 North-Holland Invited …

This paper presents a methodology for classifying the literature of the Vehicle Routing
Problem (VRP). VRP as a field of study and practice is defined quite broadly. It is considered …

This paper considers the design and analysis of algorithms for vehicle routing and
scheduling problems with time window constraints. Given the intrinsic difficulty of this …

The Vehicle Routing Problem (VRP) was introduced 50 years ago by Dantzig and Ramser
under the title “The Truck Dispatching Problem.” The study of the VRP has given rise to …

The management of food distribution networks is receiving more and more attention, both in
practice and in the scientific literature. In this paper, we review quantitative operations …

We consider a common variant of the vehicle routing problem in which a vehicle fleet
delivers products stored at a central depot to satisfy customer orders. Each vehicle has a …

We propose a tabu search heuristic capable of solving three well‐known routing problems:
the periodic vehicle routing problem, the periodic traveling salesman problem, and the multi …

The time dependent vehicle routing problem (TDVRP) is defined as follows. A vehicle fleet of
fixed capacities serves customers of fixed demands from a central depot. Customers are …

In this paper, we address the problem of routing a fleet of vehicles from a central depot to
customers with known demand. Routes originate and terminate at the central depot and …

This article is a survey of heuristics for the Vehicle Routing Problem. It is divided into two
parts: classical and modern heuristics. The first part contains well‐known schemes such as …