TY - CONF
T1 - Property analysis of symmetric travelling salesman problem instances acquired through evolution
T2 - Springer Lecture Notes on Computer Science
Y1 - 2005
A1 - van Hemert, J. I.
ED - G. Raidl
ED - J. Gottlieb
KW - problem evolving
KW - travelling salesman
AB - 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 salesman problem.
JF - Springer Lecture Notes on Computer Science
PB - Springer-Verlag, Berlin
ER -