Mean Evolutionary Algorithm Based on Intermediate Value Theorem of Continuous Function

Article Preview

Abstract:

A new Evolutionary algorithm was presented based on intermediate value theorem of continuous function. The global search ability and the local search ability of this algorithm are well balanced, and operators used in the algorithm are simple, Further, small size of population scale is used. Initial numerical experiments show that the mean evolutionary algorithm is better than differential evolution algorithm in solving high dimension function optimization.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 989-994)

Pages:

1686-1691

Citation:

Online since:

July 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Janikow C Z, Michalewicz Z. An experimental comparison of binary and floating point representations in genetic algorithms[C]/ ICGA. 1991: 31-36.

Google Scholar

[2] Montes de Oca M A, Stutzle T, Birattari M, et al. Frankenstein's PSO: a composite particle swarm optimization algorithm[J]. Evolutionary Computation, IEEE Transactions on, 2009, 13(5): 1120-1132.

DOI: 10.1109/tevc.2009.2021465

Google Scholar

[3] Kromer P, Snael V, Zelinka I. Randomness and Chaos in Genetic Algorithms and Differential Evolution[C] /Intelligent Networking and Collaborative Systems (INCoS), 2013 5th International Conference on. IEEE, 2013: 196-201.

DOI: 10.1109/incos.2013.36

Google Scholar

[4] Fen Shi, Hui Wang, Lei Yu, Analysis of 30 Cases on Intelligence Algorithm [M]. Beijing: Beijing University of Aeronautics and Astronautics Press, (2011).

Google Scholar

[5] ChangShou Deng, BingYan Zhao, ChangYong Liang, Improved Differential Evolution Algorithm [ J] Computer Engineering 2009, 35(24): 194-198.

Google Scholar