A note on a new greedy-solution representation and a new greedy parallelizable heuristic for the traveling salesman problem

Abstract

A new approach is presented to the traveling salesman problem (TSP) relying on a novel greedy representation of the solution space and leading to a different definition of neighborhood structures required in many local and random search approaches. Accordingly, a parallelizable search strategy is proposed based upon local search with random restarts that exploits the characteristics of the representation. Preliminary experimental results on several sets of test problems, among which very well-known benchmarks, show that the representation developed, matched with the search strategy proposed, attains high quality near-optimal solutions in moderate execution times.