Evolving diverse TSP instances by means of novel and creative mutation operators

DOI10.1145/3299904.3340307zbMATH Open1433.90128OpenAlexW2948946638MaRDI QIDQ5215480FDOQ5215480

Heike Trautmann, F. Neumann, Markus Wagner, Jakob Bossek, Pascal Kerschke, Aneta Neumann

Publication date: 11 February 2020

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

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

zbMATH Keywords

optimizationbenchmarkingtraveling salesperson problemproblem generationinstance features

Mathematics Subject Classification ID

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

Cited In (3)

• Evolving test instances of the Hamiltonian completion problem
• Selecting fast algorithms for the capacitated vehicle routing problem with machine learning techniques
• A study on the effects of normalized TSP features for automated algorithm selection

This page was built for publication: Evolving diverse TSP instances by means of novel and creative mutation operators

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