Publisher Summary This chapter discusses some of the most important vehicle routing
problem types. The vehicle routing problem lies at the heart of distribution management. It is …

The Vehicle Routing Problem (VRP) calls for the determination of the optimal set of routes to
be performed by a fleet of vehicles to serve a given set of customers, and it is one of the most …

The vehicle routing problem (VRP) is a difficult and well-studied combinatorial optimization
problem. Real-world instances of the VRP can contain hundreds and even thousands of …

In the standard, capacitated vehicle routing problem (VRP), a homogeneous fleet of vehicles
services a set of customers from a single depot. Each vehicle has a fixed capacity that …

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 …

Abstract In the Vehicle Routing Problem (VRP), the aim is to design a set of m minimum cost
vehicle routes through n customer locations, so that each route starts and ends at a common …

4.1▪ Introduction In recent years, several sophisticated mathematical programming
decomposition algorithms have been put forward for the solution of the VRP. Yet, despite …

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 …

A guide to vehicle routing heuristics Page 1 Journal of the Operational Research Society (2002)
53, 512–522 ©2002 Operational Research Society Ltd. All rights reserved. 0160-5682/02 $15.00 …

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 …