On the potential of normalized TSP features for automated algorithm selection

DOI10.1145/3450218.3477308MaRDI QIDQ5075417zbMATH OpenOpenAlexWikidataFDO

Authors Jonathan Heins, Jakob Bossek, Janina Pohl, Moritz Seiler, Heike Trautmann, Pascal Kerschke

Publication date 16 May 2022

Published in Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3450218.3477308

Mathematics Subject Classification ID

Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem
• A feature-based comparison of local search and the Christofides algorithm for the travelling salesperson problem
• A genetic distance metric to discriminate the selection of algorithms for the general ATSP problem
• Measuring instance difficulty for combinatorial optimization problems
• Reducing the Size of Travelling Salesman Problem Instances by Fixing Edges

Cited in

(1)

• A study on the effects of normalized TSP features for automated algorithm selection

This page was built for publication: On the potential of normalized TSP features for automated algorithm selection

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