A hybrid genetic algorithm for the min-max Multiple Traveling Salesman Problem

Sasan Mahmoudinazlou, Changhyun Kwon

Abstract: Highlights•We propose a hybrid genetic algorithm for the Multiple Traveling Salesman Problem.•We propose a novel crossover operator that is effective for the min–max problem.•Our algorithm outperforms all existing algorithms on average.•We improve the best-known solutions for 21 out of 89 benchmark instances.