A Mathematical Modelling Technique for the Analysis of the Dynamics of a Simple Continuous EDA

This paper presents some initial attempts to mathematically model the dynamics of a continuous estimation of distribution algorithm (EDA) based on a Gaussian distribution and truncation selection. Case studies are conducted on both unimodal and multimodal problems to highlight the effectiveness of the proposed technique and explore some important properties of the EDA. With some general assumptions, we show that, for ID unimodal problems and with the (mu, lambda) scheme: (1). The behaviour of the EDA is dependent only on the general shape of the test function, rather than its specific form; (2). When initialized far from the global optimum, the EDA has a tendency to converge prematurely; (3). Given a certain selection pressure, there is a unique value for the proposed amplification parameter that could help the EDA achieve desirable performance; for ID multimodal problems: (1). The EDA could get stuck with the (mu, lambda) scheme; (2). The EDA will never get stuck with the (mu, lambda) scheme.

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

[2]  Zbigniew Michalewicz,et al.  Handbook of Evolutionary Computation , 1997 .

[3]  Markus H ohfeld,et al.  Random keys genetic algorithm with adaptive penalty function for optimization of constrained facility layout problems , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

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

[5]  John Maynard Smith,et al.  The Theory of Evolution , 1958 .

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

[7]  Qingfu Zhang,et al.  On the convergence of a class of estimation of distribution algorithms , 2004, IEEE Transactions on Evolutionary Computation.

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

[9]  Jonathan L. Shapiro Scaling of Probability-Based Optimization Algorithms , 2002, NIPS.

[10]  Pedro Larrañaga,et al.  Mathematical modelling of UMDAc algorithm with tournament selection. Behaviour on linear and quadratic functions , 2002, Int. J. Approx. Reason..

[11]  Marcus Gallagher,et al.  On the importance of diversity maintenance in estimation of distribution algorithms , 2005, GECCO '05.

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

[13]  H. H. Newman The Theory of Evolution , 1917, Botanical Gazette.

[14]  Marcus Gallagher,et al.  Experimental results for the special session on real-parameter optimization at CEC 2005: a simple, continuous EDA , 2005, 2005 IEEE Congress on Evolutionary Computation.

[15]  Jörn Grahl,et al.  Behaviour of UMDAc algorithm with truncation selection on monotonous functions , 2005 .