Sciweavers

GECCO
2005
Springer

Computing the epistasis variance of large-scale traveling salesman problems

14 years 6 months ago
Computing the epistasis variance of large-scale traveling salesman problems
The interaction among variables of an optimization problem is known as epistasis, and its degree is an important measure for the nonlinearity of the problem. We address the problem of enormous time complexity for computing Davidor’s epistasis variance of the traveling salesman problem (TSP). To reduce the complexity, we introduce the concept of schema-linear problem (SLP), show that TSP is a SLP, and present a relevant lemma, called Summation Rule. Using the Summation Rule, we provide a closed formula for epistasis that reduces the time complexity from O(nn ) to O(n2 ). Additionally, we propose a new more scalable measure of epistasis by a careful derivation from the original. Categories and Subject Descriptors G.m [Mathematics of Computing]: Miscellaneous General Terms Theory Keywords Epistasis, linkage, traveling salesman problem, TSP
Dong-il Seo, Byung Ro Moon
Added 27 Jun 2010
Updated 27 Jun 2010
Type Conference
Year 2005
Where GECCO
Authors Dong-il Seo, Byung Ro Moon
Comments (0)