Open issues in genetic programming
Open accessThe 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.
Integrity signals
Registry
Cites
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.
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?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“This is in contrast to traditional genetic programming that does not have this bias (and in addition requires hand-tuning the mutation operators51).”
From Mathematical discoveries from program search with large language models (2024) · cites this paper as [51]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“This is in contrast to traditional genetic programming that does not have this bias (and in addition requires hand-tuning the mutation operators51).”
From Mathematical discoveries from program search with large language models (2024) · cites this paper as [51]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Designing such a set of operations is non-trivial and problem specific, requiring domain knowledge about the problem at hand or its plausible solution51.”
From Mathematical discoveries from program search with large language models (2024) · cites this paper as [51]
Experimental — accuracy not yet measuredThe cited source says what the claim attributes to it.
In the citing paper
“However, using an LLM mitigates several issues in traditional genetic programming51, as shown in Supplementary Information Appendix A and discussed in ref. 3.”
From Mathematical discoveries from program search with large language models (2024) · cites this paper as [51]
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
UCI Machine Learning Repository
Asuncion, A. (2007) · Medical Entomology and Zoology · Cited by 25,370
No free lunch theorems for optimization
Wolpert, D. H., & Macready, W. G. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585893 · Cited by 14,237
A tutorial on support vector regression
Smola, A. J., & Schölkopf, B. (2004) · Statistics and Computing · doi:10.1023/b:stco.0000035301.49549.88 · Cited by 13,387
Genetic Programming: On the Programming of Computers by Means of Natural Selection
Koza, J. R. (1992) · Medical Entomology and Zoology · Cited by 13,082
Darwin, C., Burndy Library, Darwin, C., Edmonds & Remnants, & Henry Sotheran Ltd. (1859) · J. Murray eBooks · doi:10.5962/bhl.title.59991 · Cited by 6,984
Modeling by shortest data description
Rissanen, J. (1978) · Automatica · doi:10.1016/0005-1098(78)90005-5 · Cited by 6,011 · cited 1×
“A common agreement of many researchers is the so called minimum description length principle (see for instance [111]), which states that the best model is the one that minimizes the amount of information needed to encode it.”
BackgroundDarwin, C. (1859) · J. Murray eBooks · doi:10.5962/bhl.title.68064 · Cited by 4,601
Artificial Intelligence through Simulated Evolution
Fogel, L. J., Owens, A. J., & Walsh, M. J. (1966) · International Linear Collider · Cited by 2,796
(2005) · Cited by 2,565
Darwin, C. (1860) · J. Murray eBooks · doi:10.1037/14088-000 · Cited by 2,021
A Field Guide to Genetic Programming
Poli, R., Langdon, W. B., & McPhee, N. F. (2008) · Cited by 1,930
Genetic programming II: Automatic discovery of reusable programs
(1995) · Computers & Mathematics with Applications · doi:10.1016/0898-1221(95)90099-3 · Cited by 1,901
Banzhaf, W., Francone, F. D., Keller, R. E., & Nordin, P. C. (1998) · Cited by 1,678
Self-citation(2014) · Choice Reviews Online · doi:10.5860/choice.185702 · Cited by 1,260
Jablonka, E., Lamb, M. J., & Zeligowski, A. (2014) · The MIT Press eBooks · doi:10.7551/mitpress/9689.001.0001 · Cited by 985
Foundations of Genetic Programming
Langdon, W. B., & Poli, R. (2002) · Springer eBooks · doi:10.1007/978-3-662-04726-2 · Cited by 922
Strongly Typed Genetic Programming
Montana, D. J. (1995) · Evolutionary Computation · doi:10.1162/evco.1995.3.2.199 · Cited by 916 · cited 1×
“Numerous alternative representations have also been proposed, including graph [128], strongly-typed [86], linear [14], linear-tree [52], and linear-graph [53].”
BackgroundRobustness and Evolvability in Living Systems
Wagner, A. (2013) · Princeton University Press eBooks · doi:10.1515/9781400849383 · Cited by 882 · cited 1×
“Biological systems face this challenge every day, and a consensus seems to emerge among biologists that the genotype-phenotype relation is a key ingredient in mediating this tension [138,60].”
BackgroundSpontaneous evolution of modularity and network motifs
Kashtan, N., & Alon, U. (2005) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0503610102 · Cited by 878 · cited 2×
“In a recent paper by Kashtan et al [54] naturally emerging modules have been demonstrated in the context of a GA in coherently changing environments.”
BackgroundEvolutionary Optimization in Dynamic Environments
Branke, J. (2002) · Genetic Algorithms and Evolutionary Computation · doi:10.1007/978-1-4615-0911-0 · Cited by 829 · cited 2×
“The types of changes might range from relatively small smooth transitions to substantial perturbations in all aspects of the domain [15, 25, 89].”
BackgroundBanzhaf, W., Fogarty, T. C., Schoenauer, M., & Poli, R. (1998) · Lecture notes in computer science · doi:10.1007/bfb0055923 · Cited by 825 · cited 2×
“In the meantime, however, helping to bridge this gap GP has been integrated into MatLab [119] and is now part of Mathematica too [61], and a number of public-domain and commercial packages are available that offer GP, at least as part of the toolkit (e.g., [79,33,37,83]).”
BackgroundSelf-citationGenetic Programming III: Darwinian Invention and Problem Solving
Koza, J. R., André, D., Bennett, F. H., & Keane, M. A. (1999) · Medical Entomology and Zoology · Cited by 763
Automatically finding patches using genetic programming
Weimer, W., Nguyen, T., Le Goues, C., & Forrest, S. (2009) · 2009 IEEE 31st International Conference on Software Engineering · doi:10.1109/icse.2009.5070536 · Cited by 761 · cited 1×
“A case in point is program evolution through patches recently becoming more prominent through works like [141].”
BackgroundAdvances in Genetic Programming
(1996) · The MIT Press eBooks · doi:10.7551/mitpress/1109.001.0001 · Cited by 724
(2005) · Genetic Programming Series · doi:10.1007/b137549 · Cited by 693
A Representation for the Adaptive Generation of Simple Sequential Programs
Cramer, N. L. (1985) · international conference on Genetic algorithms · Cited by 641
Benton, M. (2005) · Journal of Clinical Investigation · doi:10.1172/jci27017 · Cited by 610
A learning system based on genetic adaptive algorithms
Smith, S. F. (1980) · Medical Entomology and Zoology · Cited by 591
Robustness and evolvability in living systems
(2006) · Choice Reviews Online · doi:10.5860/choice.43-4658 · Cited by 570
Grammatical Evolution: Evolutionary Automatic Programming in an Arbitrary Language
O’Neill, M., & Ryan, C. (2003) · Medical Entomology and Zoology · Cited by 536
Self-citationEvolutionary Computation: The Fossil Record
Fogel, D. B. (1998) · CERN Document Server (European Organization for Nuclear Research) · Cited by 489
Representations for Genetic and Evolutionary Algorithms
(2006) · Springer eBooks · doi:10.1007/3-540-32444-5 · Cited by 470
The Role of Occam's Razor in Knowledge Discovery
Domingos, P. (1999) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009868929893 · Cited by 459 · cited 1×
“But, as mentioned in [100], this argument should be taken with care as too much emphasis on minimizing complexity can prevent the discovery of more complex yet more accurate solutions.”
BackgroundThe royal road for genetic algorithms: Fitness landscapes and GA performance
Mitchell, M., Forrest, S., & Holland, J. H. (1991) · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · Cited by 446
Brameier, M., & Banzhaf, W. (2007) · Springer eBooks · doi:10.1007/978-0-387-31030-5 · Cited by 422
Self-citationThe Plausibility of Life: Resolving Darwin?s Dilemma
Kirschner, M. W., & Gerhart, J. C. (2017) · Yale University Press eBooks · doi:10.12987/9780300128673 · Cited by 405
Grammar-based Genetic Programming: a survey
McKay, R. I., Hoai, N. X., Whigham, P. A., Shan, Y., & O’Neill, M. (2010) · Genetic Programming and Evolvable Machines · doi:10.1007/s10710-010-9109-y · Cited by 377
Self-citationFriedberg, R. M. (1958) · IBM Journal of Research and Development · doi:10.1147/rd.21.0002 · Cited by 373 · cited 2×
“structures [30] a variety of representations have been explored including binary string machine code [35], finite state automata [31], generative grammatical encodings [25, 97, 142, 143] and the dominant tree-based form popularised by Koza [62].”
BackgroundVladislavleva, E. J., Smits, G. F., & den Hertog, D. (2009) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2008.926486 · Cited by 353 · cited 3×
“Overfitting seems more related to the functional complexity of the proposed solutions [131, 137] rather than to their size.”
BackgroundSarker, R. A., Mohammadian, M., & Yao, X. (2002) · International series in management science/operations research/International series in operations research & management science · doi:10.1007/b101816 · Cited by 318
Evolutionary Computation: Toward a New Philosophy of Machine Intelligence
Fogel, D. B. (2005) · Wiley eBooks · doi:10.1002/0471749214 · Cited by 302
Hierarchical genetic algorithms operating on populations of computer programs
Koza, J. R. (1989) · International Joint Conference on Artificial Intelligence · Cited by 294
Varying environments can speed up evolution
Kashtan, N., Noor, E., & Alon, U. (2007) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0611630104 · Cited by 288 · cited 1×
“evolutionary biology simulations, what has been termed computational evolution [7], suggest that EC/evolution could work efficiently ‘‘because’’ of dynamic environments and not ‘‘despite of’’ them [55], and that modularity can spontaneously arise, promoting hierarchical decomposition of a problem, because the environm…”
BackgroundGenetic Programming and Autoconstructive Evolution with the Push Programming Language
Spector, L., & Robinson, A. (2002) · Genetic Programming and Evolvable Machines · doi:10.1023/a:1014538503543 · Cited by 276
GPLAB A Genetic Programming Toolbox for MATLAB
Silva, S. (2004) · Cited by 276
Genetic Programming and Data Structures
Langdon, W. B. (1998) · Springer eBooks · doi:10.1007/978-1-4615-5731-9 · Cited by 269
Representations for Genetic and Evolutionary Algorithms
Rothlauf, F. (2006) · Representations for Genetic and Evolutionary Algorithms · doi:10.1007/3-540-32444-5_2 · Cited by 257
Designing Evolutionary Algorithms for Dynamic Environments
Morrison, R. W. (2004) · Natural computing series · doi:10.1007/978-3-662-06560-0 · Cited by 247
ALPS: the age-layered population structure for reducing the problem of premature convergence
Hornby, G. S. (2006) · Proceedings of the 8th annual conference on Genetic and evolutionary computation · doi:10.1145/1143997.1144142 · Cited by 230 · cited 1×
“Systems based on fitness layers or on age layers have shown considerable success in this context [45, 46].”
BackgroundFrom artificial evolution to computational evolution: a research agenda
Banzhaf, W., Beslon, G., Christensen, S., Foster, J. A., Képès, F., Lefort, V., Miller, J. F., Radman, M., & Ramsden, J. J. (2006) · Nature Reviews Genetics · doi:10.1038/nrg1921 · Cited by 164 · cited 3×
“In a 2006 paper one of the authors has argued together with others that there might be an entire new field of research developing at the intersection between biological evolution and computing which was termed “Computational Evolution” [7].”
BackgroundSelf-citationInductive bias and genetic programming
Whigham, P. A. (1995) · International Conference on Genetic Algorithms in Engineering Systems: Innovations and Applications (GALESIA) · doi:10.1049/cp:19951092 · Cited by 163
Foundations in Grammatical Evolution for Dynamic Environments
Dempsey, I., O’Neill, M., & Brabazon, A. (2009) · Studies in computational intelligence · doi:10.1007/978-3-642-00314-1 · Cited by 158
Self-citationNetwork Random Keys—A Tree Representation Scheme for Genetic and Evolutionary Algorithms
Rothlauf, F., Goldberg, D. E., & Heinzl, A. (2002) · Evolutionary Computation · doi:10.1162/106365602317301781 · Cited by 158
(1999) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(99)90239-0 · Cited by 152 · cited 1×
“Examples of this include Langdon’s research on evolving data structures [71] to Spector’s investigations on ‘‘autoconstructive evolution’’ with Pushpop GP [124], which co-evolve the search operators in addition to the individuals.”
BackgroundEvolving Bin Packing Heuristics with Genetic Programming
Burke, E. K., Hyde, M. R., & Kendall, G. (2006) · Lecture Notes in Computer Science · doi:10.1007/11844297_87 · Cited by 144 · cited 1×
“These questions have given rise to the search for better GP algorithms using GP, i.e., meta-GP (e.g., [94, 103,16]).”
BackgroundMeasuring bloat, overfitting and functional complexity in genetic programming
Vanneschi, L., Castelli, M., & Silva, S. (2010) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/1830483.1830643 · Cited by 144 · cited 1×
“Overfitting seems more related to the functional complexity of the proposed solutions [131, 137] rather than to their size.”
BackgroundSelf-citationFriedberg, R. M., Dunham, B., & North, J. H. (1959) · IBM Journal of Research and Development · doi:10.1147/rd.33.0282 · Cited by 140
Stadler, P. F. (2007) · Springer eBooks · doi:10.1007/3-540-45692-9_10 · Cited by 139
Semantic Building Blocks in Genetic Programming
McPhee, N. F., Ohs, B., & Hutchison, T. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-78671-9_12 · Cited by 137 · cited 1×
“Until quite recently the issue of semantics had been overlooked, and there is much promise in this early research to the development of a Semantic-Aware form of GP [11, 12, 39, 72, 82, 90, 91].”
BackgroundDynamic Scheduling with Genetic Programming
Jakobović, D., & Budin, L. (2006) · Lecture notes in computer science · doi:10.1007/11729976_7 · Cited by 136
Evolving Evolutionary Algorithms Using Linear Genetic Programming
Oltean, M. (2005) · Evolutionary Computation · doi:10.1162/1063656054794815 · Cited by 133 · cited 1×
“These questions have given rise to the search for better GP algorithms using GP, i.e., meta-GP (e.g., [94, 103,16]).”
BackgroundA critical note on experimental research methodology in EC
Eiben, A. E., & Jelasity, M. (2003) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2002.1006991 · Cited by 126 · cited 1×
“On the other hand, this issue in GP has not received the attention it deserves and only few papers dealing with the problem of generalization have appeared [26, 68].”
BackgroundGeneral Schema Theory for Genetic Programming with Subtree-Swapping Crossover: Part I
Poli, R., & McPhee, N. F. (2003) · Evolutionary Computation · doi:10.1162/106365603321829005 · Cited by 125
Time Series Forecasting for Dynamic Environments: The DyFor Genetic Program Model
Wagner, N., Michalewicz, Z., Khouja, M. J., & McGregor, R. R. (2007) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2006.882430 · Cited by 124 · cited 1×
“, [43, 50, 139]), there has been little analysis of the behaviour of GP in these environments.”
BackgroundPADO: A New learning Architecture For Object Recognition
Teller, A., & Veloso, M. (1997) · Oxford University Press eBooks · doi:10.1093/oso/9780195098709.003.0004 · Cited by 123
A Study of Fitness Distance Correlation as a Difficulty Measure in Genetic Programming
Tomassini, M., Vanneschi, L., Collard, P., & Clergue, M. (2005) · Evolutionary Computation · doi:10.1162/1063656054088549 · Cited by 121 · cited 4×
“Probably the two most interesting measures of problem hardness for GP, based on the concept of fitness landscape, that have been introduced so far are: fitness-distance correlation (FDC) [130,129] and negative slope coefficient (NSC) [136].”
BackgroundInfluentialSelf-citationSemantically driven crossover in genetic programming
Beadle, L., & Johnson, C. G. (2008) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2008.4630784 · Cited by 120 · cited 1×
“Until quite recently the issue of semantics had been overlooked, and there is much promise in this early research to the development of a Semantic-Aware form of GP [11, 12, 39, 72, 82, 90, 91].”
BackgroundWhat Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic Programming
Daida, J. M., Bertram, R. R., Stanhope, S. A., Khoo, J. C. H., Chaudhary, S. A., Chaudhri, O. A., & Polito, J. (2001) · Genetic Programming and Evolvable Machines · doi:10.1023/a:1011504414730 · Cited by 108 · cited 1×
“Even though elements like the presence or absence of particular structures in the population undoubtedly affect the ability of GP of solving problems more than what happens for GAs or for other optimization heuristics [20, 21], since the early studies of problem difficulty in GP (that date back to the work of Kinnear…”
BackgroundGenetic programming for computational pharmacokinetics in drug discovery and development
Archetti, F., Lanzeni, S., Messina, E., & Vanneschi, L. (2007) · Genetic Programming and Evolvable Machines · doi:10.1007/s10710-007-9040-z · Cited by 104
Self-citationThe Hierarchical Fair Competition (HFC) Framework for Sustainable Evolutionary Algorithms
Hu, J., Goodman, E. D., Seo, K., Fan, Z., & Rosenberg, R. C. (2005) · Evolutionary Computation · doi:10.1162/1063656054088530 · Cited by 103 · cited 1×
“Systems based on fitness layers or on age layers have shown considerable success in this context [45, 46].”
BackgroundEvolving Evolutionary Algorithms Using Linear Genetic Programming
Oltean, M. (2005) · Cited by 97
Grammatical bias for evolutionary learning
Whigham, P. A. (2022) · UNSWorks (University of New South Wales, Sydney, Australia) · doi:10.26190/unsworks/6784 · Cited by 96
Hansen, J. V., Lowry, P. B., Meservy, R. D., & McDonald, D. M. (2006) · Decision Support Systems · doi:10.1016/j.dss.2006.04.004 · Cited by 94 · cited 1×
“, [139,43,50]), there has been little analysis of the behaviour of GP in these environments.”
BackgroundOn the Locality of Grammatical Evolution
Rothlauf, F., & Oetzel, M. (2006) · Lecture notes in computer science · doi:10.1007/11729976_29 · Cited by 93
Two Self-Adaptive Crossover Operators for Genetic Programming
(1996) · The MIT Press eBooks · doi:10.7551/mitpress/1109.003.0009 · Cited by 91 · cited 1×
“, [3, 115, 125]), however this is still an open area of investigation (e.”
BackgroundExtending Particle Swarm Optimisation via Genetic Programming
Poli, R., Langdon, W. B., & Holland, O. E. (2005) · Lecture notes in computer science · doi:10.1007/978-3-540-31989-4_26 · Cited by 90 · cited 1×
“These questions have given rise to the search for better GP algorithms using GP, i.e., meta-GP (e.g., [94, 103,16]).”
BackgroundMaintaining the Diversity of Genetic Programs
Ekárt, A., & Németh, S. Z. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45984-7_16 · Cited by 86 · cited 1×
“While this is a reasonable task for GP mutation (the most common being some variations on the Levenshtein edit distance [40] and the structural distance [27]), this can be hard to obtain for GP crossover, because it would imply considering all the necessary next populations or, at least, to approximate them.”
BackgroundTheory and practice for efficient genetic programming
Vanneschi, L. (2004) · IRIS · Cited by 79
Self-citationAn Analysis of Diversity in Genetic Programming
Gustafson, S. (2004) · Nottingham ePrints (University of Nottingham) · Cited by 75
Self-citationGenetic Programming, Validation Sets, and Parsimony Pressure
Gagné, C., Schoenauer, M., Parizeau, M., & Tomassini, M. (2006) · Lecture notes in computer science · doi:10.1007/11729976_10 · Cited by 74
General Schema Theory for Genetic Programming with Subtree-Swapping Crossover: Part II
Poli, R., & McPhee, N. F. (2003) · Evolutionary Computation · doi:10.1162/106365603766646825 · Cited by 73
(1997) · doi:10.1093/oso/9780195098709.001.0001 · Cited by 72
The Royal Tree Problem, a Benchmark for Single and Multiple Population Genetic Programming
(1996) · The MIT Press eBooks · doi:10.7551/mitpress/1109.003.0021 · Cited by 71 · cited 1×
“Some attempts of defining new and tunably difficult test problems for GP have been made in [110] 350 Genet Program Evolvable Mach (2010) 11:339–363”
BackgroundLinear-Graph GP - A New GP Structure
Kantschik, W., & Banzhaf, W. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45984-7_8 · Cited by 70 · cited 1×
“Numerous alternative representations have also been proposed, including graph [128], strongly-typed [86], linear [14], linear-tree [52], and linear-graph [53].”
BackgroundSelf-citationFitness landscapes and difficulty in genetic programming
Kinnear, K. E. (2002) · doi:10.1109/icec.1994.350026 · Cited by 70
General Schema Theory for Genetic Programming with Subtree-Swapping Crossover
Poli, R. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45355-5_12 · Cited by 69
A genetic approach to the truck backer upper problem and the inter-twined spiral problem
Koza, J. R. (2003) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.1992.227324 · Cited by 65 · cited 2×
“The most well known of these methods is Koza’s Automatically Defined Functions (ADFs) [63].”
BackgroundMethodSurvey Of Evolutionary Automatic Programming
O’Neil, M., & Ryan, C. (2003) · Springer eBooks · doi:10.1007/978-1-4615-0447-4_2 · Cited by 63
Negative Slope Coefficient: A Measure to Characterize Genetic Programming Fitness Landscapes
Vanneschi, L., Tomassini, M., Collard, P., & Vérel, S. (2006) · Lecture notes in computer science · doi:10.1007/11729976_16 · Cited by 61 · cited 4×
“Probably the two most interesting measures of problem hardness for GP, based on the concept of fitness landscape, that have been introduced so far are: fitness-distance correlation (FDC) [130,129] and negative slope coefficient (NSC) [136].”
BackgroundInfluentialSelf-citationTheoretical results in genetic programming: the next ten years?
Poli, R., Vanneschi, L., Langdon, W. B., & McPhee, N. F. (2010) · Genetic Programming and Evolvable Machines · doi:10.1007/s10710-010-9110-5 · Cited by 61 · cited 3×
“along these lines are also discussed in the article [109].”
BackgroundInfluentialSelf-citationWhat Makes a Problem GP-Hard? Validating a Hypothesis of Structural Causes
Daida, J. M., Li, H., Tang, R., & Hilss, A. M. (2003) · Lecture notes in computer science · doi:10.1007/3-540-45110-2_60 · Cited by 59 · cited 1×
“Even though elements like the presence or absence of particular structures in the population undoubtedly affect the ability of GP of solving problems more than what happens for GAs or for other optimization heuristics [20, 21], since the early studies of problem difficulty in GP (that date back to the work of Kinnear…”
BackgroundEvolutionary design using grammatical evolution and shape grammars: designing a shelter
O’Neill, M., McDermott, J., Swafford, J. M., Byrne, J., Hemberg, E., Brabazon, A., Shotton, E., McNally, C., & Hemberg, M. (2010) · International Journal of Design Engineering · doi:10.1504/ijde.2010.032820 · Cited by 58
Self-citationA Linear Genetic Programming Approach to Intrusion Detection
Song, D. S., Heywood, M. I., & Zincir-Heywood, N. (2003) · Lecture notes in computer science · doi:10.1007/3-540-45110-2_125 · Cited by 56
Poli, R., & McPhee, N. F. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45355-5_11 · Cited by 55 · cited 1×
“– GP Theory : The development of an exact and general schema theory for GP [105– 107 , 77 ] undoubtably represents a very significant result.”
BackgroundRepeated Sequences in Linear Genetic Programming Genomes
Langdon, W. B., & Banzhaf, W. (2005) · Complex Systems · doi:10.25088/complexsystems.15.4.285 · Cited by 55 · cited 1×
“If one looks closely one can discover numerous pieces of code being repeatedly used in various places in the programs [70, 73].”
BackgroundSelf-citationLinear Genetic Programming (Genetic and Evolutionary Computation)
Brameier, M., & Banzhaf, W. (2006) · Springer eBooks · Cited by 54
Self-citationA Many Threaded CUDA Interpreter for Genetic Programming
Langdon, W. B. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-12148-7_13 · Cited by 54 · cited 1×
“, see [69])? – Usability of GP: Practitioners need an easily digestible form of GP.”
BackgroundThere Is a Free Lunch for Hyper-Heuristics, Genetic Programming and Computer Scientists
Poli, R., & Graff, M. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-01181-8_17 · Cited by 53 · cited 2×
“Hyperheuristics are demonstrating early potential to outperform classic GP, and in an exciting twist, theoretical analysis suggests that a Free Lunch may be possible through their adoption [101, 102].”
BackgroundBanzhaf, W., Francone, F. D., & Nordin, P. C. (1996) · Lecture notes in computer science · doi:10.1007/3-540-61723-x_994 · Cited by 53 · cited 1×
“compare its generalization ability with that of other ML paradigms and show in [8] the positive effect of an extensive use of the mutation operator on generalization in GP with sparse data sets.”
ResultSelf-citationImproving the Generalisation Ability of Genetic Programming with Semantic Similarity based Crossover
Uy, N. Q., Hiền, N. T., Hoài, N. X., & O’Neill, M. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-12148-7_16 · Cited by 52 · cited 1×
“Until quite recently the issue of semantics had been overlooked, and there is much promise in this early research to the development of a Semantic-Aware form of GP [39,12,72,82,11,91,90].”
BackgroundSelf-citationMultimodal Deceptive Functions.
Deb, K., Horn, J., & Goldberg, D. E. (1993) · Complex Systems · Cited by 50
Integrating generative growth and evolutionary computation for form exploration
O’Reilly, U.-M., & Hemberg, M. (2007) · Genetic Programming and Evolvable Machines · doi:10.1007/s10710-007-9025-y · Cited by 49
Linear-Tree GP and Its Comparison with Other GP Structures
Kantschik, W., & Banzhaf, W. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45355-5_24 · Cited by 49 · cited 1×
“Numerous alternative representations have also been proposed, including graph [128], strongly-typed [86], linear [14], linear-tree [52], and linear-graph [53].”
BackgroundSelf-citationAn Attribute Grammar Decoder for the 01 MultiConstrained Knapsack Problem
Cleary, R., & O’Neill, M. (2005) · Lecture notes in computer science · doi:10.1007/978-3-540-31996-2_4 · Cited by 49 · cited 1×
“Grammars themselves have also been used to encode semantic information in addition to the syntactic rules of the structure language [17, 57].”
Self-citationEvolving Genes to Balance a Pole
Nicolau, M., Schoenauer, M., & Banzhaf, W. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-12148-7_17 · Cited by 46 · cited 1×
“Recent investigations in this direction show considerable promise [88,92].”
BackgroundSelf-citationAutomatic Generation of Programs for Crawling and Walking
(2003) · The MIT Press eBooks · doi:10.7551/mitpress/1108.003.0021 · Cited by 46
Genetic programming bloat with dynamic fitness
Langdon, W. B., & Poli, R. (1998) · Lecture notes in computer science · doi:10.1007/bfb0055931 · Cited by 46 · cited 1×
“Examples have examined bloat [76], constant generation [25], and variable size populations for dynamic optimization [48, 132].”
BackgroundModularity in Evolution: Some Low-Level Questions
Altenberg, L. (2005) · Modularity · doi:10.7551/mitpress/4734.003.0012 · Cited by 45
An Analysis of Diversity of Constants of Genetic Programming
Ryan, C., & Keijzer, M. (2003) · Lecture notes in computer science · doi:10.1007/3-540-36599-0_38 · Cited by 44
Operator equalisation, bloat and overfitting: a study on human oral bioavailability prediction
Silva, S., & Vanneschi, L. (2009) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/1569901.1570051 · Cited by 44
Self-citationGoldberg, D. E., & O’Reilly, U.-M. (1998) · Lecture notes in computer science · doi:10.1007/bfb0055925 · Cited by 42 · cited 1×
“Until quite recently the issue of semantics had been overlooked, and there is much promise in this early research to the development of a SemanticAware form of GP [39,12,72,82,11,91,90].”
BackgroundConstant creation in grammatical evolution
Dempsey, I., O’Neill, M., & Brabazon, A. (2007) · International Journal of Innovative Computing and Applications · doi:10.1504/ijica.2007.013399 · Cited by 38 · cited 1×
“Ephemeral Random Constants (ERCs) are the standard approach to constants in GP, and a number of variations on the ERC approach have been proposed to overcome their limitations (e.g.,[125,3,115]), however this is still an open area of investigation (e.g., [24]).”
BackgroundSelf-citationTowards Automatic Discovery of Building Blocks in Genetic Programming
Rosea, J. (1995) · Cited by 37
Biocomputing and Emergent Computation
Lundh, D., Olsson, B. E., & Narayanan, A. (1997) · doi:10.1142/9789814529242 · Cited by 37
Generalization by neural networks
Shekhar, S., & Amin, M. B. (1992) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.134256 · Cited by 35 · cited 1×
“It is the case, for instance, of Artificial Neural Networks (see, among the many other references, [117]), or”
BackgroundFitness-proportional negative slope coefficient as a hardness measure for genetic algorithms
Poli, R., & Vanneschi, L. (2007) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/1276958.1277209 · Cited by 35 · cited 1×
“For instance, GAs’ experimental comparisons often use a mix of synthetic benchmarks, standard test problems and provably difficult ones, like those presented in [1, 23, 84, 108].”
BackgroundSelf-citationSemantic Similarity Based Crossover in GP: The Case for Real-Valued Function Regression
Uy, N. Q., O’Neill, M., Hoài, N. X., McKay, B., & Galván, E. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-14156-0_15 · Cited by 32 · cited 1×
“Until quite recently the issue of semantics had been overlooked, and there is much promise in this early research to the development of a Semantic-Aware form of GP [11, 12, 39, 72, 82, 90, 91].”
BackgroundSelf-citationKeijzer, M., Babovic, V., Ryan, C., O’Neill, M., & Cattolico, M. (2001) · Genetic and Evolutionary Computation Conference (GECCO) · Cited by 32
Self-citationFrancone, F. D., Nordin, P. C., & Banzhaf, W. (1996) · Cited by 31
Self-citationModularity in Genetic Programming
Woodward, J. R. (2003) · Lecture notes in computer science · doi:10.1007/3-540-36599-0_23 · Cited by 31 · cited 1×
“For tree-based GP, Woodward [146] showed that for a given problem, the minimum number of nodes in the main tree plus the nodes in any modules is independent of the primitive set (up to an additive constant) and depends only on the function being expressed.”
BackgroundSolving the ocean color problem using a genetic programming approach
Fonlupt, C. (2001) · Applied Soft Computing · doi:10.1016/s1568-4946(01)00007-2 · Cited by 31 · cited 1×
“At the current time, GP does not seem to be universally recognized as a mainstream and trusted problem solving strategy, despite the fact that in the last decade GP has been shown to outperform some of these methods in many important applications (see for instance [4, 13, 28, 32, 56, 78, 80, 148, 150]).”
BackgroundCrossover-Based Tree Distance in Genetic Programming
Gustafson, S., & Vanneschi, L. (2008) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2008.915993 · Cited by 31
Self-citationIntrons in Nature and in Simulated Structure Evolution
Norin, P., Banzahf, W., & Francone, F. D. (1997) · Cited by 30
Moore, J. H., Andrews, P. C., Barney, N., & White, B. C. (2008) · Springer eBooks · doi:10.1007/978-3-540-78757-0_12 · Cited by 30 · cited 1×
“Can we achieve open-ended evolution with GP, where, for example, a GP system forms the core part of a financial trading system required to continuously learn without being switched off? Would it be possible that that same system can adapt over time to a completely different problem? Notions of computational evolution…”
BackgroundRepeated patterns in genetic programming
Langdon, W. B., & Banzhaf, W. (2007) · Natural Computing · doi:10.1007/s11047-007-9038-8 · Cited by 29 · cited 1×
“If one looks closely one can discover numerous pieces of code being repeatedly used in various places in the programs [70, 73].”
BackgroundSelf-citationAn Evaluation of EvolutionaryGeneralisation in Genetic Programming
Kushchu, I. (2002) · Artificial Intelligence Review · doi:10.1023/a:1016379201230 · Cited by 28
A Grammatical Genetic Programming Approach to Modularity in Genetic Algorithms
Hemberg, E., Gilligan, C., O’Neill, M., & Brabazon, A. (2007) · Springer eBooks · doi:10.1007/978-3-540-71605-1_1 · Cited by 27 · cited 1×
“In [44] the authors state that the ability of GP to scale to problems of increasing difficulty operates on the premise that it is possible to capture regularities that exist in a problem environment by decomposition of the problem into a hierarchy of modules.”
BackgroundSelf-citationGenetic Programming Decision Tree for Bankruptcy Prediction
Lee, W.-C. (2006) · Advances in intelligent systems research/Advances in Intelligent Systems Research · doi:10.2991/jcis.2006.8 · Cited by 27 · cited 1×
“At the current time, GP does not seem to be universally recognized as a mainstream and trusted problem solving strategy, despite the fact that in the last decade GP has been shown to outperform some of these methods in many important applications (see for instance [4, 13, 28, 32, 56, 78, 80, 148, 150]).”
BackgroundNeutrality and variability: two sides of evolvability in linear genetic programming
Hu, T., & Banzhaf, W. (2009) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/1569901.1570033 · Cited by 26 · cited 1×
“evolutionary biology simulations, what has been termed computational evolution [7], suggest that EC/evolution could work efficiently ‘‘because’’ of dynamic environments and not ‘‘despite of’’ them [55], and that modularity can spontaneously arise, promoting hierarchical decomposition of a problem, because the environm…”
BackgroundSelf-citationIntroducing probabilistic adaptive mapping developmental genetic programming with redundant mappings
Wilson, G. C., & Heywood, M. I. (2007) · Genetic Programming and Evolvable Machines · doi:10.1007/s10710-007-9027-9 · Cited by 26
Time series forecasting using massively parallel genetic programming
Eklund, S. E. (2004) · Proceedings - IEEE International Parallel and Distributed Processing Symposium · doi:10.1109/ipdps.2003.1213272 · Cited by 25 · cited 1×
“At the current time, GP does not seem to be universally recognized as a mainstream and trusted problem solving strategy, despite the fact that in the last decade GP has been shown to outperform some of these methods in many important applications (see for instance [4, 13, 28, 32, 56, 78, 80, 148, 150]).”
BackgroundEvolving High-Speed, Easy-to-Understand Network Intrusion Detection Rules with Genetic Programming
Orfila, A., Tapiador, J., & Ribagorda, A. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-01129-0_11 · Cited by 24 · cited 1×
“More recently GP experimental studies have appeared using classification of network intrusion (see for instance [99, 122]), etc.”
BackgroundFree lunches for function and program induction
Poli, R., Graff, M., & McPhee, N. F. (2009) · doi:10.1145/1527125.1527148 · Cited by 22 · cited 1×
“Hyperheuristics are demonstrating early potential to outperform classic GP, and in an exciting twist, theoretical analysis suggests that a Free Lunch may be possible through their adoption [101, 102].”
BackgroundUsing crossover based similarity measure to improve genetic programming generalization ability
Vanneschi, L., & Gustafson, S. (2009) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/1569901.1570054 · Cited by 18 · cited 1×
“Finally, it has recently been successfully used to improve GP generalization ability by means of the introduction of population repulsors [133].”
MethodSelf-citationMoore, J. H., Greene, C. S., Andrews, P. C., & White, B. C. (2008) · Genetic and evolutionary computation · doi:10.1007/978-0-387-87623-8_9 · Cited by 17
Genetic Programming for Automatic Stress Detection in Spoken English
Xie, H., Zhang, M., & Andreae, P. M. (2006) · Lecture notes in computer science · doi:10.1007/11732242_41 · Cited by 16 · cited 1×
“At the current time, GP does not seem to be universally recognized as a mainstream and trusted problem solving strategy, despite the fact that in the last decade GP has been shown to outperform some of these methods in many important applications (see for instance [4, 13, 28, 32, 56, 78, 80, 148, 150]).”
BackgroundThe Role of Population Size in Rate of Evolution in Genetic Programming
Hu, T., & Banzhaf, W. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-01181-8_8 · Cited by 16 · cited 1×
“Examples have examined bloat [76], constant generation [25], and variable size populations for dynamic optimization [48, 132].”
BackgroundSelf-citationOperator-Based Distance for Genetic Programming: Subtree Crossover Distance
Gustafson, S., & Vanneschi, L. (2005) · Lecture notes in computer science · doi:10.1007/978-3-540-31989-4_16 · Cited by 16 · cited 2×
“For this reason, the similarity/dissimilarity measure defined in [41, 42, 134] works by calculating the probability of correctly applying the operator once.”
BackgroundMethodSelf-citationGenetic Programming Bloat without Semantics
Langdon, W. B., & Banzhaf, W. (2000) · Lecture notes in computer science · doi:10.1007/3-540-45356-3_20 · Cited by 15 · cited 1×
“Until quite recently the issue of semantics had been overlooked, and there is much promise in this early research to the development of a SemanticAware form of GP [39,12,72,82,11,91,90].”
BackgroundSelf-citationCosta, L. E. D., & Landry, J.-A. (2006) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/1143997.1144158 · Cited by 15
Evolving Control Structures with Automatically Defined Macros
Spector, L. C. (2001) · Cited by 14
Using Subtree Crossover Distance to Investigate Genetic Programming Dynamics
Vanneschi, L., Gustafson, S., & Mauri, G. (2006) · Lecture notes in computer science · doi:10.1007/11729976_21 · Cited by 14 · cited 2×
“For this reason, the similarity/dissimilarity measure defined in [41, 42, 134] works by calculating the probability of correctly applying the operator once.”
BackgroundMethodSelf-citationGenetic Programming for Object Detection: A Two-Phase Approach with an Improved Fitness Function
Zhang, M., Bhowan, U., & Ny, B. (2007) · ELCVIA Electronic Letters on Computer Vision and Image Analysis · doi:10.5565/rev/elcvia.135 · Cited by 13
Rapid prediction of optimum population size in genetic programming using a novel genotype -
Wedge, D. C., & Kell, D. B. (2008) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/1389095.1389346 · Cited by 11 · cited 1×
“A first attempt in this direction has recently been presented in [140].”
BackgroundMulti-optimization improves genetic programming generalization ability
Vanneschi, L., Rochat, D., & Tomassini, M. (2007) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/1276958.1277309 · Cited by 11 · cited 1×
“In this perspective, multi-optimization is becoming more and more popular to counteract overfitting in GP, where different expressions of the functional complexity of the solution or other criteria are used as further objectives [38, 135, 137].”
BackgroundSelf-citationLangdon, W. B. (1998) · Springer eBooks · doi:10.1007/978-1-4615-5731-9_1 · Cited by 11
Recent Patents on Genetic Programming
O’Neill, M., & Brabazon, A. (2009) · Recent Advances in Computer Science and Communications · doi:10.2174/1874479600902010043 · Cited by 8
Self-citationKeller, R. E., & Poli, R. (2008) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2008.4631224 · Cited by 8 · cited 2×
“A relatively new departure in the field, meta-GP has exhibited potential to find better GP algorithms to solve a class of problems (e.g. Travelling Salesman [58]), and some recent theoretical analysis suggests that the normal rules of the No Free Lunch theory may not apply to meta-search [101].”
BackgroundImproving modularity in genetic programming using graph-based data mining
Jónyer, I., & Himes, A. (2006) · Cited by 6
Variable size population for dynamic optimization with genetic programming
Vanneschi, L., & Cuccu, G. (2009) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/1569901.1570222 · Cited by 6
Self-citationFunctional reconstruction of dynamical systems from time series using genetic programming
McConaghy, T., Leung, H., & Varadan, V. (2002) · Proceedings of the Annual Conference of the IEEE Industrial Electronics Society · doi:10.1109/iecon.2000.972588 · Cited by 6 · cited 1×
“At the current time, GP does not seem to be universally recognized as a mainstream and trusted problem solving strategy, despite the fact that in the last decade GP has been shown to outperform some of these methods in many important applications (see for instance [4, 13, 28, 32, 56, 78, 80, 148, 150]).”
BackgroundEditorial to special issue on evolutionary computation in dynamic and uncertain environments
Yang, S., Ong, Y.-S., & Jin, Y. (2006) · Genetic Programming and Evolvable Machines · doi:10.1007/s10710-006-9016-4 · Cited by 5 · cited 1×
“Despite the existence of a recent special issue in the Genetic Programming and Evolvable Machines Journal on Dynamic environments [149], none of the four articles actually dealt with GP directly.”
Background(2009) · Institute of Electrical and Electronics Engineers eBooks · doi:10.1109/9780470544600.ch5 · Cited by 5 · cited 2×
“structures [30] a variety of representations have been explored including binary string machine code [35], finite state automata [31], generative grammatical encodings [25, 97, 142, 143] and the dominant tree-based form popularised by Koza [62].”
Background(1996) · The MIT Press eBooks · doi:10.7551/mitpress/3242.003.0012 · Cited by 5 · cited 1×
“In [34] the authors use what they called the ‘‘Compiling GP System’’ to”
An Evolutionary Framework for Colorimetric Characterization of Scanners
Bianco, S., Gasparini, F., Schettini, R., & Vanneschi, L. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-78761-7_25 · Cited by 4 · cited 1×
“At the current time, GP does not seem to be universally recognized as a mainstream and trusted problem solving strategy, despite the fact that in the last decade GP has been shown to outperform some of these methods in many important applications (see for instance [4, 13, 28, 32, 56, 78, 80, 148, 150]).”
BackgroundSelf-citationBanzhaf, W. (2000) · Genetic Programming and Evolvable Machines · doi:10.1023/a:1010026829303 · Cited by 3
Self-citationEditorial Introduction to the First Issue
Schreibman, S. (2011) · Journal of the Text Encoding Initiative · doi:10.4000/jtei.229 · Cited by 1 · cited 1×
“GP is concerned with the behavior and evolution of software or algorithmic entities [6], and even the physical embodiment of these entities, such as the case may be in robots or electronic circuits.”
Background
Research works printed but not linked: 7
- 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
- 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
- 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
- W. B. Langdon, W. Banzhaf, Repeated patterns in genetic programming. Nat. Comput. 7(4), 589–613 (2008, Dec) · DOI
- T. Mitchell, Machine Learning (McGraw Hill, New York, 1996)
- 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
- 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
Mathematical discoveries from program search with large language models
Romera-Paredes, B., Barekatain, M., Novikov, A., Balog, M., Kumar, M. P., Dupont, E., Ruiz, F. J. R., Ellenberg, J. S., Wang, P., Fawzi, O., et al. (2024) · Nature · doi:10.1038/s41586-023-06924-6 · Cited by 544
“However, using an LLM mitigates several issues in traditional genetic programming 51 , as shown in Supplementary Information Appendix A and discussed in ref.”
BackgroundMethodResultInfluentialPMLB: a large benchmark suite for machine learning evaluation and comparison
Olson, R. S., La Cava, W., Orzechowski, P., Urbanowicz, R. J., & Moore, J. H. (2017) · BioData Mining · doi:10.1186/s13040-017-0154-4 · Cited by 365
Genetic programming needs better benchmarks
McDermott, J., White, D. R., Luke, S., Manzoni, L., Castelli, M., Vanneschi, L., Jaskowski, W., Krawiec, K., Harper, R., De Jong, K., et al. (2012) · Proceedings of the 14th annual conference on Genetic and evolutionary computation · doi:10.1145/2330163.2330273 · Cited by 270
“Devising a good benchmark suite has been recognized as an important issue for the next ten years of GP [49].”
BackgroundSelf-citationBetter GP benchmarks: community survey results and proposals
White, D. R., McDermott, J., Castelli, M., Manzoni, L., Goldman, B. W., Kronberger, G., Jaśkowski, W., O’Reilly, U.-M., & Luke, S. (2013) · Genetic Programming and Evolvable Machines · doi:10.1007/s10710-012-9177-2 · Cited by 231
A review of machine learning applications to coastal sediment transport and morphodynamics
Goldstein, E. B., Coco, G., & Plant, N. G. (2019) · Earth-Science Reviews · doi:10.1016/j.earscirev.2019.04.022 · Cited by 222
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
- green
- hdl.handle.net
- 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
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.