D. L. Applegate, R. E. Bixby, V. Chvátal, and W. J. Cook, The Traveling Salesman Problem: A Computational Study, 2007.

K. Helsgaun, Effective implementation of the Lin-Kernighan traveling salesman heuristic, Eur. J. Oper. Res, vol.126, issue.1, pp.106-130, 2000.

K. Helsgaun, An effective implementation of k-opt moves for the lin-kernighan tsp heuristic, 2007.

Y. Nagata and S. Kobayashi, A powerful genetic algorithm using edge assembly crossover for the traveling salesman problem, INFORMS J. Comput, vol.25, issue.2, pp.346-363, 2013.

D. Whitley, D. Hains, and A. Howe, A hybrid genetic algorithm for the traveling salesman problem using generalized partition crossover, PPSN XI, vol.6238, pp.566-575, 2010.

D. W. Corne and A. P. Reynolds, Optimisation and generalisation: Footprints in instance space, PPSN XI, vol.6238, pp.22-31, 2010.

K. Smith-miles and L. Lopes, Measuring instance difficulty for combinatorial optimization problems, Comput. Oper. Res, vol.39, issue.5, pp.875-889, 2012.

J. Pihera and N. Musliu, Application of machine learning to algorithm selection for TSP, IEEE 26th International Conference on Tools with Artificial Intelligence, pp.47-54, 2014.

L. Kotthoff, P. Kerschke, H. Hoos, and H. Trautmann, Improving the state of the art in inexact tsp solving using per-instance algorithm selection. In: Learning and Intelligent Optimization, pp.202-217, 2015.

P. Kerschke, L. Kotthoff, J. Bossek, and H. H. Hoos, Leveraging tsp solver complementarity through machine learning, Evol. Comput, vol.26, issue.4, pp.597-620, 2018.

J. Bossek, netgen: Network Generator for Combinatorial Graph Problems, 2016.

. R-core-team, R: A Language and Environment for Statistical Computing, 2018.

O. Mersmann, B. Bischl, H. Trautmann, M. Wagner, J. Bossek et al., A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem, Ann. Math. Artif. Intell, vol.69, issue.2, pp.151-182, 2013.

G. Reinelt, Tsplib-a traveling salesman problem library, ORSA Journal on Computing, vol.3, issue.4, pp.376-384, 1991.

A. Rohe, VLSI data sets, 2017.

R. Tinós, K. Helsgaun, and D. Whitley, Efficient recombination in the Lin-KernighanHelsgaun traveling salesman heuristic, PPSN XV, pp.95-107, 2018.

S. Lin and B. W. Kernighan, An Effective Heuristic Algorithm for the TravelingSalesman Problem, Operations Research, vol.21, pp.498-516, 1973.

Y. Nagata and S. Kobayashi, Edge assembly crossover: A high-power genetic algorithm for the Travelling Salesman Problem, ICGA. pp, pp.450-457, 1997.

D. Applegate, R. Bixby, V. Chvátal, and W. Cook, Concorde TSP solver, 2003.

D. H. Wolpert and W. G. Macready, No free lunch theorems for optimization, IEEE Trans. Evol. Comput, vol.1, issue.1, pp.67-82, 1997.

B. Bischl, O. Mersmann, H. Trautmann, and M. Preuß, Algorithm selection based on exploratory landscape analysis and cost-sensitive learning, p.313, 2012.