Abstract
This work is a first step toward the design of a cooperative-coevolution GP for symbolic regression, which first output is a selective mutation operator for classical GP. Cooperative co-evolution techniques rely on the imitation of cooperative capabilities of natural populations and have been successfully applied in various domains to solve very complex optimization problems. It has been proved on several applications that the use of two fitness measures (local and global) within an evolving population allow to design more efficient optimization schemes. We currently investigate the use of a two-level fitness measurement for the design of operators, and present in this paper a selective mutation operator. Experimental analysis on a symbolic regression problem give evidence of the efficiency of this operator in comparison to classical subtree mutation.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
P.J. Angeline. Subtree crossover: Building block engine or macro mutation? In Genetic Programming 1997: Proceedings of the Second Annual Conference. MorganKaufmann, July 1997.
J. Chapuis and E. Lutton. Artie-fract : Interactive evolution of fractals. In 4th International Conference on Generative Art, Milano, Italy, Dec 12-14 2001.
P. Collet, E. Lutton, F. Raynal, and M. Schoenauer. Polar ifs + parisian Genetic Programming = efficient IFS inverse problem solving. Genetic Programming and Evolvable Machines Journal, 1(4):339–361, 2000. October.
P. D’haeseleer. Context preserving crossover in genetic programming. In Proc of the 1994 IEEE World Congress on Computational Intelligence, vol 1, pp 256261, Orlando, USA, 27-29 1994. IEEE Press.
M. Dorigo and G. Di Caro. The ant colony optimization meta-heuristic. New Ideas in Optimization, pp 11–32, 1999. D. Corne, M. Dorigo and F. Glover, editors, McGraw-Hill.
E. Dunn, G. Olague and E. Lutton. “Parisian Camera Placement for Vision Metrology” In Pattern Recognition Letters, Vol. 27, No. 11, August, pp. 1209-1219, 2006.
L. Bull and T. C. Fogarty. Co-evolving communicating classifier systems for tracking. pp 522–527, Innsbruck, Austria, April 1993. Springer-Verlag, Wien.
M. Hammad, C. Ryan. A new approach to evaluate GP schema in context. In Genetic an Evolutionnary Computation Conference (GECCO 2005) workshop program (Washington, D.C., USA, 25-29 June 2005), F. Rothlanlf at AL., Ads., ACM Press PP. 378–381.
S. Hengpraprohm and P. Chongstitvatana. “Selective Crossover in Genetic Programming”. citeseer.ist.psu.edu/536164.html
Iba, H., and Garis, H., Extending Genetic Programming with Recombinative Gidance, angeline, P. and Kinnear, K., editors, Advanced in Genetic Programming vol 2, MIT Press, 1996.
R.E. Keller, W. Banzhaf, P. Nordin and F. D. Francone “Genetic Programming An Introduction” Morgan Kauffman, 1998.
Koza, J. R., Genetic Programming : On the Programming of Computers by Natural selection. MIT Press, Cambridge, MA. 1992.
J.R. Koza. Genetic Programming II: Automatic Discovery of reutilisable programs. MIT Press, Cambridge Massachusetts, May 1994.
G. Ochoa, E. Lutton, E. Burke. “Cooperative Royal Road: avoiding hitchhiking”. In Evolution Artificielle 2007. Tours, France.
Y. Landrin-Schweitzer, P. Collet, and E. Lutton. Interactive gp for data retrieval in medical databases. In EUROGP’03. LNCS, Springer Verlag, 2003.
Y. Landrin-Schweitzer, P. Collet, E. Lutton, and T. Prost. Introducing lateral thinking in search engines with interactive evolutionary algorithms. In SAC 2003, Special Track COMPAHEC, 2003. Melbourne, Florida, U.S.A.
J. Louchet, M. Guyon, M.-J. Lesot, and A. Boumaza. Dynamic flies: a new pattern recognition tool applied to stereo sequence processing. Pattern Recognition Letters, 2002. No. 23 pp. 335–345, Elsevier Science B.V.
C. K. Mohan. Selective Crossover: Towards Fitter Offspring. Symposium on Applied Computing (SAC’98), Atlanta. 1998.
M. A. Potter and K. A. De Jong. Cooperative Coevolution: An Architecture for Evolving Coadapted Subcomponents. Evolutionary Computation, 8(1):1–29, MIT Press, 2000.
R. Poli, and N. McPhee, Exact GP Schema Theory for Headless Chiken Crossover and Subtree Mutation. 2001.
W. B. Langdon Quick Intro to simple-gp.c, University College London, 1994.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Aichour, M., Lutton, E. (2008). Cooperative Co-evolution Inspired Operators for Classical GP Schemes. In: Krasnogor, N., Nicosia, G., Pavone, M., Pelta, D. (eds) Nature Inspired Cooperative Strategies for Optimization (NICSO 2007). Studies in Computational Intelligence, vol 129. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78987-1_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-78987-1_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-78986-4
Online ISBN: 978-3-540-78987-1
eBook Packages: EngineeringEngineering (R0)