A genetic distance metric to discriminate the selection of algorithms for the general ATSP problem

DOI10.3233/IFS-2010-0435zbMATH1208.68180OpenAlexW1593051492MaRDI QIDQ3582425FDOQ3582425

Authors Joaquín Pérez-Ortega, Rodolfo A. Pazos R., Jorge A. Ruiz-Vanoye, Juan Frausto-Solís, Jose-Joel Gonzalez-Barbosa, Hector J. Fraire-Huacuja, Ocotlán Díaz-Parra

Publication date 2 September 2010

Published in Journal of Intelligent & Fuzzy Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/ifs-2010-0435

zbMATH Keywords

machine learningdiscriminant analysisinductive learningdata-mining techniques

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 1893558
• A new memetic algorithm for the asymmetric traveling salesman problem
• Genetic Algorithm with Optimal Recombination for the Asymmetric Travelling Salesman Problem
• Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times
• An Efficient Genetic Algorithm for the Traveling Salesman Problem

Cited in

(1)

• On the potential of normalized TSP features for automated algorithm selection

Describes a project that uses

Uses Software

• HeuristicLab

This page was built for publication: A genetic distance metric to discriminate the selection of algorithms for the general ATSP problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3582425)