The complexity of the Lin-Kernighan heuristic for the traveling salesman problem
SIAM Journal on Computing
Density-Based Clustering in Spatial Databases: The Algorithm GDBSCAN and Its Applications
Data Mining and Knowledge Discovery
Efficient cluster compensation for lin-kernighan heuristics
Efficient cluster compensation for lin-kernighan heuristics
Quantum computing and phase transitions in combinatorial search
Journal of Artificial Intelligence Research
Where the really hard problems are
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
A genetic algorithm for the index selection problem
EvoWorkshops'03 Proceedings of the 2003 international conference on Applications of evolutionary computing
Evolving combinatorial problem instances that are difficult to solve
Evolutionary Computation
An analysis of problem difficulty for a class of optimisation heuristics
EvoCOP'07 Proceedings of the 7th European conference on Evolutionary computation in combinatorial optimization
Understanding TSP difficulty by learning from evolved instances
LION'10 Proceedings of the 4th international conference on Learning and intelligent optimization
Review: Measuring instance difficulty for combinatorial optimization problems
Computers and Operations Research
Discovering the suitability of optimisation algorithms by learning from evolved instances
Annals of Mathematics and Artificial Intelligence
A model free method to generate human genetics datasets with complex gene-disease relationships
EvoBIO'10 Proceedings of the 8th European conference on Evolutionary Computation, Machine Learning and Data Mining in Bioinformatics
| Hi-index | 0.00 |
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.