Log In | Sign Up | Help
Upload_transparent

Evolving Evolutionary Algorithms using Multi Expression Programming

Twitter Facebook
  • Send This
  • Add_to_favs_transparent
  • Embed
  • Download
  • Flag
  • Add to Favorites

Scribd requires Javascript. Please enable Javascript in your browser.

Value This
Doc 		Scribd
Average
     
Pages: 8 43
Words: 2940 13640
Characters: 17884 81678
Lines: 107 623
     
     
Letters per word: 6.08 5.99
Words per line: 27.48 21.89
Words per page: 367.5 317.21

Document Information

1,829 Reads | 0 Likes | 0 Comments | 3 Favorites

Added By
Description

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.

Pdf_16x16 8 Pages

Date Added

08/24/2007
Category

Uncategorized.

Tags
Groups

Natural Computing, Singularity 11:11 Group_add

Copyright

Attribution Non-commercial

More info »