Evolutionary algorithm for the k-interconnected multi-depot multi-traveling salesmen problem

Carlos E. Andrade, Flávio K. Miyazawa, Mauricio G.C. Resende
2013 Proceeding of the fifteenth annual conference on Genetic and evolutionary computation conference - GECCO '13  
We introduce the k-Interconnected Multi-Depot Multi-Traveling Salesmen Problem, a new problem that resembles some network design and location routing problems but carries the inherent difficulty of not having a fixed set of depots or terminals. We propose a heuristic based on a biased random-key genetic algorithm to solve it. This heuristic uses local search procedures to best choose the terminal vertices and improve the tours of a given solution. We compare our heuristic with a multi-start
more » ... edure using the same local improvements and we show that the proposed algorithm is competitive.
doi:10.1145/2463372.2463434 dblp:conf/gecco/AndradeMR13 fatcat:54s7o6bct5bxxh3vwsgjg3rc3u