Research on Chaos Theory Improved Evolutionary Algorithm

Article Preview

Abstract:

Because the basic evolutionary algorithm convergence speed is slow, prone to stagnation, the algorithm running time is too long, so according to chaos theory about the relationship between evolution and chaos, this paper design an improved evolutionary algorithm with chaotic mutation operator, the optimization of the contraction policy can improve the global search ability of effective, significantly improved the performance of the proposed algorithm.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 926-930)

Pages:

3463-3466

Citation:

Online since:

May 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Fogel D B: An introduction to simulated evolutionary optimization. IEEE Trans on Neural Network, vol. 5 (1994), No. 1, pp.3-14.

Google Scholar

[2] Wei C J, Yao S S, He Z Y: A modified evolutionary programming . I n: Pro c 1996 IEEE Int Conf on Evolutionary Computation. NJ: IEEE Press, 1996. 135-138.

Google Scholar

[3] Rudolph G. Local convergence rates of simple evolutionary algorithm s with Cauchy mutations. IEEE Trans on Evolutionary Computation, Vol. 1 (1997) No. 4, pp.249-258.

DOI: 10.1109/4235.687885

Google Scholar

[4] Chellapilla K. Combining mutation operators in evolutionary programming. IEEE Trans on Evolutionary Computation, Vol. 2 (1998), No. 3, pp.91-96.

DOI: 10.1109/4235.735431

Google Scholar

[5] Michalew icz Z. Genetic algorithms + Data structures=Evolution programs. 2nd Edition. New York: Springer-Verlag, (1994).

Google Scholar