Pairwise and problem-specific distance metrics in the linkage tree genetic algorithm

  • Authors:
  • Martin Pelikan;Mark W. Hauschild;Dirk Thierens

  • Affiliations:
  • University of Missouri in St. Louis, St. Louis, MO, USA;University of Missouri in St. Louis, St. Louis, MO, USA;Utrecht University, Utrecht, Netherlands

  • Venue:
  • Proceedings of the 13th annual conference on Genetic and evolutionary computation
  • Year:
  • 2011

Quantified Score

Hi-index 0.01

Visualization

Abstract

The linkage tree genetic algorithm (LTGA) identifies linkages between problem variables using an agglomerative hierarchical clustering algorithm and linkage trees. This enables LTGA to solve many decomposable problems that are difficult with more conventional genetic algorithms. The goal of this paper is two-fold: (1) Present a thorough empirical evaluation of LTGA on a large set of problem instances of additively decomposable problems and (2) speed up the clustering algorithm used to build the linkage trees in LTGA by using a pairwise and a problem-specific metric.