Hybrid Evolution Strategies Algorithm Based on Dynamic Demes

Article Preview

Abstract:

A hybrid evolution strategies algorithm based on dynamic demes is proposed in this paper. Evolutionary strategy algorithm is likely premature, and even simulated annealing with the character of local search is impossible to escape this range, when change the population based on the maximum entropy principle so that the individual out of this range, which can quickly converge to the global optimum. The numerical computation results indicate that the algorithm can gain higher global convergence rate and higher speed

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 424-425)

Pages:

174-178

Citation:

Online since:

January 2012

Export:

Price:

[1] Schwefel,H. P. ,Back T. :Evolution Strategies I :Variants and Their Computertional Implementation. Genetic Algorithms in Engineering and Computer Science, Winter G(ed), Wiley, (1995).

Google Scholar

[2] Schwefel,H. P. ,Back T. :Evolution Strategies II:Theoretical Aspects. Genetic Algorithms in Engineering and Computer Science, Winter G(ed), Wiley, (1995).

Google Scholar

[3] Wang Z.Z., Bo,T.: Evolutionary Computation. University of Science and Technology of Defense Press, Beijing, (2000).

Google Scholar

[4] Zhou, L., Huang S.Z.: Study of Hybrid Genetic Algorithm Based on Simulated Annealing. Application Research Of Computers, 9, 72-76. (2005).

Google Scholar

[5] Ren Z.H., Wang,J.: Improved Particle Swarm Optimization Algorithm Based on Entropy. Systems Engineering. 27, 106-110, (2009).

Google Scholar