Skip to main content
SpringerLink
Log in

Synthesis of In-Place Iterative Sorting Algorithms Using GP: A Comparison Between STGP, SFGP, G3P and GE

  • Conference paper
  • First Online:
Book cover Progress in Artificial Intelligence (EPIA 2015)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 9273))

Included in the following conference series:

Abstract

This work addresses the automatic synthesis of in-place, iterative sorting algorithms of quadratic complexity. Four approaches (Strongly Typed Genetic Programming, Strongly Formed Genetic Programming, Grammar Guided Genetic Programming and Grammatical Evolution) are analyzed and compared considering their performance and scalability with relation to the size of the primitive set, and consequently, of the search space. Performance gains, provided by protecting composite data structure accesses and by another layer of knowledge into strong typing, are presented. Constraints on index assignments to grammar productions are shown to have a great performance impact.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Otero, F., Castle, T., Johnson, C.: Epochx: genetic programming in java withstatistics and event monitoring. In: Proceedings of the 14th Annual Conference Companion on Genetic and Evolutionary Computation, pp. 93–100 (2012)

    Google Scholar 

  2. ONeill, M, Nicolau, M., Agapitos, A.: Experiments in program synthesis withgrammatical evolution: a focus on Integer Sorting. In: IEEE Congress on Evolutionary Computation (CEC), pp. 1504–1511 (2014)

    Google Scholar 

  3. Koza, J.R.: Genetic programming: on the programming of computers by means of natural selection, vol. 1. MIT press (1992)

    Google Scholar 

  4. Christensen, S., Oppacher, F.: An analysis of koza’s computational effort statistic for genetic programming. In: Foster, J.A., Lutton, E., Miller, J., Ryan, C., Tettamanzi, A.G.B. (eds.) EuroGP 2002. LNCS, vol. 2278, pp. 182–191. Springer, Heidelberg (2002)

    Google Scholar 

  5. Walker, M., Edwards, H., Messom, C.H.: Confidence intervals for computational effort comparisons. In: Ebner, M., O’Neill, M., Ekárt, A., Vanneschi, L., Esparcia-Alcázar, A.I. (eds.) EuroGP 2007. LNCS, vol. 4445, pp. 23–32. Springer, Heidelberg (2007)

    Google Scholar 

  6. Orlov, M., Sipper, M.: FINCH: a system for evolving Java (bytecode). In: Genetic Programming Theory and Practice VIII, Springer, pp. 1–16 (2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Numerical Analysis, University of Córdoba, Córdoba, Spain

    David Pinheiro, Alberto Cano & Sebastián Ventura

Authors
  1. David Pinheiro
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alberto Cano
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sebastián Ventura
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to David Pinheiro .

Editor information

Editors and Affiliations

  1. ISEC - Coimbra Institute of Engineering, Polytechnic Institute of Coimbra, Coimbra, Portugal

    Francisco Pereira

  2. CIUSC, Department of Informatics Engineering, University of Coimbra, Coimbra, Portugal

    Penousal Machado

  3. CIUSC, Department of Informatics Engineering, University of Coimbra, Coimbra, Portugal

    Ernesto Costa

  4. CIUSC, Department of Informatics Engineering, University of Coimbra, Coimbra, Portugal

    Amílcar Cardoso

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Pinheiro, D., Cano, A., Ventura, S. (2015). Synthesis of In-Place Iterative Sorting Algorithms Using GP: A Comparison Between STGP, SFGP, G3P and GE. In: Pereira, F., Machado, P., Costa, E., Cardoso, A. (eds) Progress in Artificial Intelligence. EPIA 2015. Lecture Notes in Computer Science(), vol 9273. Springer, Cham. https://doi.org/10.1007/978-3-319-23485-4_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-23485-4_32

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-23484-7

  • Online ISBN: 978-3-319-23485-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation