Property analysis of symmetric travelling salesman problem instances acquired through evolution

Simple item page
dc.creatorvan Hemert, J. I.
dc.date2005-02-28
dc.date.accessioned2026-07-07T03:22:34Z
dc.date.available2026-07-07T03:22:34Z
dc.descriptionWe 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.
dc.descriptionTo 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
dc.identifierhttps://arxiv.org/abs/cs/0502096
dc.identifierhttp://arxiv.org/abs/cs/0502096
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32648
dc.subjectNeural and Evolutionary Computing
dc.subjectArtificial Intelligence
dc.subjectG1.6;I.2.8
dc.titleProperty analysis of symmetric travelling salesman problem instances acquired through evolution
dc.typetext

Files

Collections

arXiv