New evaluation criteria for the convergence of continuous evolutionary algorithms

The first hitting time (FHT) plays an important role in convergence evaluation for evolutionary algorithms. However, the current criteria of the FHT are mostly under a hypothesis that never has been testified: the FHT subjects to the normal distribution. Aiming at more convincible evaluations, this paper investigates the distribution of the FHT through a goodness-of-fit test and discovers an unexpected result. Based on this result, this paper proposes a new set of criteria, which utilizes two types of relative frequency histograms. This paper validates the proposed criteria on the optimization problem of benchmark functions by the standard genetic algorithm (SGA) and the particle swarm optimization (PSO). The experiments show that the proposed criteria are effective to evaluate the convergent speed and the convergent stability of the evolutionary algorithms.

[1]  J. S. Hunter,et al.  Statistics for Experimenters: Design, Innovation, and Discovery , 2006 .

[2]  Ralf Salomon,et al.  Evolutionary algorithms and gradient search: similarities and differences , 1998, IEEE Trans. Evol. Comput..

[3]  Stephen A. McGuire,et al.  Introductory Statistics , 2007, Technometrics.

[4]  Jun Zhang,et al.  Clustering-Based Adaptive Crossover and Mutation Probabilities for Genetic Algorithms , 2007, IEEE Transactions on Evolutionary Computation.

[5]  Yue Shi,et al.  A modified particle swarm optimizer , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[6]  Tong Heng Lee,et al.  Evolutionary algorithms with dynamic population size and local exploration for multiobjective optimization , 2001, IEEE Trans. Evol. Comput..

[7]  Thomas Bäck,et al.  Evolutionary computation: comments on the history and current state , 1997, IEEE Trans. Evol. Comput..

[8]  Thomas Jansen,et al.  On the analysis of the (1+1) evolutionary algorithm , 2002, Theor. Comput. Sci..

[9]  Xin Yao,et al.  From an individual to a population: an analysis of the first hitting time of population-based evolutionary algorithms , 2002, IEEE Trans. Evol. Comput..

[10]  Yuren Zhou,et al.  A Runtime Analysis of Evolutionary Algorithms for Constrained Optimization Problems , 2007, IEEE Transactions on Evolutionary Computation.

[11]  Xin Yao,et al.  Towards an analytic framework for analysing the computation time of evolutionary algorithms , 2003, Artif. Intell..

[12]  I. Wegener,et al.  A rigorous complexity analysis of the (1+1) evolutionary algorithm for linear functions with Boolean inputs , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[13]  Luigi Fortuna,et al.  Chaotic sequences to improve the performance of evolutionary algorithms , 2003, IEEE Trans. Evol. Comput..

[14]  Shigeyoshi Tsutsui,et al.  Genetic algorithms with a robust solution searching scheme , 1997, IEEE Trans. Evol. Comput..

[15]  Josselin Garnier,et al.  Statistical distribution of the convergence time of evolutionary algorithms for long-path problems , 2000, IEEE Trans. Evol. Comput..