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

@article{Sutton2012APR,
  title={A Parameterized Runtime Analysis of Evolutionary Algorithms for the Euclidean Traveling Salesperson Problem},
  author={Andrew M. Sutton and Frank Neumann},
  journal={CoRR},
  year={2012},
  volume={abs/1207.0578}
}
We contribute to the theoretical understanding of evolutionary algorithms and carry out a parameterized analysis of evolutionary algorithms for the Euclidean traveling salesperson problem (Euclidean TSP). We exploit structural properties related to the optimization process of evolutionary algorithms for this problem and use them to bound the runtime of evolutionary algorithms. Our analysis studies the runtime in dependence of the number of inner points k and shows that simple evolutionary… CONTINUE READING
Highly Cited
This paper has 22 citations. REVIEW CITATIONS
Related Discussions
This paper has been referenced on Twitter 2 times. VIEW TWEETS

Citations

Publications citing this paper.
Showing 1-10 of 15 extracted citations

Fixed-parameter evolutionary algorithms for the Euclidean Traveling Salesperson problem

2013 IEEE Congress on Evolutionary Computation • 2013
View 5 Excerpts
Highly Influenced

On sampling-and-classification optimization in discrete domains

2016 IEEE Congress on Evolutionary Computation (CEC) • 2016

References

Publications referenced by this paper.
Showing 1-10 of 41 references

A parameterized runtime analysis of evolutionary algorithms for the Euclidean traveling salesperson problem

Andrew M. Sutton, Frank Neumann.
2012