Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer
About this chapter
Cite this chapter
Ferreira, C. (2006). Combinatorial Optimization. In: Gene Expression Programming. Studies in Computational Intelligence, vol 21. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-32849-1_11
Download citation
DOI: https://doi.org/10.1007/3-540-32849-1_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32796-7
Online ISBN: 978-3-540-32849-0
eBook Packages: EngineeringEngineering (R0)