Strong Convergence (a.s.)of Global Annealing Genetic Algorithm
Zhou Guo · Mathematica Applicata · 2003
This paper analyzes the strong convergence (a.s.)of Global Annealing Genetic Algorithm (GAGA) in terms of submartingale analysis.The results show that ∑∞n=1 e -δ/T n +∞ is the condition that GAGA strongly converges (a.s.) to the global optimum,and the convergence rate of GAGA is o1N+N 0+(2- N 0 n- N 0 n) e (Δ-δ)/T n .