More Concise and Robust Linkage Learning by Filtering and Combining Linkage Hierarchies
Presented at the Benelux Conference on Artificial Intelligence
Exploiting a problem’s structure to arrive at the most efficient optimization algorithm is key in many optimization disciplines. In evolutionary computation, especially for solving discrete optimization problems from a black-box optimization (BBO) perspective, linkage learning is an important research line because if important linkages are disrupted during variation, optimization will not proceed efficiently . Estimation-of-distribution algorithms (EDAs) are well-k nown for building and using models to exploit problem structure [2, 3]. Models in EDAs represent probability distributions and linkage information is processed via probabilistic dependency relations within these distributions. Although EDAs can be very powerful, estimating complete distributions might be more than what is required to respect important linkage relations. Here, we therefore consider the class of Genepool Optimal Mixing Evolutionary Algorithms (GOMEAs) as they exploit linkage information by integrating greedy local search, genetic recombination and fitness-based selection  based on linkage models, which can typically be learned more efficiently. Recent results indicate that the use of hierarchical linkage models in GOMEAs leads to the best performance . There are, arguably, however still potential ine fficiencies. In this paper, we consider ways to filter these out. We further consider a way to combine the strengths of different linkage models.
|K.V. Hindriks , M.M. de Weerdt (Mathijs) , B. Riemsdijk , M.E. Warnier (Martijn)|
|Benelux Conference on Artificial Intelligence|
|Organisation||Intelligent and autonomous systems|
Bosman, P.A.N, & Thierens, D. (2013). More Concise and Robust Linkage Learning by Filtering and Combining Linkage Hierarchies. In K.V Hindriks, M.M de Weerdt, B Riemsdijk, & M.E Warnier (Eds.), Proceedings of BeNeLux Conference on Artificial Intelligence 2013 (pp. 295–296). TU Delft.