The Linkage Tree Genetic Algorithm

  title={The Linkage Tree Genetic Algorithm},
  author={D. Thierens},
  • D. Thierens
  • Published in PPSN 2010
  • Computer Science
  • We introduce the Linkage Tree Genetic Algorithm (LTGA), a competent genetic algorithm that learns the linkage between the problem variables. The LTGA builds each generation a linkage tree using a hierarchical clustering algorithm. To generate new offspring solutions, the LTGA selects two parent solutions and traverses the linkage tree starting from the root. At each branching point, the parent pair is recombined using a crossover mask defined by the clustering at that particular tree node. The… CONTINUE READING
    Linkage tree genetic algorithms: variants and analysis
    • 16
    • Highly Influenced
    • PDF
    Pairwise and problem-specific distance metrics in the linkage tree genetic algorithm
    • 23
    • PDF
    Predetermined versus learned linkage models
    • 8
    • PDF
    Optimal mixing evolutionary algorithms
    • 77
    • PDF
    On the performance of linkage-tree genetic algorithms for the multidimensional knapsack problem
    • 21
    • Highly Influenced
    • PDF
    On the usefulness of linkage processing for solving MAX-SAT
    • 14
    • PDF
    Partition Crossover for Pseudo-Boolean Optimization
    • 33


    Publications referenced by this paper.
    The Design of Innovation: Lessons from and for Competent Genetic Algorithms
    • 1,000
    • PDF
    Linkage in Evolutionary Computation
    • 19
    CrossNet: a framework for crossover with network-based chromosomal representations
    • 11
    • PDF
    Network crossover performance on NK landscapes and deceptive problems
    • 11
    • PDF
    Hierarchical Clustering Using Mutual Information
    • 194
    • PDF
    Analyzing Deception in Trap Functions
    • 381
    Conquering hierarchical difficulty by explicit chunking: substructural chromosome compression
    • 30
    • PDF