Dirk Thierens
ABSTRACT
A key search mechanism in Evolutionary Algorithms is the mixing or juxtaposing of partial solutions present in the parent solutions. In this paper we look at the efficiency of mixing in genetic algorithms (GAs) and estimation-of-distribution algorithms (EDAs). We compute the mixing probabilities of two partial solutions and discuss the effect of the covariance build-up in GAs and EDas. Moreover, we propose two new Evolutionary Algorithms that maximize the juxtaposing of the partial solutions present in the parents: the Recombinative Optimal Mixing Evolutionary Algorithm (ROMEA) and the Gene-pool Optimal Mixing Evolutionary Algorithm (GOMEA).
- G. R. Harik, F. G. Lobo, and K. Sastry. Linkage learning via probabilistic modeling in the extended compact genetic algorithm. In M. Pelikan et al., Scalable Optimization via Probabilistic Modeling: From Algorithms to Applications, pages 39--61. Springer-Verlag, Berlin, 2006.Google Scholar
- M. Pelikan, M. Hauschild, and D. Thierens. Pairwise and problem-specific distance metrics in the linkage tree genetic algorithm. In Proc. of the Genetic and Evolutionary Computation Conference (GECCO--2011). ACM Press. Google ScholarDigital Library
- M. Pelikan, K. Sastry, and E. Cantú-Paz. Scalable Optimization via Probabilistic Modeling: From Algorithms to Applications. Springer-Verlag, Berlin, 2006. Google ScholarDigital Library
- M. Pelikan, K. Sastry, D. E. Goldberg, M. V. Butz, and M. Hauschild. Performance of evolutionary algorithms on NK landscapes with nearest neighbor interactions and tunable overlap. In Proc. of the Genetic and Evolutionary Computation Conference (GECCO--2009), pages 851--858. ACM Press, 2009. Google ScholarDigital Library
- D. Thierens. The linkage tree genetic algorithm. In Proc. of Parallel Problem Solving from Nature (PPSN XI), pages 264--273, Springer, 2010. Google ScholarDigital Library
- D. Thierens and D. E. Goldberg. Convergence models of genetic algorithm selection schemes. In Proc. of Parallel Problem Solving from Nature (PPSN III), pages. 119--129. Springer, 1994. Google ScholarDigital Library
Index Terms
- Optimal mixing evolutionary algorithms
Recommendations
Multi-objective gene-pool optimal mixing evolutionary algorithms
GECCO '14: Proceedings of the 2014 Annual Conference on Genetic and Evolutionary ComputationThe recently introduced Gene-pool Optimal Mixing Evolutionary Algorithm (GOMEA), with a lean, but sufficient, linkage model and an efficient variation operator, has been shown to be a robust and efficient methodology for solving single objective (SO) ...
Linkage neighbors, optimal mixing and forced improvements in genetic algorithms
GECCO '12: Proceedings of the 14th annual conference on Genetic and evolutionary computationRecently, the Linkage Tree Genetic Algorithm (LTGA) was introduced as one of the latest developments in a line of EA research that studies building models to capture and exploit linkage information between problem variables. LTGA was reported to exhibit ...
Expanding from Discrete Cartesian to Permutation Gene-pool Optimal Mixing Evolutionary Algorithms
GECCO '16: Proceedings of the Genetic and Evolutionary Computation Conference 2016The recently introduced Gene-pool Optimal Mixing Evolutionary Algorithm (GOMEA) family, which includes the Linkage Tree Genetic Algorithm (LTGA), has been shown to scale excellently on a variety of discrete, Cartesian-space, optimization problems. This ...
Comments