Local search and the traveling salesman problem: A feature-based characterization of problem hardness

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7219 LNCS, Issue , 2012, Pages 115-129

  Mersmann, Olaf ^a   Bischl, Bernd ^a   Bossek, Jakob ^a   Trautmann, Heike ^a   Wagner, Markus ^b   Neumann, Frank ^b  

^a TU DORTMUND UNIVERSITY   (Germany)

^b UNIVERSITY OF ADELAIDE   (Australia)

Author keywords

2 opt; Classification; Feature Selection; MARS; TSP

Indexed keywords

2-OPT; APPROXIMATION RATIOS; FEATURE-BASED; LOCAL SEARCH; LOCAL SEARCH ALGORITHM; MARS; PROBLEM DIFFICULTY; STATISTICAL APPROACH; TSP;

ARTIFICIAL INTELLIGENCE; CLASSIFICATION (OF INFORMATION); FEATURE EXTRACTION;

TRAVELING SALESMAN PROBLEM;

EID: 84867884399     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-34413-8_9     Document Type: Conference Paper

References (23)

1. Applegate, D., Cook, W.J., Dash, S., Rohe, A.: Solution of a min-max vehicle routing problem. Informs Journal on Computing 14(2), 132-143 (2002)
2. Arora, S.: Polynomial time approximation schemes for euclidean traveling salesman and other geometric problems. J. ACM 45(5), 753-782 (1998)
3. Breiman, L., Friedman, J.H., Olshen, R.A., Stone, C.J.: Classification and Regression Trees. Wadsworth, Belmont (1984)
4. Chandra, B., Karloff, H.J., Tovey, C.A.: New results on the old k-Opt algorithm for the traveling salesman problem. SIAM J. Comput. 28(6), 1998-2029 (1999)
5. Croes, G.A.: A method for solving traveling-salesman problems. Operations Research 6(6), 791-812 (1958)
6. Englert, M., Röglin, H., Vöcking, B.: Worst case and probabilistic analysis of the 2-opt algorithm for the tsp: extended abstract. In: Bansal, N., Pruhs, K., Stein, C. (eds.) SODA, pp. 1295-1304. SIAM (2007)
7. Friedman, J.H.: Multivariate adaptive regression splines. Annals of Statistics 19(1), 1-67 (1991)
8. Glover, F.: Ejection chains, reference structures and alternating path methods for traveling salesman problems. Discrete Applied Mathematics 65(1-3), 223-253 (1996)
9. Johnson, D.S., McGeoch, L.A.: The traveling salesman problem: A case study in local optimization. In: Aarts, E.H.L., Lenstra, J.K. (eds.) Local Search in Combinatorial Optimization. Wiley (1997)
10. Kanda, J., Carvalho, A., Hruschka, E., Soares, C.: Selection of algorithms to solve traveling salesman problems using meta-learning. Hybrid Intelligent Systems 8, 117-128 (2011)
11. Kilby, P., Slaney, J., Walsh, T.: The backbone of the travelling salesperson. In: Proc, of the 19th International Joint Conference on Artificial intelligence, IJCAI 2005, pp. 175-180. Morgan Kaufmann Publishers Inc., San Francisco (2005)
12. Kötzing, T., Neumann, F., Röglin, H., Witt, C.: Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem. In: Dorigo, M., Birattari, M., Di Caro, G.A., Doursat, R., Engelbrecht, A.P., Floreano, D., Gambardella, L.M., Groß, R., Şahin, E., Sayama, H., Stützle, T. (eds.) ANTS 2010. LNCS, vol. 6234, pp. 324-335. Springer, Heidelberg (2010)
13. Lin, S., Kernighan, B.: An effective heuristic algorithm for the traveling salesman problem. Operations Research 21, 498-516 (1973)
14. Lin, S.: Computer solutions of the travelling salesman problem. Bell Systems Technical Journal 44(10), 2245-2269 (1965)
15. Mersmann, O., Bischl, B., Trautmann, H., Preuss, M., Weihs, C., Rudolph, G.: Exploratory landscape analysis. In: Proc. of the 13th Annual Conference on Genetic and Evolutionary Computation, GECCO 2011, pp. 829-836. ACM, New York (2011)
16. Merz, P., Freisleben, B.: Memetic algorithms for the traveling salesman problem. Complex Systems 13(4), 297-345 (2001)
17. Padberg, M., Rinaldi, G.: A branch-and-cut algorithm for the resolution of largescale symmetric traveling salesman problems. SIAMR 33(1), 60-100 (1991)
18. Reinelt, G.: Tsplib - a traveling salesman problem library. ORSA Journal on Computing 3(4), 376-384 (1991)
19. Sander, J., Ester, M., Kriegel, H., Xu, X.: Density-based clustering in spatial databases: The algorithm gdbscan and its applications. Data Mining and Knowledge Discovery 2(2), 169-194 (1998)
20. Smith-Miles, K., van Hemert, J.: Discovering the suitability of optimisation algorithms by learning from evolved instances. Annals of Mathematics and Artificial Intelligence (2011) (forthcoming)
21. Smith-Miles, K., van Hemert, J., Lim, X.Y.: Understanding TSP Difficulty by Learning from Evolved Instances. In: Blum, C., Battiti, R. (eds.) LION 4. LNCS, vol. 6073, pp. 266-280. Springer, Heidelberg (2010)
22. Stadler, P.F., Schnabl, W.: The Landscape of the Traveling Salesman Problem. Physics Letters A 161, 337-344 (1992)
23. Vazirani, V.V.: Approximation algorithms. Springer (2001)