IIE Transactions · 1990 · 56 citations · 13 references
Natural SciencesIndustrial EngineeringOperations ManagementComputational GeometryGeometric ModelingOptimizationCombinatorial OptimizationGeometric OptimizationHeuristic OptimizationHeuristic SearchMetaheuristic OptimizationHeuristic AlgorithmsTour PlanningTraveling Salesman ProblemTraveling Salesperson Problem
Abstract Abstract: Several heuristic procedures based on geometric concepts have been developed for the Chebyshev (or too) Traveling Salesman Problem (CTSP),which has numerous applications in materials handling and information storage-retrieval. The following study is concerned with evaluating the performance of geometric approaches as a function of the shape of the service region and the number of points to be sequenced. A new approach, the band insertion heuristic, is also introduced and compared with existing procedures. Trade-offs in tour quality and solution effort are the primary focus of the study, which is empirical in nature; however, the results generally apply to a wide range of configurations.
13
Computer Solutions of the Traveling Salesman Problem
Shen Lin · Bell System Technical Journal · 1965 · 2K citations
A Method for Solving Traveling-Salesman Problems
G. A. Croes · Operations Research · 1958 · 1.5K citations
An Algorithm for the Traveling Salesman Problem
John D. C. Little, Katta G. Murty, Dura W. Sweeney et al. · Operations Research · 1963 · 1K citations · Full text