CoChat

Open issues in genetic programming

Open access
O’Neill, Michael, Vanneschi, Leonardo, Gustafson, Steven, Banzhaf, Wolfgang · 2010 · Genetic Programming and Evolvable Machines

The DOI matches its Crossref record; 157 of the 160 references it cites were found in a registry or an index.

Abstract

It is approximately 50 years since the first computational experiments were conducted in what has become known today as the field of Genetic Programming (GP), twenty years since John Koza named and popularised the method, and ten years since the first issue appeared of the Genetic Programming & Evolvable Machines journal. In particular, during the past two decades there has been a significant range and volume of development in the theory and application of GP, and in recent years the field has become increasingly applied. There remain a number of significant open issues despite the successful application of GP to a number of challenging real-world problem domains and progress in the development of a theory explaining the behavior and dynamics of GP. These issues must be addressed for GP to realise its full potential and to become a trusted mainstream member of the computational problem solving toolkit. In this paper we outline some of the challenges and open issues that face researchers and practitioners of GP. We hope this overview will stimulate debate, focus the direction of future research to deepen our understanding of GP, and further the development of more powerful problem solving algorithms.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1007/s10710-010-9113-2

Cites

157 of 157 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 157 references

Research works printed but not linked: 7

  1. L. Altenberg, NK fitness landscapes. In Section B2.7.2 in Handbook of Evolutionary Computation, ed. by T. Back et al. (IOP Publishing Ltd and Oxford University Press, Bristol and Oxford, 1997), pp. B2.7:5–B2.7:10
  2. S. Bhattacharyya, O. Pictet, G. Zumbach, Representational semantics for genetic programming based learning in high-frequency financial data. In Genetic Programming 1998: Proceedings of the 3rd Annual Conference (University of Wisconsin, Madison, WI, USA, 22–25 July 1998), ed. by J. R. Koza, W. Banzhaf, K. Chellapilla, K. Deb, M. Dorigo, D.B. Fogel, M. H. Garzon, D.E. Goldberg, H. Iba, R. Riolo, (Morgan Kaufmann, 1998), pp. 11–16
  3. M. Evett, T. Fernandez, Numeric mutation improves the discovery of numeric constants in genetic programming. In Genetic Programming 1998: Proceedings of the 3rd Annual Conference (University of Wisconsin, Madison, WI, USA, 22–25 July 1998), ed. by J.R. Koza, W. Banzhaf, K. Chellapilla, K. Deb, M. Dorigo, D.B. Fogel, M.H. Garzon, D.E. Goldberg, H. Iba, R. Riolo (Morgan Kaufmann, 1998), pp. 66–71
  4. W. B. Langdon, W. Banzhaf, Repeated patterns in genetic programming. Nat. Comput. 7(4), 589–613 (2008, Dec) · DOI
  5. T. Mitchell, Machine Learning (McGraw Hill, New York, 1996)
  6. G. Seront, External concepts reuse in genetic programming. In Working Notes for the AAAI Symposium on Genetic Programming (MIT, Cambridge, MA, USA, 10–12 Nov 1995), ed. by E.V. Siegel, J.R. Koza (AAAI, 1995), pp. 94–98
  7. S. Wright, The roles of mutation, inbreeding, crossbreeding, and selection in evolution. In Proceedings of the 6th International Congress on Genetics, vol. 1, ed. by D. Jones (1932), pp. 355–366

Cited by

See all 224

Metadata

Authors
O’Neill, M., Vanneschi, L., Gustafson, S., & Banzhaf, W.
Affiliations
  • University College Dublin (IE)
  • University of Milano-Bicocca (IT)
  • GE Global Research (United States) (US)
  • Memorial University of Newfoundland (CA)
Corresponding author
O’Neill, Michael
Venue
Genetic Programming and Evolvable Machines
Published
2010-05-14
Volume
11
Issue
3-4
Pages
339-363
ISSN
  • 1389-2576 (ISSN-L)
  • 1573-7632
OpenAlex
W2030792885
Cited by
224
References
160
Citations by year
2026: 2 · 2025: 10 · 2024: 7 · 2023: 9 · 2022: 6 · 2021: 11 · 2020: 9 · 2019: 19 · 2018: 15 · 2017: 15 · 2016: 13 · 2015: 17 · 2014: 22 · 2013: 27 · 2012: 25
FWCI
23.36
Type
journal article
Language
en
Open access
Licence
  • cc-by-nc-sa
  • www.springer.com/tdm (tdm)
Locations
  • Genetic Programming and Evolvable Machines (publishedVersion)
  • Research Repository UCD (University College Dublin) (submittedVersion, cc-by-nc-sa)
  • Arrow@dit (Dublin Institute of Technology) (submittedVersion)
  • BOA (University of Milano-Bicocca) (submittedVersion)
Funders
  • Science Foundation Ireland (08/IN.1/I1868)
  • Natural Sciences and Engineering Research Council of Canada
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Evolutionary Algorithms and Applications
  • Physical Sciences › Computer Science › Artificial Intelligence › Metaheuristic Optimization Algorithms Research
  • Physical Sciences › Computer Science › Computer Science Applications › Teaching and Learning Programming
Keywords
genetic programming, open problems, problem-solving algorithms, future research directions

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Open issues in genetic programming. https://app.cochat.ai/papers/10.1007/s10710-010-9113-2
The paper
O’Neill, M., Vanneschi, L., Gustafson, S., & Banzhaf, W. (2010). Open issues in genetic programming. Genetic Programming and Evolvable Machines. https://doi.org/10.1007/s10710-010-9113-2

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.