Genetic Algorithm with Optimal Recombination for the Asymmetric Travelling Salesman Problem
This topic contains 0 replies, has 1 voice, and was last updated by arXiv 1 year, 3 months ago.

Genetic Algorithm with Optimal Recombination for the Asymmetric Travelling Salesman Problem
We propose a new genetic algorithm with optimal recombination for the asymmetric instances of travelling salesman problem. The algorithm incorporates several new features that contribute to its effectiveness: (i) Optimal recombination problem is solved within crossover operator. (ii) A new mutation operator performs a random jump within 3opt or 4opt neighborhood. (iii) Greedy constructive heuristic of W.Zhang and 3opt local search heuristic are used to generate the initial population. A computational experiment on TSPLIB instances shows that the proposed algorithm yields competitive results to other wellknown memetic algorithms for asymmetric travelling salesman problem.
Genetic Algorithm with Optimal Recombination for the Asymmetric Travelling Salesman Problem
by A. V. Eremeev, Yu. V. Kovalenko
https://arxiv.org/pdf/1706.06920v2.pdf
You must be logged in to reply to this topic.