Advertisement
Published in:
2006 | OriginalPaper | Chapter
Combinatorial Optimization
Author : Cândida Ferreira, Dr.
Published in: Gene Expression Programming
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
In gene expression programming the simplest chromosome will code for a single gene composed of only one terminal. This kind of gene is obtained when the head length
h
is zero. Then, applying equation (2.4) for determining tail length, we get a gene length
g
= 1 and genes exclusively composed of terminals. So, in its simplest representation, gene expression programming is equivalent to the canonical genetic algorithm in which each gene consists of just one terminal.