On the Evolution of Evolutionary Algorithms



On the Evolution of Evolutionary Algorithms
In this paper we discuss the evolution of several components of a
traditional Evolutionary Algorithm, such as genotype to phenotype
mappings and genetic operators, presenting a formalized
description of how this can be attained. We then focus on the
evolution of mapping functions, for which we present experimental
results achieved with a meta-evolutionary scheme.


-- Pick one --


7th European Conference on Genetic Programming, April 2004

Cited by

Year 2012 : 1 citations

 Soghier, Amr. "Novel Hyper-heuristic Approaches in Exam Timetabling." (2012).

Year 2011 : 2 citations

 Spector, Lee, "Towards Practical Autoconstructive Evolution: Self-Evolution of Problem-Solving Genetic Programming Systems", Genetic Programming Theory and Practice VIII, pp. 17-33, 2011, Isbn: 978-1-4419-7747-2 Doi: 10.1007/978-1-4419-7747-2_2

 Algorithms and data structures for three-dimensional packing
SD Allen - 2011 -

Year 2010 : 5 citations

 Automatic Generation of Three-Dimensional Packing Heuristics
SD Allen, EK Burke - 2010 - Technical report, University of …

 T. Hu and W. Banzhaf. Evolvability and speed of evolutionary algorithms in light of recent developments in biology. Journal of Artificial Evolution and Applications, pages 1–28, 2010;

 E. K. Burke, M. Hyde, G. Kendall, G. Ochoa, E. Ozcan, and R. Qu. Hyper-heuristics: A survey of the state of the art. Technical Report NOTTCS-TRSUB-0906241418-2747, School of Computer Science and Information Technology, University of Nottingham, 2010;

 M. Hyde. A Genetic Programming Hyper-Heuristic Approach to Automated Packing. PhD thesis, University of Nottingham, March 2010;

 L. Spector. Towards practical autoconstructive evolution: Self-evolution of problem-solving
genetic programming systems. Genetic Programming Theory and Practice VIII, 8:17–33, 2010

Year 2009 : 2 citations

 Edmund K. Burke, Matthew Hyde, Graham Kendall, Gabriela Ochoa, Ender Ozcan and Rong Qu, \textbf{A Survey of Hyper-heuristics}, School of Computer Science and Information Technology
University of Nottingham, Computer Science Technical Report No. NOTTCS-TR-SUB-0906241418-2747, March 2009.

 Evolution of Search Algorithms Using Graph Structured Program Evolution, Shinichi Shirakawa and Tomoharu Nagao, Proceedings of EuroGP 2009, L. Vaneschi et alli (Eds.), LNCS 5481, pp. 109-120.

Year 2007 : 2 citations

 George G. Mitchell, Evolutionary Computation Applied to Combinatorial Optimisation Problems, Ph.D. Thesis, School of Electronic Engineering, Dublin City University, September, 2007.

 S. Shirakawa and T. Nagao. Evolution of sorting algorithm using graph structured program evolution. In SMC, pages 1256–1261. IEEE, 2007;

Year 2006 : 3 citations

 Gautham Anil. On an alternative approach to Evolutionary Programming, M.Tech Thesis, Jul 2006.

 Laura Diosan and Mihai Oltean, Evolving crossover operators for function optimization, in Proceedings of the European Conference on Genetic Programming (EuroGP2006), P. Collet et al (Eds.), LNCS 3905, pp. 97-108, Springer-Verlag, 2006.

 Laura Diosan and Mihai Oltean, Evolving the structure of the particle swarm optimization algorithms, in Proceedings of the 6th European Conference on Evolutionary Computation in Combinatorial Optimization (EuroGP2006), J. Gottlieb and G. Raidl (Eds.), LNCS 3906, pp. 25-36, Springer-Verlag, 2006.

Year 2005 : 2 citations

 Jose Antonio Martin H., Search space modulation in genetic algorithms: evolving the search space by sinusoidal transformations, In Proceedings of the Genetic and Evolutionary Computation Conference, Washinghton D.C., USA, 25-29 June, 2005.

 Mihai Oltean, Evolving Evolutionary Algorithms using Linear Genetic Programming, Evolutionary Computation, MIT Press, Vol. 13. Issue 3, 2005