Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/90677
Citations | ||
Scopus | Web of Science® | Altmetric |
---|---|---|
?
|
?
|
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Sutton, A.M. | - |
dc.contributor.author | Neumann, F. | - |
dc.contributor.author | Nallaperuma, S. | - |
dc.date.issued | 2014 | - |
dc.identifier.citation | Evolutionary Computation, 2014; 22(4):595-628 | - |
dc.identifier.issn | 1063-6560 | - |
dc.identifier.issn | 1530-9304 | - |
dc.identifier.uri | http://hdl.handle.net/2440/90677 | - |
dc.description.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. | - |
dc.description.statementofresponsibility | Andrew M. Sutton, Frank Neumann, Samadhi Nallaperuma | - |
dc.language.iso | en | - |
dc.publisher | MIT Press | - |
dc.rights | © 2014 Massachusetts Institute of Technology | - |
dc.source.uri | http://dx.doi.org/10.1162/evco_a_00119 | - |
dc.subject | Evolutionary algorithms; runtime analysis; parameterized analysis; combinatorial optimization | - |
dc.title | Parameterized runtime analyses of evolutionary algorithms for the planar Euclidean traveling salesperson problem | - |
dc.type | Journal article | - |
dc.identifier.doi | 10.1162/EVCO_a_00119 | - |
pubs.publication-status | Published | - |
dc.identifier.orcid | Neumann, F. [0000-0002-2721-3618] | - |
Appears in Collections: | Aurora harvest 2 Computer Science publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
RA_hdl_90677.pdf Restricted Access | Restricted Access | 1.13 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.