On complexity of the optimal recombination for the travelling salesman problem

Authors:
Anton V. Eremeev
Affiliations:
Omsk Branch of Sobolev Institute of Mathematics, Omsk, Russia
Venue:
EvoCOP'11 Proceedings of the 11th European conference on Evolutionary computation in combinatorial optimization
Year:
2011

Citing 6
Cited 0

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Optimized Crossover-Based Genetic Algorithms for the Maximum Cardinality and Maximum Weight Clique Problems

Journal of Heuristics
Utilizing Dynastically Optimal Forma Recombination in Hybrid Genetic Algorithms

PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
Tour Merging via Branch-Decomposition

INFORMS Journal on Computing
On complexity of optimal recombination for binary representations of solutions

Evolutionary Computation
A hybrid genetic algorithm for the traveling salesman problem using generalized partition crossover

PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

The computational complexity of the optimal recombination for the Travelling Salesman Problem is considered both in the symmetric and in the general cases. Strong NP-hardness of these optimal recombination problems is proven and solving approaches are considered.