7 citations · 8 across the 3 of their papers we have counts for
Showing cs.NEShow all
2 papers · 1 filter
cs.NE2018
Construction and reduction of the Pareto set in asymmetric travelling salesman problem with two criteria
Aleksey O. Zakharov, Yulia V. Kovalenko
We consider the bicriteria asymmetric travelling salesman problem (bi-ATSP). Optimal solution to a multicriteria problem is usually supposed to be the Pareto set, which is rather w…
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…