Improving the Search by Encoding Multiple Solutions in a Chromosome

 
 
 
 
 

by moltean

Value This
Doc
Scribd
Average
     
Pages: 36 43
Words: 8258 13640
Characters: 46931 81678
Lines: 263 623
     
     
Letters per word: 5.68 5.99
Words per line: 31.4 21.89
Words per page: 229.39 317.21

Add to your reading list

Flag_red Flag this document

Document Information

798 Reads | 0 Comments

Description

We investigate the possibility of encoding multiple solutions of a problem in a single
chromosome. The best solution encoded in an individual will represent (will provide
the fitness of) that individual. In order to obtain some benefits the chromosome
decoding process must have the same complexity as in the case of a single solution
in a chromosome. Three Genetic Programming techniques are analyzed for this
purpose: Multi Expression Programming, Linear Genetic Programming and Infix
Form Genetic Programming. Numerical experiments show that encoding multiple
solutions in a chromosome greatly improves the search process.

Pdf_16x16 36 Pages


Date Added

08/24/2007

Category

Uncategorized.

Tags
Groups
Copyright

Attribution Non-commercial

More info »

 

or use Facebook Connect