Mathematical modelling of UMDAc algorithm with tournament selection. Behaviour on linear and quadratic functions

This paper presents a theoretical study of the behaviour of the univariate marginal distribution algorithm for continuous domains (UMDAc) in dimension n. To this end, the algorithm with tournament selection is modelled mathematically, assuming an infinite number of tournaments. The mathematical model is then used to study the algorithm’s behaviour in the minimization of linear functions L(x)=a0+∑i=1naixi and quadratic function Q(x)=∑i=1nxi2, with x=(x1,…,xn)∈Rn and ai∈R, i=0,1,…,n. Linear functions are used to model the algorithm when far from the optimum, while quadratic function is used to analyze the algorithm when near the optimum. The analysis shows that the algorithm performs poorly in the linear function L1(x)=∑i=1nxi. In the case of quadratic function Q(x) the algorithm’s behaviour was analyzed for certain particular dimensions. After taking into account some simplifications we can conclude that when the algorithm starts near the optimum, UMDAc is able to reach it. Moreover the speed of convergence to the optimum decreases as the dimension increases.

[1]  Pedro Larrañaga,et al.  Estimation of Distribution Algorithms , 2002, Genetic Algorithms and Evolutionary Computation.

[2]  H. Mühlenbein,et al.  From Recombination of Genes to the Estimation of Distributions I. Binary Parameters , 1996, PPSN.

[3]  J. A. Lozano,et al.  Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation , 2001 .

[4]  J. A. Lozano,et al.  Analyzing the PBIL Algorithm by Means of Discrete Dynamical Systems , 2000 .

[5]  Hans-Georg Beyer,et al.  The Theory of Evolution Strategies , 2001, Natural Computing Series.

[6]  Xin Yao,et al.  Parallel Problem Solving from Nature PPSN VI , 2000, Lecture Notes in Computer Science.

[7]  A. Berny,et al.  An adaptive scheme for real function optimization acting as a selection operator , 2000, 2000 IEEE Symposium on Combinations of Evolutionary Computation and Neural Networks. Proceedings of the First IEEE Symposium on Combinations of Evolutionary Computation and Neural Networks (Cat. No.00.

[8]  Pedro Larrañaga,et al.  Optimization in Continuous Domains by Learning and Simulation of Gaussian Networks , 2000 .

[9]  Arnaud Berny.  Selection and Reinforcement Learning for Combinatorial Optimization , 2000, PPSN.

[10]  Pedro Larrañaga,et al.  Combinatonal Optimization by Learning and Simulation of Bayesian Networks , 2000, UAI.

[11]  Pedro Larrañaga,et al.  The Convergence Behavior of the PBIL Algorithm: A Preliminary Approach , 2001 .

[12]  David E. Goldberg,et al.  A Survey of Optimization by Building and Using Probabilistic Models , 2002, Comput. Optim. Appl..

[13]  Heinz Mühlenbein,et al.  The Equation for Response to Selection and Its Use for Prediction , 1997, Evolutionary Computation.

[14]  Pedro Larrañaga,et al.  Analyzing the Population Based Incremental Learning Algorithm by Means of Discrete Dynamical Systems , 2000, Complex Syst..

[15]  Heinz Mühlenbein,et al.  Schemata, Distributions and Graphical Models in Evolutionary Optimization , 1999, J. Heuristics.