On Measures to Build Linkage Trees in LTGA

For an evolutionary algorithm (EA) to be efficiently scalable, variation must be linkage friendly. For this reason many EAs have been introduced that build and exploit linkage models, amongst which are estimation-of-distribution algorithms (EDAs). Although various models have been empirically evaluated, it remains of key importance to better understand the conditions under which model building is successful. In this paper, we consider the linkage tree genetic algorithm (LTGA). LTGA is a recent powerful linkage-learning EA that builds a hierarchical linkage model known as the linkage tree (LT). LTGA exploits this model using an intensive mixing procedure aimed at optimally exchanging building blocks. Empirical evaluation studies of LTGA have appeared in literature using different entropy-based measures for building the LT, but with comparable results. We study the differences in these measures to better understand the requirements for detecting important linkage information and point out why some measures are more successful than others.

[1]  Dirk Thierens,et al.  Optimal mixing evolutionary algorithms , 2011, GECCO '11.

[2]  Dirk Thierens,et al.  The Linkage Tree Genetic Algorithm , 2010, PPSN.

[3]  Kalyanmoy Deb,et al.  Sufficient conditions for deceptive and easy binary functions , 1994, Annals of Mathematics and Artificial Intelligence.

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

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

[6]  Kumara Sastry,et al.  Linkage Learning via Probabilistic Modeling in the Extended Compact Genetic Algorithm (ECGA) , 2006, Scalable Optimization via Probabilistic Modeling.

[7]  Yaochu Jin,et al.  Knowledge incorporation in evolutionary computation , 2005 .

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

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

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

[11]  Alexander Kraskov,et al.  MIC: Mutual Information Based Hierarchical Clustering , 2008, 0809.1605.

[12]  Robert Schaefer Parallel Problem Solving from Nature - PPSN XI, 11th International Conference, Kraków, Poland, September 11-15, 2010. Proceedings, Part II , 2010, PPSN.

[13]  Dirk Thierens,et al.  Pairwise and problem-specific distance metrics in the linkage tree genetic algorithm , 2011, GECCO '11.