Average Convergence Rate of Evolutionary Algorithms

by   Jun He, et al.

In evolutionary optimization, it is important to understand how fast evolutionary algorithms converge to the optimum per generation, or their convergence rate. This paper proposes a new measure of the convergence rate, called average convergence rate. It is a normalised geometric mean of the reduction ratio of the fitness difference per generation. The calculation of the average convergence rate is very simple and it is applicable for most evolutionary algorithms on both continuous and discrete optimization. A theoretical study of the average convergence rate is conducted for discrete optimization. Lower bounds on the average convergence rate are derived. The limit of the average convergence rate is analysed and then the asymptotic average convergence rate is proposed.


page 1

page 2

page 3

page 4


Average Convergence Rate of Evolutionary Algorithms II: Continuous Optimization

A good convergence metric must satisfy two requirements: feasible in cal...

On the convergence rate of some nonlocal energies

We study the rate of convergence of some nonlocal functionals recently c...

Improving Convergence Rate Of IC3

IC3, a well-known model checker, proves a property of a state system ξ b...

Convergence of a New Learning Algorithm

A new learning algorithm proposed by Brandt and Lin for neural network [...

Herder Ants: Ant Colony Optimization with Aphids for Discrete Event-Triggered Dynamic Optimization Problems

Currently available dynamic optimization strategies for Ant Colony Optim...

Noisy Optimization: Convergence with a Fixed Number of Resamplings

It is known that evolution strategies in continuous domains might not co...

Novel Analysis of Population Scalability in Evolutionary Algorithms

Population-based evolutionary algorithms (EAs) have been widely applied ...

Please sign up or login with your details

Forgot password? Click here to reset