Affiliation:
1. Department of Computer Science, Colorado State University, Fort Collins, CO, USA
2. Optimisation and Logistics, School of Computer Science, University of Adelaide, Adelaide, Australia
Abstract
Parameterized runtime analysis seeks to understand the influence of problem structure on algorithmic runtime. In this paper, 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 investigate the structural properties in TSP instances that influence the optimization process of evolutionary algorithms and use this information to bound their runtime. We analyze the runtime in dependence of the number of inner points k. In the first part of the paper, we study a [Formula: see text] EA in a strictly black box setting and show that it can solve the Euclidean TSP in expected time [Formula: see text] where A is a function of the minimum angle [Formula: see text] between any three points. Based on insights provided by the analysis, we improve this upper bound by introducing a mixed mutation strategy that incorporates both 2-opt moves and permutation jumps. This strategy improves the upper bound to [Formula: see text]. In the second part of the paper, we use the information gained in the analysis to incorporate domain knowledge to design two fixed-parameter tractable (FPT) evolutionary algorithms for the planar Euclidean TSP. We first develop a [Formula: see text] EA based on an analysis by M. Theile, 2009, ”Exact solutions to the traveling salesperson problem by a population-based evolutionary algorithm,” Lecture notes in computer science, Vol. 5482 (pp. 145–155), that solves the TSP with k inner points in [Formula: see text] generations with probability [Formula: see text]. We then design a [Formula: see text] EA that incorporates a dynamic programming step into the fitness evaluation. We prove that a variant of this evolutionary algorithm using 2-opt mutation solves the problem after [Formula: see text] steps in expectation with a cost of [Formula: see text] for each fitness evaluation.
Subject
Computational Mathematics
Cited by
23 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Runtime Analysis for Permutation-based Evolutionary Algorithms;Algorithmica;2023-07-26
2. A Gentle Introduction to Theory (for Non-Theoreticians);Proceedings of the Companion Conference on Genetic and Evolutionary Computation;2023-07-15
3. Fixed Parameter Multi-Objective Evolutionary Algorithms for the W-Separator Problem;Proceedings of the Genetic and Evolutionary Computation Conference;2023-07-12
4. A gentle introduction to theory (for non-theoreticians);Proceedings of the Genetic and Evolutionary Computation Conference Companion;2022-07-09
5. Towards a stronger theory for permutation-based evolutionary algorithms;Proceedings of the Genetic and Evolutionary Computation Conference;2022-07-08