An O(N log N) planar travelling salesman heuristic based on spacefilling curves

Authors:
J.J Bartholdi, III;L.K Platzman
Affiliations:
School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA 30332, U.S.A.;School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA 30332, U.S.A.
Venue:
Operations Research Letters
Year:
1982

Citing 1
Cited 6

Spacefilling curves and the planar travelling salesman problem

Journal of the ACM (JACM)

Review: Industrial aspects and literature survey: Fleet composition and routing

Computers and Operations Research
Genetically improved presequences for euclidean traveling salesman problems

Mathematical and Computer Modelling: An International Journal
Algorithms for the universal and a priori TSP

Operations Research Letters
TRAVEL - An interactive travelling salesman problem package for the IBM-personal computer

Operations Research Letters
Worst-case examples for the spacefilling curve heuristic for the Euclidean traveling salesman problem

Operations Research Letters
Distributed, multi-user, multi-application, and multi-sensor data fusion over named data networks

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

N points in a square of area A may be sorted according to their images under a spacefilling mapping to give a tour of length at most 2@/NA. If the points are statistically independent under a smooth distribution, with N large, then the tour will be roughly 25% longer than optimum (and a simple enhancement reduces this to 15%). The algorithm is easily coded: a complete BASIC program is included in the appendix. Since the algorithm consists essentially of sorting, points are easily added or removed. Our method may also be used with simple dynamic programming to solve TSP path problems.