A Parameterized Runtime Analysis of Evolutionary Algorithms for the Euclidean Traveling Salesperson Problem

Proceedings of the 26th AAAI Conference on Artificial Intelligence, AAAI 2012

Volumn , Issue , 2012, Pages 1105-1111

  Sutton, Andrew M ^a   Neumann, Frank ^a  

^a UNIVERSITY OF ADELAIDE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; OPTIMIZATION; PARAMETER ESTIMATION;

EUCLIDEAN; EXPECTED TIME; GEOMETRIC CONSTRAINT; PARAMETERIZED; RANDOMIZED LOCAL SEARCH; RUNTIME ANALYSIS OF EVOLUTIONARY ALGORITHMS; RUNTIMES; SIMPLE++; TRAVELING SALESPERSON PROBLEM;

EVOLUTIONARY ALGORITHMS;

EID: 85077460037     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. Baswana, S.; Biswas, S.; Doerr, B.; Friedrich, T.; Kurur, P. P.; and Neumann, F. 2009. Computing single source shortest paths using single-objective fitness functions. In Jansen, T.; Garibay, I.; Wiegand, R. P.; and Wu, A. S., eds., Proceedings of the Tenth International Workshop on Foundations of Genetic Algorithms (FOGA 2009), 59-66. Orlando, USA: ACM Press.
2. de Berg, M.; Cheong, O.; van Kreveld, M.; and Overmars, M. 2008. Computational Geometry: Algorithms and Applications. Springer, third edition.
3. Deĭneko, V. G.; Hoffman, M.; Okamoto, Y.; and Woeginger, G. J. 2006. The traveling salesman problem with few inner points. Operations Research Letters 34:106-110.
4. Doerr, B.; Happ, E.; and Klein, C. 2007. A tight analysis of the (1+1)-EA for the single source shortest path problem. In Proceedings of the IEEE Congress on Evolutionary Computation (CEC'07), 1890-1895. IEEE Press.
5. Dorigo, M., and Stützle, T. 2004. Ant Colony Optimization. MIT Press.
6. Downey, R. G., and Fellows, M. R. 1999. Parameterized Complexity. Springer.
7. Droste, S.; Jansen, T.; and Wegener, I. 2002. On the analysis of the (1+1) evolutionary algorithm. Theoretical Computer Science 276:51-81.
8. Eiben, A., and Smith, J. 2007. Introduction to Evolutionary Computing. Springer.
9. Englert, M.; Röglin, H.; and Vöcking, B. 2007. Worst case and probabilistic analysis of the 2-opt algorithm for the TSP. In Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1295-1304. Society for Industrial and Applied Mathematics.
10. Flum, J., and Grohe, M. 2006. Parameterized complexity theory. Springer-Verlag.
11. Friedrich, T.; He, J.; Hebbinghaus, N.; Neumann, F.; and Witt, C. 2009. Analyses of simple hybrid evolutionary algorithms for the vertex cover problem. Evolutionary Computation 17(1):3-20.
12. Friedrich, T.; He, J.; Hebbinghaus, N.; Neumann, F.; and Witt, C. 2010. Approximating covering problems by randomized search heuristics using multi-objective models. Evolutionary Computation 18(4):617-633.
13. He, J., and Yao, X. 2001. Drift analysis and average time complexity of evolutionary algorithms. Artificial Intelligence 127(1):57-85.
14. He, J., and Yao, X. 2003. Towards an analytic framework for analysing the computation time of evolutionary algorithms. Artificial Intelligence 145(1-2):59-97.
15. Kratsch, S., and Neumann, F. 2009. Fixed-parameter evolutionary algorithms and the vertex cover problem. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO'09), 293-300. ACM Press.
16. Kratsch, S.; Lehre, P. K.; Neumann, F.; and Oliveto, P. S. 2010. Fixed parameter evolutionary algorithms and maximum leaf spanning trees: A matter of mutation. In Schaefer, R.; Cotta, C.; Kolodziej, J.; and Rudolph, G., eds., Proceedings of the Eleventh Conference on Parallel Problem Solving from Nature, volume 6238 of Lecture Notes in Computer Science, 204-213. Springer.
17. Neumann, F., and Wegener, I. 2006. Minimum spanning trees made easier via multi-objective optimization. Natural Computing 5(3):305-319.
18. Neumann, F., and Wegener, I. 2007. Randomized local search, evolutionary algorithms, and the minimum spanning tree problem. Theoretical Computer Science 378(1):32-40.
19. Neumann, F., and Witt, C. 2010. Bioinspired Computation in Combinatorial Optimization - Algorithms and Their Computational Complexity. Springer.
20. Neumann, F. 2007. Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem. European Journal of Operational Research 181(3):1620-1629.
21. Oliveto, P. S.; He, J.; and Yao, X. 2009. Analysis of the (1+1) -ea for finding approximate solutions to vertex cover problems. IEEE Transactions on Evolutionary Computation 13(5):1006-1029.
22. Quintas, L. V., and Supnick, F. 1965. On some properties of shortest hamiltonian circuits. The American Mathematical Monthly 72(9):977-980.
23. Scharnow, J.; Tinnefeld, K.; and Wegener, I. 2004. The analysis of evolutionary algorithms on sorting and shortest paths problems. Journal of Mathematical Modelling and Algorithms 349-366.
24. Witt, C. 2005. Worst-case and average-case approximations by simple randomized search heuristics. In Proceedings of the Twenty-Second Symposium on Theoretical Aspects of Computer Science (STACS'05), volume 3404 of Lecture Notes on Computer Science, 44-56. Springer.
25. Yu, Y., and Zhou, Z.-H. 2006. A new approach to estimating the expected first hitting time of evolutionary algorithms. In Proceedings of the Twenty-First Conference on Artificial Intelligence (AAAI 2006). AAAI Press.