Property analysis of symmetric travelling salesman problem instances acquired through evolution

02/28/2005

∙

by   J. I. van Hemert, et al.

∙

0

∙

share

We show how an evolutionary algorithm can successfully be used to evolve a set of difficult to solve symmetric travelling salesman problem instances for two variants of the Lin-Kernighan algorithm. Then we analyse the instances in those sets to guide us towards deferring general knowledge about the efficiency of the two variants in relation to structural properties of the symmetric travelling sale sman problem.