%0 Conference Paper %1 li:2004:lbp %A Li, Xin %A Zhou, Chi %A Nelson, Peter C. %A Tirpak, Thomas M. %B Late Breaking Papers at the 2004 Genetic and Evolutionary Computation Conference %C Seattle, Washington, USA %D 2004 %E Keijzer, Maarten %K GEP algorithms, genetic programming, %T Investigation of Constant Creation Techniques in the Context of Gene Expression Programming %U http://www.cs.uic.edu/~xli1/papers/GEPConstantCreation(GECCO04_LBP).pdf %X Gene Expression Programming (GEP) is a new technique of Genetic Programming (GP) that implements a linear genotype representation. It uses fixed-length chromosomes to represent expression trees of different shapes and sizes, which results in unconstrained search of the genome space while still ensuring validity of the programs output. However, GEP has some difficulty in discovering suitable function structures because the genetic operators are more disruptive than traditional tree-based GP. One possible remedy is to specifically assist the algorithm in discovering useful numeric constants. In this paper, the effectiveness of several constant creation techniques for GEP has been investigated through two symbolic regression benchmark problems. Our experimental results show that constant creation methods applied to the whole population for selected generations perform better than methods that are applied only to the best individuals. The proposed tune-up process for the entire population can significantly improve the average fitness of the best solutions.

@inproceedings{li:2004:lbp, abstract = {Gene Expression Programming (GEP) is a new technique of Genetic Programming (GP) that implements a linear genotype representation. It uses fixed-length chromosomes to represent expression trees of different shapes and sizes, which results in unconstrained search of the genome space while still ensuring validity of the programs output. However, GEP has some difficulty in discovering suitable function structures because the genetic operators are more disruptive than traditional tree-based GP. One possible remedy is to specifically assist the algorithm in discovering useful numeric constants. In this paper, the effectiveness of several constant creation techniques for GEP has been investigated through two symbolic regression benchmark problems. Our experimental results show that constant creation methods applied to the whole population for selected generations perform better than methods that are applied only to the best individuals. The proposed tune-up process for the entire population can significantly improve the average fitness of the best solutions.}, added-at = {2008-06-19T17:35:00.000+0200}, address = {Seattle, Washington, USA}, author = {Li, Xin and Zhou, Chi and Nelson, Peter C. and Tirpak, Thomas M.}, biburl = {https://www.bibsonomy.org/bibtex/2d1dca6ee755888e4756988344bf19363/brazovayeye}, booktitle = {Late Breaking Papers at the 2004 Genetic and Evolutionary Computation Conference}, editor = {Keijzer, Maarten}, interhash = {90e0d5dae5b43d157bcf4ca6cb7803b1}, intrahash = {d1dca6ee755888e4756988344bf19363}, keywords = {GEP algorithms, genetic programming,}, month = {26 July}, notes = {Part of \cite{keijzer:2004:GECCO:lbp}}, timestamp = {2008-06-19T17:45:33.000+0200}, title = {Investigation of Constant Creation Techniques in the Context of Gene Expression Programming}, url = {http://www.cs.uic.edu/~xli1/papers/GEPConstantCreation(GECCO04_LBP).pdf}, year = 2004 }