Linkage tree genetic algorithms: variants and analysis

Authors:
Brian W. Goldman;Daniel R. Tauritz
Affiliations:
Missouri University of Science and Technology, Rolla, MO, USA;Missouri University of Science and Technology, Rolla, MO, USA
Venue:
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Year:
2012

Citing 6
Cited 1

Linkage tree genetic algorithm: first results

Proceedings of the 12th annual conference companion on Genetic and evolutionary computation
The linkage tree genetic algorithm

PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Optimal mixing evolutionary algorithms

Proceedings of the 13th annual conference on Genetic and evolutionary computation
Pairwise and problem-specific distance metrics in the linkage tree genetic algorithm

Proceedings of the 13th annual conference on Genetic and evolutionary computation
The roles of local search, model building and optimal mixing in evolutionary algorithms from a bbo perspective

Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
The computational complexity of N-K fitness functions

IEEE Transactions on Evolutionary Computation

The influence of linkage-learning in the linkage-tree GA when solving multidimensional knapsack problems

Proceedings of the 15th annual conference on Genetic and evolutionary computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Discovering and exploiting the linkage between genes during evolutionary search allows the Linkage Tree Genetic Algorithm (LTGA) to maximize crossover effectiveness, greatly reducing both population size and total number of evaluations required to reach success on decomposable problems. This paper presents a comparative analysis of the most prominent LTGA variants and a newly introduced variant. While the deceptive trap problem (Trap-k) is one of the canonical benchmarks for testing LTGA, when LTGA is combined with applying steepest ascent hill climbing to the initial population, as is done in all significant LTGA variations, trap-k is trivially solved. This paper introduces the deceptive step trap problem (StepTrap-k,s), which shows the novel combination of smallest first subtree ordering with global mixing (LTS-GOMEA) is effective for black box optimization, while least linked first subtree ordering (LT-GOMEA) is effective on problems where partial reevaluation is possible. Finally, nearest neighbor NK landscapes show that global mixing is not effective on problems with complex overlapping linkage structure that cannot be modeled correctly by a linkage tree, emphasizing the need to extend how LTGA stores linkage to allow the power of global mixing to be applied to these types of problems.