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

This work presents a new metaheuristic for the euclidean Traveling Salesman Problem (TSP) based on an Anytime Automatic Algorithm Selection model using a portfolio of five state-of-the-art solvers. We introduce a new spatial representation of nodes, in the form of a matrix grid, avoiding costly calc...

Celý popis