Measuring algorithm footprints in instance space

2012 IEEE Congress on Evolutionary Computation, CEC 2012

Volumn , Issue , 2012, Pages

  Smith Miles, Kate ^a   Tan, Thomas T ^a  

^a MONASH UNIVERSITY   (Australia)

Author keywords

algorithm footprints; heuristics; instance difficulty; performance metrics; traveling salesman problem

Indexed keywords

ALGORITHM PERFORMANCE; HEURISTICS; HIGH-DIMENSIONAL FEATURE SPACE; INSTANCE DIFFICULTY; MEASURING ALGORITHM; OPTIMIZATION ALGORITHMS; PERFORMANCE BASED; PERFORMANCE METRICS; RELATIVE PERFORMANCE; RELATIVE SIZES; TEST SETS;

BENCHMARKING; TRAVELING SALESMAN PROBLEM;

ALGORITHMS;

EID: 84866870849     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2012.6252992     Document Type: Conference Paper

References (26)

1. D. H. Wolpert and W. G. Macready, "No Free Lunch Theorems for Optimization," IEEE Transactions on Evolutionary Computation, vol. 1, pp. 67-82, 1997.
2. D. Corne and A. Reynolds, "Optimisation and Generalisation: Footprints in Instance Space," Parallel Problem Solving from Nature, PPSN XI pp. 22-31, 2010.
3. J. R. Rice, "The Algorithm Selection Problem," Advances in Computing, vol. 15, pp. 65-118, 1976.
4. K. Smith-Miles and J. van Hemert, "Discovering the Suitability of Optimisation Algorithms by Learning from Evolved Instances", Annals of Mathematics and Artificial Intelligence, vol. 61, no. 2, pp. 87-104, 2011.
5. K. Smith-Miles, "Towards insightful algorithm selection for optimisation using metalearning concepts," IEEE International Joint Conference on Neural Networks, pp. 4118-4124, 2008.
6. K. Smith-Miles, R. James, J. Giffin, Y. Tu, Y, "A Knowledge Discovery Approach to Understanding Relationships between Scheduling Problem Structure and Heuristic Performance," Proceedings of the 3rd Learning and Intelligent Optimization conference, Lecture Notes in Computer Science, vol. 5851, pp. 89-103, 2009.
7. K. Smith-Miles and L. Lopes, "Generalising algorithm performance in instance space: a timetabling case study," Proceedings of the 5th Learning and Intelligent Optimization conference, Lecture Notes in Computer Science, vol. 6683, pp. 524-538, 2011.
8. K. Smith-Miles, B. Wreford, L. Lopes and N. Insani, "Predicting metaheuristic performance on graph coloring problems using data mining", in E. Talbi, Ed., Hybrid Metaheuristics, Springer Series in Computational Intelligence, in press.
9. N. Hall and M. Posner, "Performance Prediction and Preselection for Optimization and Heuristic Solution Procedures," Operations Research, vol. 55, pp. 703-716, 2007.
10. Y. Cho, J. Moore, R. Hill, and C. Reilly, "Exploiting empirical knowledge for bi-dimensional knapsack problem heuristics," International Journal of Industrial and Systems Engineering, vol. 3, pp. 530-548, 2008.
11. L. Xu, F. Hutter, H. Hoos,and K. Leyton-Brown, "SATzilla-07: The design and analysis of an algorithm portfolio for SAT," Proceedings of the 13th International Conference on Principles and Practice of Constraint Programming, Lecture Notes in Computer Science, vol. 4741, pp. 712-727, 2007.
12. K. Leyton-Brown, E. Nudelman and Y. Shoham, "Empirical hardness models: Methodology and a case study on combinatorial auctions," Journal of the ACM, vol. 56, pp. 1-52, 2009.
13. K. Smith-Miles and L. Lopes, "Measuring Instance Difficulty for Combinatorial Optimization Problems", Computers and Operations Research, vol.39, pp.875-889, May 2012.
14. A. Galton and M. Duckham, "What is the region occupied by a set of points?," GIScience, Lecture Notes in Computer Science, vol. 4197, pp. 81-98, 2006.
15. M. Duckham, L. Kulik, M. Worboys and A. Galton, "Efficient generation of simple polygons for characterizing the shape of a set of points in the plane,", Pattern Recognition, vol. 41, pp. 3224-3236, 2008.
16. D. T. Lee and B. J. Schachter. "Two algorithms for constructing a Delaunay triangulation," International Journal of Parallel Programming, vol. pp. 219-242, June 1980.
17. Concorde TSP Solver, http://www.tsp.gatech.edu/concorde.html
18. G. Reinelt, "TSPLIB - A traveling salesman problem library" INFORMS Journal in Computing, vol. 4, pp. 376-384, 1991.
19. TSPLIB, http://comopt.ifi.uni-heidelberg.de/software/TSPLIB95/
20. S. Lin and B. Kernighan, "An efficient heuristic algorithm for the traveling salesman problem," Operations Research, vol. 21, pp. 498-516, 1973.
21. D. Applegate, W. Cook, and A. Rohe. "Chained Lin-Kernighan for large traveling salesman problems," INFORMS Journal on Computing , vol. 15, pp. 82-92, 2003.
22. D. Johnson and L. McGeoch, "The traveling salesman problem: a case study," in Local Search in Combinatorial Optimization, E. Aarts and J. Lenstra, Eds. John Wiley & Sons, Inc, 1997, pp. 215-310.
23. J. Kratica, I. Ljubic, D. Tošic, "A genetic algorithm for the index selection problem. In: Raidl,G., et al. (eds.) Applications of Evolutionary Computation, vol. 2611, pp. 281-291. Springer-Verlag, 2003.
24. J. Kanda, A. Carvalho, E. Hruschka and C. Soares, "Using meta-learning to classify traveling salesman problems", 2010 Eleventh Brazilian Symposium on Neural Networks (SBRN), pp. 73-78, 2010.
25. K. Bringmann, T. Friedrich., "Approximating the volume of unions and intersections of high-dimensional geometric objects," Computational Geometry: Theory and Applications, Vol. 43, No. 6-7, pages 601-610, 2010.
26. S. Shirakawa, N. Yata, and T. Nagao, "Evolving search spaces to emphasize the performance difference of real-coded crossovers using genetic programming", 2010 IEEE Congress on Evolutionary Computation (CEC), pp. 1-8, 2010.