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...

Full description

Saved in:
Bibliographic Details
Published in2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence) pp. 2431 - 2438
Main Authors Ying Lin, Jian Huang, Jun Zhang
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.06.2008
Subjects
Artificial neural networks
Evolutionary computation
Gaussian distribution
Histograms
Optimization
Probability density function
Statistical analysis
Online AccessGet full text
ISBN1424418224
9781424418220
ISSN1089-778X
DOI10.1109/CEC.2008.4631123

Cover

More Information
Summary: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.
ISBN:1424418224
9781424418220
ISSN:1089-778X
DOI:10.1109/CEC.2008.4631123