7 citations · 14 across the 6 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.NE2017★ 7 cited
Genetic Algorithm with Optimal Recombination for the Asymmetric Travelling Salesman Problem
A. V. Eremeev, Yu. V. Kovalenko
We propose a new genetic algorithm with optimal recombination for the asymmetric instances of travelling salesman problem. The algorithm incorporates several new features that cont…
cs.DS2017
On Solving Travelling Salesman Problem with Vertex Requisitions
Anton Eremeev, Yulia Kovalenko
We consider the Travelling Salesman Problem with Vertex Requisitions, where for each position of the tour at most two possible vertices are given. It is known that the problem is s…