The Vehicle Routing Problem (VRP) is one of the most challenging combinatorial optimization task. Defined more than 40 years ago, this problem consists in designing the optimal set of routes for fleet of vehicles in order to serve a given set of customers. The interest in VRP is motivated by its practical relevance as well as by its considerable difficulty.

This web is dedicated to the study of VRP; we have compiled here a great deal of information about it for public access: technical reports, many different variants of the problem, alternative algorithms and techniques for solving it, some well-known instances of the problem, the best-so-far solutions for those instances, bibliography, related links...

Find what you are looking for (powered by
  WWW Search Search in this Site
* This site was made in collaboration between AUREN and the Languages and Computation Sciences department of the University of Málaga by Bernabé Dorronsoro Díaz (Personal homepage)



Last update: November, 2006