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...

Full description

Saved in:

Bibliographic Details
Published in:	Expert systems with applications Vol. 187; p. 115948
Main Authors:	Huerta, Isaías I., Neira, Daniel A., Ortega, Daniel A., Varas, Vicente, Godoy, Julio, Asín-Achá, Roberto
Format:	Journal Article
Language:	English
Published:	New York Elsevier Ltd 01.01.2022 Elsevier BV
Subjects:	Algorithm selection problem Algorithms Anytime behavior approach Artificial neural networks Combinatorial optimization Datasets Heuristic methods Machine learning Ranking Representations Solvers Traveling salesman problem TSP TSP Anytime behavior approach Combinatorial optimization Algorithm selection problem
ISSN:	0957-4174, 1873-6793
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!