Evolving evolutionary algorithms using multi expression programming

102Citations
Citations of this article
49Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Finding the optimal parameter setting (i.e. The optimal population size, the optimal mutation probability, the optimal evolutionary model etc) for an Evolutionary Algorithm (EA) is a difficult task. Instead of evolving only the parameters of the algorithm we will evolve an entire EA capable of solving a particular problem. For this purpose the Multi Expression Programming (MEP) technique is used. Each MEP chromosome will encode multiple EAs. An nongenerational EA for function optimization is evolved in this paper. Numerical experiments show the effectiveness of this approach.

Cite

CITATION STYLE

APA

Oltean, M., & Groşan, C. (2003). Evolving evolutionary algorithms using multi expression programming. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 2801, pp. 651–658). Springer Verlag. https://doi.org/10.1007/978-3-540-39432-7_70

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free