A fundamental issue in evolutionary learning is the definition of the solution representation language. We present the application of Object Oriented Genetic Programming to the task of coevolving general recursive sorting algorithms along with their primitive representation alphabet. We report the computational effort required to evolve target solutions and provide a comparison between crossover and mutation variation operators, and also undirected random search. We found that the induction of evolved method signatures (typed parameters and return type) can be realized through an evolutionary fitness-driven process. We also found that the evolutionary algorithm outperformed undirected random search, and that mutation performed better than crossover in this problem domain. The main result is that modular sorting algorithms can be evolved. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Agapitos, A., & Lucas, S. M. (2007). Evolving modular recursive sorting algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4445 LNCS, pp. 301–310). Springer Verlag. https://doi.org/10.1007/978-3-540-71605-1_28
Mendeley helps you to discover research relevant for your work.