Upload_transparent

Evolving Evolutionary Algorithms using Linear Genetic Programming

 
 
 
 
 
moltean

by moltean

Value This
Doc
Scribd
Average
     
Pages: 34 43
Words: 8455 13640
Characters: 52156 81678
Lines: 328 623
     
     
Letters per word: 6.17 5.99
Words per line: 25.78 21.89
Words per page: 248.68 317.21

Add to your reading list

Flag_red Flag this document

Document Information

2,511 Reads | 0 Comments

Description

A new model for evolving Evolutionary Algorithms is proposed in this paper. The model is based on the Linear Genetic Programming (LGP) technique. Every LGP chromosome encodes an EA which is used for solving a particular problem. Several Evolutionary Algorithms for function optimization, the Traveling Salesman Problem and the Quadratic Assignment Problem are evolved by using the considered model. Numerical experiments show that the evolved Evolutionary Algorithms perform similarly and sometimes even better than standard approaches for several well-known benchmarking problems.

Pdf_16x16 34 Pages


Date Added

08/23/2007

Category

Uncategorized.

Tags
Groups
Awards

Flame Rising

Copyright

Attribution Non-commercial

More info »

 

or use Facebook Connect