Hammad Majeed
ABSTRACT
This paper introduces a new type of mutation, Context-Aware Mutation, which is inspired by the recently introduced context-aware crossover. Context-Aware mutation operates by replacing existing sub-trees with modules from a previously construct repository of possibly useful sub-trees.
We describe an algorithmic way to produce the repository from an initial, exploratory run and test various GP set ups for producing the repository. The results show that when the exploratory run uses context-aware crossover and the main run uses context-aware mutation, not only is the final result significantly better, the overall cost of the runs in terms of individuals evaluated is significantly lower.
- P. J. Angeline and J. B. Pollack. Coevolving high-level representations. July Technical report 92-PA-COEVOLVE, Laboratory for Artificial Intelligence. The Ohio State University, 1993.Google Scholar
- Peter J. Angeline and Jordan Pollack. Evolutionary module acquisition. In D. Fogel and W. Atmar, editors, Proceedings of the Second Annual Conference on Evolutionary Programming, pages 154--163, La Jolla, CA, USA, 25-26 February 1993.Google Scholar
- Antonello Dessi, Antonella Giani, and Antonina Starita. An analysis of automatic subroutine discovery in genetic programming. In Proceedings of the Genetic and Evolutionary Computation Conference, volume 2, pages 996--1001, Orlando, Florida, USA, 13-17 July 1999. Morgan Kaufmann.Google Scholar
- Daniel Howard. Modularization by multi-run frequency driven subtree encapsulation. In Rick L. Riolo and Bill Worzel, editors, Genetic Programming Theory and Practise, chapter 10, pages 155--172. Kluwer, 2003.Google Scholar
- John R. Koza. Genetic Programming II: Automatic Discovery of Reusable Programs. MIT Press, Cambridge Massachusetts, May 1994. Google ScholarDigital Library
- Hammad Majeed and Conor Ryan. A less destructive, context-aware crossover operator for GP. In Pierre Collet, Marco Tomassini, Marc Ebner, Steven Gustafson, and Anikó Ekárt, editors, Proceedings of the 9th European Conference on Genetic Programming, volume 3905 of Lecture Notes in Computer Science, pages 36--48, Budapest, Hungary, 10 -12 April 2006. Springer. Google ScholarDigital Library
- Hammad Majeed and Conor Ryan. Using context-aware crossover to improve the performance of GP. In GECCO 2006:Proceedings of the 8th annual conference on Genetic and evolutionary computation, volume 1, pages 847--854, Seattle, Washington, USA, 8-12 July 2006. ACM Press. Google ScholarDigital Library
- Hammad Majeed, Conor Ryan, and R. Muhammad Atif Azad. Evaluating GP schema in context. In GECCO 2005:Proceedings of the 2005 conference on Genetic and evolutionary computation, volume 2, pages 1773--1774, Washington DC, USA, 25-29 June 2005. ACM Press. Google ScholarDigital Library
- Justinian P. Rosca and Dana H. Ballard. Discovery of subroutines in genetic programming. In Peter J. Angeline and K. E. Kinnear, Jr., editors, Advances in Genetic Programming 2, chapter 9, pages 177--202. MIT Press, Cambridge, MA, USA, 1996. Google ScholarDigital Library
- Conor Ryan and Maarten Keijzer. An analysis of diversity of constants of genetic programming. In Conor Ryan, Terence Soule, Maarten Keijzer, Edward Tsang, Riccardo Poli, and Ernesto Costa, editors, Genetic Programming, Proceedings of EuroGP '2003, volume 2610 of LNCS, pages 404--413, Essex, 14-16 April 2003. Springer-Verlag. Google ScholarDigital Library
Index Terms
- Context-aware mutation: a modular, context aware mutation operator for genetic programming
Recommendations
On the constructiveness of context-aware crossover
GECCO '07: Proceedings of the 9th annual conference on Genetic and evolutionary computationCrossover in Genetic Programming is mostly a destructive operator, generally producing children worse than the parents and occasionally producing those who are better. A recently introduced operator, Context-Aware Crossover, which implicitly discovers ...
A parameter-less genetic algorithm with customized crossover and mutation operators
GECCO '11: Proceedings of the 13th annual conference on Genetic and evolutionary computationGenetic algorithm is one of the well-known population based meta-heuristics. The reasonable performance of the algorithm on a wide variety of problems as well as its simplicity made this algorithm a first choice in lots of cases. However, the algorithm ...
An improved imperialist competition algorithm with adaptive differential mutation assimilation strategy for function optimization
AbstractIn imperialist competition algorithm (ICA), the assimilation is an important step, which is responsible for exploring potential better position or solution for an optimization problem. In this paper, an improved ICA equipped with an adaptive ...
Highlights- A new assimilation method was proposed for imperialist competitive algorithm .
- The method generates new position using “DE/best/1” mutation and crossover operator.
- The method has better global searching capability.
- The method ...
Comments