More concise and robust linkage learning by filtering and combining linkage hierarchies

Genepool Optimal Mixing Evolutionary Algorithms (GOMEAs) were recently proposed as a new way of designing linkage-friendly, efficiently-scalable evolutionary algorithms (EAs). GOMEAs combine the building of linkage models with an intensive, greedy mixing procedure. Recent results indicate that the use of hierarchical linkage models in GOMEAs lead to the most robust and efficient performance. Two of such GOMEA instances are the Linkage Tree Genetic Algorithm (LTGA) and the Multi-scale Linkage Neighbors Genetic Algorithm (MLNGA). The linkage models in these GOMEAs have their individual merits and drawbacks. In this paper, we propose enhancement techniques targeted at filtering out superfluous linkage sets from hierarchical linkage models and we consider a way to construct a linkage model that combines the strengths of different linkage models. We then propose a new GOMEA instance, called the Linkage Trees and Neighbors Genetic Algorithm (LTNGA), that combines the models of LTGA and MLNGA. LTNGA performs comparable or better than the best of either LTGA or MLNGA on various problems, including typical linkage benchmark problems and instances of the well-known combinatorial problem MAXCUT, especially when the proposed filtering techniques are used.

[1]  Dirk Thierens,et al.  Mixing in Genetic Algorithms , 1993, ICGA.

[2]  Pedro Larrañaga,et al.  Towards a New Evolutionary Computation - Advances in the Estimation of Distribution Algorithms , 2006, Towards a New Evolutionary Computation.

[3]  Reuven Y. Rubinstein,et al.  Cross-entropy and rare events for maximal cut and partition problems , 2002, TOMC.

[4]  Franz Rendl,et al.  Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations , 2009, Math. Program..

[5]  Xu Ye,et al.  Advances in estimation of distribution algorithms , 2012 .

[6]  Dirk Thierens,et al.  Benchmarking Parameter-Free AMaLGaM on Functions With and Without Noise , 2013, Evolutionary Computation.

[7]  Shlomo Moran,et al.  Optimal implementations of UPGMA and other common clustering algorithms , 2007, Inf. Process. Lett..

[8]  F. J. Richards A Flexible Growth Function for Empirical Use , 1959 .

[9]  Dirk Thierens,et al.  Linkage neighbors, optimal mixing and forced improvements in genetic algorithms , 2012, GECCO '12.

[10]  Martin V. Butz,et al.  Performance of evolutionary algorithms on NK landscapes with nearest neighbor interactions and tunable overlap , 2009, GECCO '09.

[11]  J. A. Lozano,et al.  Towards a New Evolutionary Computation: Advances on Estimation of Distribution Algorithms (Studies in Fuzziness and Soft Computing) , 2006 .

[12]  Martin Pelikan,et al.  Scalable Optimization via Probabilistic Modeling: From Algorithms to Applications (Studies in Computational Intelligence) , 2006 .