Improving the state-of-the-art in the Traveling Salesman Problem: An Anytime Automatic Algorithm Selection

Isaías I. Huerta, Daniel A. Neira, Daniel A. Ortega, Vicente Varas, Julio Godoy, Roberto Javier Asín Achá

Abstract: Highlights•A new metaheuristic for the TSP based on Automatic Algorithm Selection is proposed.•We consider the anytime nature of the solution computation by the solvers in our work.•A spatial representation of instances is presented, avoiding calculation of features.•Our approach outperforms state-of-the-art solvers in public data sets.