Article

Evolving modular recursive sorting algorithms

Authors:

Alexandros Agapitos,

Simon M. LucasAuthors Info & Claims

EuroGP'07: Proceedings of the 10th European conference on Genetic programming

Pages 301 - 310

Published: 11 April 2007 Publication History

Abstract

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.

References

[1]

J.R. Koza, Genetic Programming II: automatic discovery of reusable programs, MIT Press, Cambridge, MA, (1994).

Digital Library

Google Scholar

[2]

Peter J. Angeline and Jordan Pollack, "Evolutionary module acquisition", in Proceedings of the Second Annual Conference on Evolutionary Programming, 1993.

Google Scholar

[3]

Justinian P. Rosca and Dana H. Ballard, "Discovery of subroutines in genetic programming", in Advances in Genetic Programming 2. MIT Press, 1996.

Digital Library

Google Scholar

[4]

Lee Spector, "Simultaneous evolution of programs and their control structures", in Advances in Genetic Programming 2. MIT Press, 1996.

Digital Library

Google Scholar

[5]

Tina Yu and Chris Clack, "Recursion, lambda abstractions and genetic programming", in Genetic Programming 1998: Proceedings of the Third Annual Conference.

Google Scholar

[6]

Lee Spector, Jon Klein, and Maarten Keijzer, "The push3 execution stack and the evolution of control", in GECCO '05: Proceedings of the 2005 conference on Genetic and evolutionary computation, New York, NY, USA, 2005, pp. 1689-1696.

Digital Library

Google Scholar

[7]

Alexandros Agapitos and Simon M. Lucas, "Evolving efficient recursive sorting algorithms", in Proceedings of the 2006 IEEE Congress on Evolutionary Computation, Vancouver, 6-21 July 2006, pp. 9227-9234, IEEE Press.

Google Scholar

[8]

Kenneth E. Kinnear, Jr., "Generality and difficulty in genetic programming: Evolving a sort", in Proceedings of the 5th International Conference on Genetic Algorithms, ICGA-93, Stephanie Forrest, Ed., University of Illinois at Urbana-Champaign, 17-21 July 1993, pp. 287-294, Morgan Kaufmann.

Digital Library

Google Scholar

[9]

Kenneth E. Kinnear, Jr., "Evolving a sort: Lessons in genetic programming", in Proceedings of the 1993 International Conference on Neural Networks, San Francisco, USA, 28 March-1 April 1993, vol. 2, pp. 881-888, IEEE Press.

Google Scholar

[10]

Una-May O'Reilly and Franz Oppacher, "An experimental perspective on genetic programming", in Parallel Problem Solving from Nature 2, 1992.

Google Scholar

[11]

Russ Abbott, Jiang Guo, and Behzad Parviz, "Guided genetic programming", in The 2003 International Conference on Machine Learning; Models, Technologies and Applications (MLMTA'03), las Vegas, 23-26 June 2003, CSREA Press.

Google Scholar

[12]

Scott Brave, "Evolving recursive programs for tree search", in Advances in Genetic Programming 2. MIT Press, 1996.

Digital Library

Google Scholar

[13]

Astro Teller, "Genetic programming, indexed memory, the halting problem, and other curiosities", in Proceedings of the 7th annual Florida Artificial Intelligence Research Symposium, Pensacola, Florida, USA, May 1994, pp. 270-274, IEEE Press.

Google Scholar

Cited By

View all

Agapitos AO'neill MKattan ALucas S(2017)Recursion in tree-based genetic programmingGenetic Programming and Evolvable Machines10.1007/s10710-016-9277-518:2(149-183)Online publication date: 1-Jun-2017
https://dl.acm.org/doi/10.1007/s10710-016-9277-5
Chennupati GAzad RRyan CEsparcia-Alcázar A(2015)Synthesis of Parallel Iterative Sorts with Multi-Core Grammatical EvolutionProceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary Computation10.1145/2739482.2768458(1059-1066)Online publication date: 11-Jul-2015
https://dl.acm.org/doi/10.1145/2739482.2768458
Cody-Kenny BGalván-López EBarrett SEsparcia-Alcázar A(2015)locoGPProceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary Computation10.1145/2739482.2768419(811-818)Online publication date: 11-Jul-2015
https://dl.acm.org/doi/10.1145/2739482.2768419
Show More Cited By

Recommendations

Evolving evolutionary algorithms
GECCO '12: Proceedings of the 14th annual conference companion on Genetic and evolutionary computation

This paper proposes a Grammatical Evolution framework to the automatic design of Evolutionary Algorithms. We define a grammar that has the ability to combine components regularly appearing in existing evolutionary algorithms, aiming to achieve novel and ...
Constrained differential evolution with multiobjective sorting mutation operators for constrained optimization

The proposed constrained differential evolution framework uses nondominated sorting mutation operator based on fitness and diversity information for constrained optimization. This study proposes a new constraint differential evolution framework.Parents ...
Evolving evolutionary algorithms using evolutionary algorithms
GECCO '07: Proceedings of the 9th annual conference companion on Genetic and evolutionary computation

A new model for automatic generation of Evolutionary Algorithms (EAs) by evolutionary means is proposed in this paper. The model is based on a simple Genetic Algorithm (GA). Every GA chromosome encodes an EA, which is used for solving a particular ...

Comments

Information & Contributors

Information

Published In

EuroGP'07: Proceedings of the 10th European conference on Genetic programming

April 2007

382 pages

ISBN:9783540716020

Editors:
Marc Ebner
Universität Würzburg, Germany
,
Michael O'Neill
University College Dublin, Ireland
,
Anikó Ekárt
Aston University, Birmingham, UK
,
Leonardo Vanneschi
University of Milano-Bicocca, Italy
,
Anna Isabel Esparcia-Alcázar
Universidad Politécnica de Valencia, Spain

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 11 April 2007

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

10
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 10 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Agapitos AO'neill MKattan ALucas S(2017)Recursion in tree-based genetic programmingGenetic Programming and Evolvable Machines10.1007/s10710-016-9277-518:2(149-183)Online publication date: 1-Jun-2017
https://dl.acm.org/doi/10.1007/s10710-016-9277-5
Chennupati GAzad RRyan CEsparcia-Alcázar A(2015)Synthesis of Parallel Iterative Sorts with Multi-Core Grammatical EvolutionProceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary Computation10.1145/2739482.2768458(1059-1066)Online publication date: 11-Jul-2015
https://dl.acm.org/doi/10.1145/2739482.2768458
Cody-Kenny BGalván-López EBarrett SEsparcia-Alcázar A(2015)locoGPProceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary Computation10.1145/2739482.2768419(811-818)Online publication date: 11-Jul-2015
https://dl.acm.org/doi/10.1145/2739482.2768419
Chennupati GAzad RRyan CEsparcia-Alcázar A(2015)Performance Optimization of Multi-Core Grammatical Evolution Generated Parallel Recursive ProgramsProceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation10.1145/2739480.2754746(1007-1014)Online publication date: 11-Jul-2015
https://dl.acm.org/doi/10.1145/2739480.2754746
Arcuri AYao X(2014)Co-evolutionary automatic programming for software developmentInformation Sciences: an International Journal10.1016/j.ins.2009.12.019259(412-432)Online publication date: 1-Feb-2014
https://dl.acm.org/doi/10.1016/j.ins.2009.12.019
McDermott JWhite DLuke SManzoni LCastelli MVanneschi LJaskowski WKrawiec KHarper RDe Jong KO'Reilly UMoore J(2012)Genetic programming needs better benchmarksProceedings of the 14th annual conference on Genetic and evolutionary computation10.1145/2330163.2330273(791-798)Online publication date: 7-Jul-2012
https://dl.acm.org/doi/10.1145/2330163.2330273
Arcuri A(2011)Evolutionary repair of faulty softwareApplied Soft Computing10.1016/j.asoc.2011.01.02311:4(3494-3514)Online publication date: 1-Jun-2011
https://dl.acm.org/doi/10.1016/j.asoc.2011.01.023
Wolfson KSipper M(2009)Evolving efficient list search algorithmsProceedings of the 9th international conference on Artificial evolution10.5555/1883723.1883744(158-169)Online publication date: 26-Oct-2009
https://dl.acm.org/doi/10.5555/1883723.1883744
Arcuri AYao XStirewalt KEgyed AFischer B(2007)Coevolving programs and unit tests from their specificationProceedings of the 22nd IEEE/ACM International Conference on Automated Software Engineering10.1145/1321631.1321693(397-400)Online publication date: 5-Nov-2007
https://dl.acm.org/doi/10.1145/1321631.1321693
Pillay NChalmers CBarnard LBotha R(2007)A hybrid approach to automatic programming for the object-oriented programming paradigmProceedings of the 2007 annual research conference of the South African institute of computer scientists and information technologists on IT research in developing countries10.1145/1292491.1292505(116-124)Online publication date: 2-Oct-2007
https://dl.acm.org/doi/10.1145/1292491.1292505

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Recommendations

Evolving evolutionary algorithms

Constrained differential evolution with multiobjective sorting mutation operators for constrained optimization

Evolving evolutionary algorithms using evolutionary algorithms

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations