GENETICALLY IMPROVED PRESEQUENCES FOR EUCLIDEAN TRAVELING SALESMAN PROBLEMS
The spacefilling curve (SFC) method of Bartholdy and Platzman is an extremely fast heuristic for the Euclidean Traveling Salesman Problem. The authors show how genetic search over a parametrized family of spacefilling curves can be used to improve the quality of the the tours generated by SFC. The computational effort required grows slowly as a function of problem size, and the tours obtained define robust presequences for repetitive problems in which only a subset of all cities will be present in any given problem instance.
presequence euclidean traveling salesman problem spacefilling curve genetic algorithm problem space search