On the potential of normalized TSP features for automated algorithm selection-Reference-Cited by-同舟云学术

On the potential of normalized TSP features for automated algorithm selection

Published:2021-09-06 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms
language:
Short-container-title:

Author:

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

Affiliation:

1. University of Münster, Münster, Germany

2. TU Dresden, Dresden, Germany

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3450218.3477308

Reference29 articles.

1. The Traveling Salesman Problem

2. ASlib: A benchmark library for algorithm selection

3. Jakob Bossek. 2017. salesperson: Computation of Instance Features and R Interface to the State-of-the-Art Exact and Inexact Solvers for the Traveling Salesperson Problem. https://github.com/jakobbossek/salesperson R package version 1.0.0. Jakob Bossek. 2017. salesperson: Computation of Instance Features and R Interface to the State-of-the-Art Exact and Inexact Solvers for the Traveling Salesperson Problem. https://github.com/jakobbossek/salesperson R package version 1.0.0.

4. The node weight dependent traveling salesperson problem

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

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Dancing to the State of the Art?;Lecture Notes in Computer Science;2024

2. Using Reinforcement Learning for Per-Instance Algorithm Configuration on the TSP;2023 IEEE Symposium Series on Computational Intelligence (SSCI);2023-12-05

3. Exploring the feature space of TSP instances using quality diversity;Proceedings of the Genetic and Evolutionary Computation Conference;2022-07-08