Dancing to the State of the Art?-Reference-Cited by-同舟云学术

Dancing to the State of the Art?

Published:2024 Issue: Volume: Page:100-115
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:en
Short-container-title:

Author:

Heins Jonathan^ORCID,Schäpermeier Lennart^ORCID,Kerschke Pascal^ORCID,Whitley Darrell^ORCID

Publisher

Springer Nature Switzerland

Link

https://link.springer.com/content/pdf/10.1007/978-3-031-70055-2_7

Reference22 articles.

1. Applegate, D.L., Bixby, R.E., Chvátal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study, vol. 17. Princeton University Press, Princeton (2011)

2. Bossek, J., Kerschke, P., Neumann, A., Wagner, M., Neumann, F., Trautmann, H.: Evolving diverse TSP instances by means of novel and creative mutation operators. In: Friedrich, T., Doerr, C., Arnold, D.V. (eds.) Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms (FOGA), pp. 58–71. ACM (2019). https://doi.org/10.1145/3299904.3340307

3. Croes, G.A.: A method for solving traveling-salesman problems. Oper. Res. 6(6), 791–812 (1958). https://www.jstor.org/stable/167074

4. Dubois-Lacoste, J., Hoos, H.H., Stützle, T.: On the empirical scaling behaviour of state-of-the-art local search algorithms for the euclidean TSP. In: Silva, S., Esparcia-Alcázar, A.I. (eds.) Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), pp. 377–384. ACM (2015). https://doi.org/10.1145/2739480.2754747

5. Heins, J., Bossek, J., Pohl, J., Seiler, M., Trautmann, H., Kerschke, P.: On the potential of normalized TSP features for automated algorithm selection. In: Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms (FOGA), pp. 1–15. ACM (2021). https://doi.org/10.1145/3450218.3477308