In recent years several metaheuristics have been proposed for the Vehicle Routing Problem. This article reviews the main metaheuristics for this problem: simulated annealing, deterministic annealing, tabu search, genetic algorithms, ant systems, neural networks. Several comparative computational results are reported.