Over the last thirty-five years several heuristics have been proposed for the Vehicle Routing problem. This article reviews the main classical heuristics for this problem: constructive methods, two-phase methods, improvement heuristics. Several comparative computational results are reported.