International Transactions in Operational Research · 2000 · 705 citations · 41 references
Natural SciencesMathematicsOptimizationTransportationTransportation EngineeringCombinatorial OptimizationHeuristic OptimizationHeuristic SearchMetaheuristic OptimizationRoutingRouting AlgorithmsHeuristic Routing AlgorithmsHeuristicsMetaheuristic SearchRouting ProblemsSearch HeuristicsVehicle RoutingVehicle Routing Problems
This article surveys heuristics for the Vehicle Routing Problem. The survey is organized into classical heuristics—such as the savings method, sweep algorithm, and two‑phase approaches—and modern tabu‑search heuristics, which are considered the most successful metaheuristic. Comparative computational results are presented.
Abstract 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 to be the most successful metaheuristic approach. Comparative computational results are presented.
41
Computer Solutions of the Traveling Salesman Problem
Shen Lin · Bell System Technical Journal · 1965 · 2K citations