Property analysis of symmetric travelling salesman problem instances acquired through evolution
Abstract
Description
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.
To be published in G. Raidl and J. Gottlieb, editors, Evolutionary Computation in Combinatorial Optimization, Springer Lecture Notes on Computer Science, pages 122-131. Springer-Verlag, Berlin, 2005
To be published in G. Raidl and J. Gottlieb, editors, Evolutionary Computation in Combinatorial Optimization, Springer Lecture Notes on Computer Science, pages 122-131. Springer-Verlag, Berlin, 2005