Property analysis of symmetric travelling salesman problem instances acquired through evolution
神经与进化计算
2007-05-23 v1 人工智能
摘要
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.
引用
@article{arxiv.cs/0502096,
title = {Property analysis of symmetric travelling salesman problem instances acquired through evolution},
author = {J. I. van Hemert},
journal= {arXiv preprint arXiv:cs/0502096},
year = {2007}
}
备注
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