Understanding TSP difficulty by learning from evolved instances

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

Volumn 6073 LNCS, Issue , 2010, Pages 266-280

  Smith Miles, Kate ^a   Van Hemert, Jano ^b   Lim, Xin Yu ^a,c  

^a MONASH UNIVERSITY   (Australia)

^b UNIVERSITY OF EDINBURGH   (United Kingdom)

^c UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

Algorithm Selection; Combinatorial optimisation; Hardness Prediction; Instance Difficulty; Phase Transition; Travelling Salesman Problem

Indexed keywords

ALGORITHM PERFORMANCE; ALGORITHM SELECTION; COMBINATORIAL OPTIMISATION; GENERATION METHOD; HARDNESS PREDICTION; IS PERFORMANCE; PERFORMANCE PREDICTION; TRAVELLING SALESMAN PROBLEM;

COMBINATORIAL OPTIMIZATION; EVOLUTIONARY ALGORITHMS; FORECASTING; HARDNESS;

PHASE TRANSITIONS;

EID: 77954569885     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13800-3_29     Document Type: Conference Paper

References (40)

1. Macready, W., Wolpert, D.: What makes an optimization problem hard. Complexity 5, 40-46 (1996)
2. Nudelman, E., Leyton-Brown, K., Hoos, H., Devkar, A., Shoham, Y.: Understanding random SAT: Beyond the clauses-to-variables ratio. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 438-452. Springer, Heidelberg (2004)
3. Xu, L., Hutter, F., Hoos, H., Leyton-Brown, K.: SATzilla-07: The design and analysis of an algorithm portfolio for SAT. In: Bessière, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 712-727. Springer, Heidelberg (2007)
4. Cho, Y., Moore, J., Hill, R., Reilly, C.: Exploiting empirical knowledge for bidimensional knapsack problem heuristics. International Journal of Industrial and Systems Engineering 3(5), 530-548 (2008) (Pubitemid 351728708)
5. Hall, N., Posner, M.: Performance Prediction and Preselection for Optimization and Heuristic Solution Procedures. Operations Research 55(4), 703 (2007)
6. Smith-Miles, K.: Towards insightful algorithm selection for optimisation using meta-learning concepts. In: IEEE International Joint Conference on Neural Networks, IJCNN 2008. IEEE World Congress on Computational Intelligence, pp. 4118-4124 (2008)
7. Smith-Miles, K., James, R., Giffin, J., Tu, Y.: Understanding the Relationship between Scheduling Problem Structure and Heuristic Performance using Knowledge Discovery, LNCS. Springer, Heidelberg (in press, 2009)
8. Rice, J.: The Algorithm Selection Problem. Advances in computers 65 (1976)
9. van Hemert, J.: Evolving combinatorial problem instances that are difficult to solve. Evolutionary Computation 14(4), 433-462 (2006)
10. Gras, R.: How efficient are genetic algorithms to solve high epistasis deceptive problems? In: IEEE Congress on Evolutionary Computation, CEC 2008. IEEE World Congress on Computational Intelligence, pp. 242-249 (2008)
11. Locatelli, M., Wood, G.: Objective Function Features Providing Barriers to Rapid Global Optimization. Journal of Global Optimization 31(4), 549-565 (2005) (Pubitemid 40963398)
12. Xin, B., Chen, J., Pan, F.: Problem difficulty analysis for particle swarm optimization: deception and modality. In: Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation, pp. 623-630 (2009)
13. Bachelet, V.: Métaheuristiques parallèles hybrides: application au problème d'affectation quadratique. PhD thesis, Universite des Sciences et Technologies de Lille (1999)
14. Reeves, C.: Landscapes, operators and heuristic search. Annals of Operations Research 86, 473-490 (1999)
15. Schiavinotto, T., Stützle, T.: A review of metrics on permutations for search landscape analysis. Comput. Oper. Res. 34(10), 3143-3153 (2007)
16. Smith-Miles, K.A., Lopes, L.B.: Measuring Combinatorial Optimization Problem Difficulty for Algorithm Selection. Annals of Mathematics and Artificial Intelligence (under review, 2009)
17. Pfahringer, B., Bensusan, H., Giraud-Carrier, C.: Meta-learning by landmarking various learning algorithms. In: Proceedings of the Seventeenth International Conference on Machine Learning table of contents, pp. 743-750. Morgan Kaufmann Publishers Inc., San Francisco (2000)
18. Burke, E., Kendall, G., Newall, J., Hart, E., Ross, P., Schulenburg, S.: Hyperheuristics: An emerging direction in modern search technology. International Series in Operations Research and Management Science, pp. 457-474 (2003)
19. Battiti, R.: Using mutual information for selecting features in supervised neural net learning. IEEE Transactions on neural networks 5(4), 537-550 (1994)
20. Vasconcelos, N.: Feature selection by maximum marginal diversity: optimality and implications for visual recognition. In: Proceedings of 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, vol. 1 (2003)
21. Cheeseman, P., Kanefsky, B., Taylor, W.: Where the really hard problems are. In: Proceedings of the 12th IJCAI, pp. 331-337 (1991)
22. Ridge, E., Kudenko, D.: An Analysis of Problem Difficulty for a Class of Optimisation Heuristics. In: Cotta, C., van Hemert, J. (eds.) EvoCOP 2007. LNCS, vol. 4446, pp. 198-209. Springer, Heidelberg (2007)
23. Zhang, W., Korf, R.: A study of complexity transitions on the asymmetric traveling salesman problem. Artificial Intelligence 81(1-2), 223-239 (1996) (Pubitemid 126349556)
24. Zhang, W.: Phase transitions and backbones of the asymmetric traveling salesman problem. Journal of Artificial Intelligence Research 21, 471-497 (2004)
25. Gent, I., Walsh, T.: The TSP phase transition. Artificial Intelligence 88(1-2), 349-358 (1996)
26. Thiebaux, S., Slaney, J., Kilby, P.: Estimating the hardness of optimisation. In: ECAI, pp. 123-130 (2000)
27. Gaertner, D., Clark, K.: On optimal parameters for ant colony optimization algorithms. In: Proceedings of the 2005 International Conference on Artificial Intelligence, Citeseer, vol. 1, pp. 83-89 (2005)
28. Stadler, P., Schnabl, W.: The landscape of the traveling salesman problem. Phys. Lett. A 161(4), 337-344 (1992)
29. Kilby, P., Slaney, J., Walsh, T.: The backbone of the travelling salesperson. In: International Joint Conference on Artificial Intelligence, vol. 19, p. 175 (2005)
30. Lin, S., Kernighan, B.: An efficient heuristic algorithm for the traveling salesman problem. Operations Research 21(2) (1973)
31. van Hemert, J.: Property analysis of symmetric travelling salesman problem instances acquired through evolution. In: Raidl, G.R., Gottlieb, J. (eds.) EvoCOP 2005. LNCS, vol. 3448, pp. 122-131. Springer, Heidelberg (2005)
32. van Hemert, J., Urquhart, N.: Phase transition properties of clustered travelling salesman problem instances generated with evolutionary computation. In: Yao, X., Burke, E.K., Lozano, J.A., Smith, J., Merelo-Guervós, J.J., Bullinaria, J.A., Rowe, J.E., Tiňo, P., Kabán, A., Schwefel, H.-P. (eds.) PPSN 2004. LNCS, vol. 3242, pp. 151-160. Springer, Heidelberg (2004)
33. van Hemert, J.: Property analysis of symmetric travelling salesman problem instances acquired through evolution. In: Raidl, G.R., Gottlieb, J. (eds.) EvoCOP 2005. LNCS, vol. 3448, pp. 122-131. Springer, Heidelberg (2005)
34. Kratica, J., Ljubić, I., Tošic, D.: A genetic algorithm for the index selection problem. In: Raidl, G.R., Cagnoni, S., Cardalda, J.J.R., Corne, D.W., Gottlieb, J., Guillot, A., Hart, E., Johnson, C.G., Marchiori, E., Meyer, J.-A., Middendorf, M. (eds.) EvoIASP 2003, EvoWorkshops 2003, EvoSTIM 2003, EvoROB/EvoRobot 2003, EvoCOP 2003, EvoBIO 2003, and EvoMUSART 2003. LNCS, vol. 2611, pp. 281-291. Springer, Heidelberg (2003)
35. Lin, S., Kernighan, B.: An effective heuristic algorithm for the traveling salesman problem. Operations Research 21, 498-516 (1973)
36. Applegate, D., Cook, W., Rohe, A.: Chained lin-kernighan for large travelling salesman problems (2000), http://www.citeseer.com/applegate99chained. html
37. Johnson, D., McGeoch, L.: The traveling salesman problem: a case study. In: Aarts, E., Lenstra, J. (eds.) Local Search in Combinatorial Optimization, pp. 215-310. John Wiley & Sons, Inc., Chichester (1997)
38. 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)
39. Kohonen, T.: Self-organization maps. Proc. IEEE 78, 1464-1480 (1990)
40. SOMine, V.: Enterprise Edition Version 3.0, Eudaptics Software Gmbh (1999)