no code implementations • 27 May 2018 • Aleksey O. Zakharov, Yulia V. Kovalenko
An approximation of the Pareto set to the bi-ATSP is constructed by a new multi-objective genetic algorithm.
Traveling Salesman Problem