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 the savings method, the sweep algorithm and various two-phase approaches. The second part is devoted to tabu search heuristics which have proved the most successful metaheuristic approach. Comparative computational results are presented.