00968nas a2200169 4500008004100000245010000041210006900141260002800210300001300238520041800251653002100669653002400690100001600714700001300730700001600743856003900759 2005 eng d00aProperty analysis of symmetric travelling salesman problem instances acquired through evolution0 aProperty analysis of symmetric travelling salesman problem insta bSpringer-Verlag, Berlin a122--1313 aWe 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.10aproblem evolving10atravelling salesman1 aHemert, J I1 aRaidl, G1 aGottlieb, J uhttp://research.nesc.ac.uk/node/16