Genetic programming as a means for programming computers by natural selection
The DOI matches its Crossref record; 38 of the 38 references it cites were found in a registry or an index.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
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?
In the citing paper
“Indeed, genetic programming methods require defining several parameters, chief among them the set of allowed mutation operations (or primitives)15.”
From Mathematical discoveries from program search with large language models (2024) · cites this paper as [15]
Citations
Cites
Holland, J. H. (1992) · The MIT Press eBooks · doi:10.7551/mitpress/1090.001.0001 · Cited by 47,002 · cited 2×
“John Holland's pioneering book Adaptation in Natural and Artificial Systems described how the evolutionary process in nature can be applied to artificial systems using the genetic algorithm operating on fixed-length character strings ( Holland, 1975 ).”
BackgroundMethodGenetic Algorithms in Search, Optimization and Machine Learning
Goldberg, D. E., & Robson, D. (1988) · Cited by 18,391
Genetic Programming: On the Programming of Computers by Means of Natural Selection
Koza, J. R. (1992) · Medical Entomology and Zoology · Cited by 13,082
Self-citationGenetic Algorithms + Data Structures = Evolution Programs
Michalewicz, Z. (1992) · Artificial Intelligence · doi:10.1007/978-3-662-02830-8 · Cited by 11,553
Goldberg, D. E. (1989) · Medical Entomology and Zoology · Cited by 10,109
A robust layered control system for a mobile robot
Brooks, R. (1986) · IEEE Journal on Robotics and Automation · doi:10.1109/jra.1986.1087032 · Cited by 7,799
Handbook of Genetic Algorithms
Davis, L. D. (1991) · Cumulative Index of Computer Aided Architectural Design · Cited by 7,330
Some Studies in Machine Learning Using the Game of Checkers
Samuel, A. L. (1959) · IBM Journal of Research and Development · doi:10.1147/rd.33.0210 · Cited by 4,443
Induction: Processes of Inference, Learning, and Discovery
Holland, J. H., Holyoak, K. J., Nisbett, R. E., Thagard, P. R., & Smoliar, S. W. (1987) · IEEE Expert · doi:10.1109/mex.1987.4307100 · Cited by 2,305
Genetic Algorithms and Simulated Annealing
Davis, L. D. (1987) · Cited by 1,759
Cited by
Items 901–1,000 of 1,003
A New Cooperative Recourse Strategy for Emergency Material Allocation in Uncertain Environments
Liu, Y., Wang, S., & Li, X. (2022) · Frontiers in Physics · doi:10.3389/fphy.2022.835412 · Cited by 5
“In GP, populations of computer programs are genetically bred using the Darwinian principle of survival of the fittest and using a genetic crossover operator appropriate for genetically mating computer programs [21].”
MethodMabrouk, E., Raslan, Y., & Hedar, A.-R. (2022) · Electronics · doi:10.3390/electronics11070982 · Cited by 5
“Then, this work became popularized via a search technique created by John Koza in the 1990s [5,6].”
MethodSimplifying Fitness Landscapes Using Dilation Functions Evolved With Genetic Programming
Papetti, D. M., Tangherloni, A., Farinati, D., Cazzaniga, P., & Vanneschi, L. (2023) · IEEE Computational Intelligence Magazine · doi:10.1109/mci.2022.3222096 · Cited by 5
“Genetic Programming GP is a family of EC approaches that evolve a population of computer programs [32], [33].”
BackgroundMethodInfluentialBordin, A., Tibamoso-Pedraza, G., Miró, J., & Duong, L. (2023) · International Journal of Computer Assisted Radiology and Surgery · doi:10.1007/s11548-023-02878-2 · Cited by 5
Angelis, D., Sofos, F. D., Papastamatiou, K., & Karakasidis, T. E. (2023) · Micromachines · doi:10.3390/mi14071446 · Cited by 7
“More details on the method can be found in [14,45].”
Advances in Solar Photovoltaic Energy Systems
Abdelaziz, A. Y., Mossa, M. A., & Ouanjli, N. E. (2024) · IntechOpen eBooks · doi:10.5772/intechopen.111228 · Cited by 6
Enhancing Adaptive Differential Evolution Algorithms with Rank-Based Mutation Adaptation
León, M., & Xiong, N. (2018) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2018.8477879 · Cited by 5
“There are many EAs but the most important ones are Differential Evolution [2], [3], Genetic Algorithm [4] and Genetic programing [5].”
BackgroundTwo New Beetle Antennae Search (BAS) Algorithms and Their Comparative Investigation
Lin, Z., Ma, S., Ma, X., Jiang, X., & Li, S. (2018) · International Journal of Robotics and Control · doi:10.5430/ijrc.v2n1p9 · Cited by 5
“Like Genetic Algorithm (GA) [7] and Genetic Programming [8] based on evolutionary algorithms, Black Hole algorithm [9] and Simulated Annealing algorithm [10] based on physics-based algorithm, and swarm-based algorithm such as Particle Swarm Optimization (PSO) algorithm [11] and Ant Colony…”
MethodFusion is Great, and Interpretable Fusion could be Exciting for Theory Generation: Response to Pater
Pearl, L. (2019) · Language · doi:10.1353/lan.2019.0017 · Cited by 5
Bang, H., & Selva, D. (2019) · Expert Systems with Applications · doi:10.1016/j.eswa.2019.113025 · Cited by 5
Global Best Guided Crow Search Algorithm for Optimization Problems
Roy, R., Sahu, T. P., Nagwani, N. K., & Das, S. (2020) · Algorithms for intelligent systems · doi:10.1007/978-981-15-8045-1_2 · Cited by 5
Szeląg, B., Kiczko, A., Musz-Pomorska, A., Widomski, M. K., Zaburko, J., Łagód, G., Stránský, D., & Sokáč, M. (2021) · Water · doi:10.3390/w13081035 · Cited by 5
Saberi, S., Hosseini, A. S., Yazdanifar, F., & Castro, S. G. P. (2022) · Polymers · doi:10.3390/polym14081559 · Cited by 5
“Genetic programming (GP), first introduced by Koza [46], is a powerful algorithm for predicting meaningful relationships between input and output variables [47–50].”
BackgroundAnt colony systems optimization applied to BNF grammars rule derivation (ACORD algorithm)
López, L. F. D. M., Blas, N. G., & Lucas, C. M. (2020) · Soft Computing · doi:10.1007/s00500-020-04670-9 · Cited by 8
Gemini: Dynamic Bias Correction for Autonomous Experimentation and Molecular SimulationPreprint
Hickman, R. J., Häse, F., Roch, L. M., & Aspuru‐Guzik, A. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2103.03391 · Cited by 7
Protein Optimization Evolving Tool (POET) based on Genetic ProgrammingPreprint
Bricco, A. R., Miralavy, I., Bo, S., Perlman, O., Farrar, C. T., McMahon, M. T., Banzhaf, W., & Gilad, A. A. (2022) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2022.03.05.483103 · Cited by 5
Li, L., Zhang, H. M., & Bai, S. (2024) · International Journal of Production Research · doi:10.1080/00207543.2024.2392626 · Cited by 4
“Therefore, the depth range of a tree is usually limited to 2 to 6 (Koza 1994).”
Wu, Y., Wang, Y., & Hu, L. (2025) · Computers and Geotechnics · doi:10.1016/j.compgeo.2025.107659 · Cited by 4
Islam, F., & Imteaz, M. A. (2023) · Climate Dynamics · doi:10.1007/s00382-023-06764-0 · Cited by 4
“Despite the successful application of ANN in capturing non-linear mechanisms, researchers are often reluctant to use ANN on broad scales due to its consequential fundamental disadvantages.”
InfluentialComparing Proficiency of ChatGPT and Bard in Software Development
Kim, D. (2024) · Springer eBooks · doi:10.1007/978-3-031-55642-5_2 · Cited by 6
Chandran, V., & Mohapatra, P. (2024) · Journal of Industrial and Management Optimization · doi:10.3934/jimo.2024095 · Cited by 4
Discovering chemistry to creep rupture equations in Alloy 617 with machine learning
Hossain, M. A., Hao, L., Xiong, W., & Stewart, C. M. (2025) · Scientific Reports · doi:10.1038/s41598-025-89743-1 · Cited by 5
“The gene has a tree structure that consists of mathematical expressions (+ , − , × , ÷ , sinh , cosh , tanh , exp , etc. ) and constants 45,46 .”
Mathematical expression exploration with graph representation and generative graph neural network
Liu, J., Li, W., Yu, L., Wu, M., Li, W., Li, Y., & Hao, M. (2025) · Neural Networks · doi:10.1016/j.neunet.2025.107405 · Cited by 6
Swarm-based Cost-sensitive Decision Tree Using Optimized Rules for Imbalanced Data Classification
Mansouri, M., Nadimi-Shahraki, M. H., & Beheshti, Z. (2025) · Journal of Bionic Engineering · doi:10.1007/s42235-025-00673-0 · Cited by 4
“Examples of meta-heuristics are the Genetic Algorithm [ 60 ], Ant Colony Optimization [ 61], and Particle Swarm Optimization [ 62], evolutionary programming [63], and genetic programming [64].”
Topology Derivation Method of DC/DC Converter With Wide Third-Order Voltage Conversion Ratio
Dong, M., He, H., Zhou, J., Wu, Z., Song, D., Liang, R., Li, L., Xu, C., & Sui, Y. (2025) · IEEE Transactions on Power Electronics · doi:10.1109/tpel.2025.3559185 · Cited by 4
Diversity-enhanced hyper-heuristics for multi-objective dynamic flexible job shop scheduling
Shi, Y., Yang, Y., Li, B., Qian, H., Hao, H., & Zhou, A. (2025) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2025.101994 · Cited by 4
Duarte, B. P. M., & Moura, M. J. (2025) · Processes · doi:10.3390/pr13071981 · Cited by 4
Zak, J. A., Fezer, A., & Weißenfels, C. (2025) · Welding in the World · doi:10.1007/s40194-025-02110-6 · Cited by 4
Advances in forecasting of harmful algal blooms in freshwater ecosystems
Campbell, K. G., & Vinebrooke, R. D. (2025) · Environmental Reviews · doi:10.1139/er-2025-0136 · Cited by 4
Qiao, Y., Han, Z., Fu, H., & Gao, Y. (2025) · Biomimetics · doi:10.3390/biomimetics10110788 · Cited by 7
“…[22], Biogeography-Based Optimization (BBO) [23], Artificial Infectious Disease (AID) [24], Genetic Algorithm (GA) [25], Genetic Programming (GP) [26], Fungal Growth Optimizer (FGO) [27], Evolutionary Programming (EP) [28], Differential Evolution (DE) [29], Black Widow Optimization (BWO) [30],…”
Manti, S., Tsai, P.-H., Lucantonio, A., & Iliescu, T. (2025) · Journal of Computational Physics · doi:10.1016/j.jcp.2025.114298 · Cited by 4
Yin, B., Ånestad, A., Æsøy, E., Worth, N. A., & Li, L. K. B. (2025) · Combustion and Flame · doi:10.1016/j.combustflame.2025.114711 · Cited by 4
Martins, G. S. M., GABARDO, A. M. P., Stein, A. O., Oliveira, J. L. G., Jaskowiak, P. A., & de Paiva, K. V. (2026) · Applied Thermal Engineering · doi:10.1016/j.applthermaleng.2026.130506 · Cited by 4
Assessment of machine learning models for predicting the deflection of concrete beams
Sivasuriyan, A., Vijayan, D. S., Трач, Р., Bayat, H., Góral, A. S., Piętocha, A., & Koda, E. (2026) · Scientific Reports · doi:10.1038/s41598-026-47819-6 · Cited by 4
“Genetic Programming is a branch of Genetic Algorithms (GA) that imitates the Darwinian theory, as improved by Koza 27 .”
Al-Helali, B. M., Chen, Q., Xue, B., & Zhang, M. (2021) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec45853.2021.9504767 · Cited by 4
Discovering Non-Linear Boolean Functions by Evolving Walsh Transforms with Genetic Programming
Rovito, L., Lorenzo, A. D., & Manzoni, L. (2023) · Algorithms · doi:10.3390/a16110499 · Cited by 4
Ha, S., Hwang, G., & Kim, S. (2024) · Mathematical Models and Methods in Applied Sciences · doi:10.1142/s0218202524400104 · Cited by 4
Interpretable Machine Learning Models for Practical Antimonate Electrocatalyst Performance
Deo, S., Kreider, M. E., Kamat, G. A., Hubert, M. A., Zeledon, J. A. Z., Wei, L., Matthews, J. E., Keyes, N., Singh, I., Jaramillo, T. F., et al. (2024) · ChemPhysChem · doi:10.1002/cphc.202400010 · Cited by 4
Zhang, W., Shi, P., Zhao, H., Wang, Z., & Jia, P. (2024) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2024.108356 · Cited by 4
On efficient modeling of drain current for designing high-power GaN HEMT-based circuits
Jarndal, A., Rakib, F. R., & Alim, M. A. (2024) · Journal of Computational Electronics · doi:10.1007/s10825-024-02225-x · Cited by 4
“Some of these algorithms include genetic algorithm optimization (GAO) [18], genetic programming (GP) [19], differential evolution (DE) [20] and evolution programming (EP) [21].”
Byeon, J., Ha, S., Hwang, G., Ko, D., & Yoon, J. (2025) · Mathematical Models and Methods in Applied Sciences · doi:10.1142/s0218202525400032 · Cited by 12
MOGGP: A novel multi objective geometric genetic programming model for drought forecasting
Mehr, A. D., Jabarnejad, M., & Safari, M. J. S. (2025) · Physics and Chemistry of the Earth Parts A/B/C · doi:10.1016/j.pce.2025.103879 · Cited by 4
NEEP-ADF: Neuro-encoded expression programming with automatically defined functions
Ma, J., Shan, H., Sun, F., Wang, L., Liu, S., Zhu, H., Gao, F., Zheng, J., Yang, B., & Li, Q. (2025) · Information Sciences · doi:10.1016/j.ins.2025.121957 · Cited by 5
Özbayrak, A. (2025) · Structures · doi:10.1016/j.istruc.2025.108323 · Cited by 4
Rajasekar, P., & Jayalakshmi, M. (2025) · OPSEARCH · doi:10.1007/s12597-025-00908-y · Cited by 4
“Among the renowned algorithms are the genetic algorithm (GA) [6], genetic programming (GP) [7], evolutionary programming (EP) [8], evolution strategies (ES) [9], and differential evolution (DE) [10].”
Naser, M. Z., & Naser, A. Z. (2025) · The Journal of Supercomputing · doi:10.1007/s11227-025-07132-x · Cited by 4
“Some of the notable researchers who pioneered GAs include Koza [21] and Holland [22].”
Explainable models for predicting crab weight based on genetic programming
Shi, T., Meng, L., Deng, L., & Li, J. (2025) · Ecological Informatics · doi:10.1016/j.ecoinf.2025.103131 · Cited by 6
Li, T., Yang, Z., Cui, J., Chen, W., Almatani, R. A., & Wu, Y. (2025) · Scientific Reports · doi:10.1038/s41598-025-00786-w · Cited by 11
“GP in SR employs strategies of reproduction, mutation, and survival of the fittest to generate and refine populations of mathematical formulas 79 .”
Lu, L., Zarei, M., & Moghimi, S. (2025) · Engineering Fracture Mechanics · doi:10.1016/j.engfracmech.2025.111334 · Cited by 4
A self-adaptive Mate Choice model for Symbolic Regression
Leitão, A., Neves, J. C., & Machado, P. (2013) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2013.6557547 · Cited by 4
“The Koza-1 instance is regarded as a particularly easy instance for symbolic regression [28] which may explain the results obtained, specially if the large size of the population is considered.”
BackgroundInfluentialEvolving the Controller of Automated Steering of a Car in Slippery Road Conditions
Alekseeva, N., Tanev, I., & Shimohara, K. (2018) · Algorithms · doi:10.3390/a11070108 · Cited by 5
“With an appropriate tuning of the relevant gain coefficients (depending on the specific features of the physical model of the particular car), on dry roads the servo-control could achieve a steering behavior that is very similar to that of a human driver in adequate cognitive condition [12].”
New model for compressive strength loss of lightweight concrete exposed to elevated temperatures
Kurtoğlu, A. E., & Bakbak, D. (2019) · Thermal Science · doi:10.2298/tsci181030042k · Cited by 4
“Symbolic regression is evolutionary computing-based method for exploring the space of mathematical formulations while minimizing numerous error metrics [22].”
MethodWang, R., Shen, Y., Wang, W., & Shi, L. (2020) · IEEE International Conference on Automation Science and Engineering (CASE) · doi:10.1109/case48305.2020.9216748 · Cited by 4
“Basically, GP is an evolutionary computation framework to find the best fit individual computer programs to solve various decision problems [18].”
BackgroundAl-Helali, B. M., Chen, Q., Xue, B., & Zhang, M. (2020) · IEEE Symposium Series on Computational Intelligence (SSCI) · doi:10.1109/ssci47803.2020.9308382 · Cited by 5
“While traditional regression works by estimating the parameters of pre-defined models, symbolic regression finds both the fittest mathematical model and its parameters simultaneously [3].”
MethodDynamic Generation of Investment Recommendations Using Grammatical Evolution.
Martín, C., Quintana, D., & Isasi, P. (2021) · International Journal of Interactive Multimedia and Artificial Intelligence · doi:10.9781/ijimai.2021.04.007 · Cited by 4
Trends of Evolutionary Machine Learning to Address Big Data Mining
Hamida, S. B., Benjelloun, G., & Hmida, H. (2021) · Lecture notes in business information processing · doi:10.1007/978-3-030-85977-0_7 · Cited by 4
Personality Prediction with Hybrid Genetic Programming using Portable EEG Device
Bhardwaj, H., Tomar, P., Sakalle, A., Sakalle, M., Asthana, R., Bhardwaj, A., & Ibrahim, W. (2022) · Computational Intelligence and Neuroscience · doi:10.1155/2022/4867630 · Cited by 4
Interpretable data-driven solar power plant trading strategies
Parginos, K., Bessa, R. J., Camal, S., & Kariniotakis, G. (2022) · IEEE PES Innovative Smart Grid Technologies Europe · doi:10.1109/isgt-europe54678.2022.9960432 · Cited by 4
Zhao, W., Zhang, H., Zhang, Z., Zhang, K., & Wang, L. (2022) · Water · doi:10.3390/w14193035 · Cited by 4
“Other EBs are genetic programming (GP) [13], evolution strategies (ES) [14] and evolutionary programming (EP) [15].”
BackgroundFan, Q., Bi, Y., Xue, B., & Zhang, M. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-22695-3_21 · Cited by 4
Ghasemi, A., Kabak, K. E., & Heavey, C. (2022) · Winter Simulation Conference · doi:10.1109/wsc57314.2022.10015436 · Cited by 4
“More specifically, by using the evolutionary algorithms, GP tries to learn a mathematical function through approximation of the relationship between the input and the output data, i.e., symbolic regression (Koza 1994).”
MethodMonitors That Learn From Failures: Pairing STL and Genetic Programming
Brunello, A., Monica, D. D., Montanari, A., Saccomanno, N., & Urgolo, A. (2023) · IEEE Access · doi:10.1109/access.2023.3277620 · Cited by 4
“As for ϕ , it is generated following DEAP’s genHalfAnd-Half method, which outputs a random tree with a maximum height of 6, as suggested by Koza in his seminal work [40].”
MethodAutomated Kinetic Model Discovery – A Methodological Framework
Servia, M. Á. D. C., Sandoval, I. O., Zhang, D., Hellgardt, K., Hii, K. K., & del Rio‐Chanona, E. A. (2023) · Computer-aided chemical engineering/Computer aided chemical engineering · doi:10.1016/b978-0-443-15274-0.50006-8 · Cited by 4
A Behavioral Model for Lithium Batteries based on Genetic Programming
Capua, G. D., Oliva, N., Milano, F., Bourelly, C., Porpora, F., Maffucci, A., & Femia, N. (2023) · IEEE International Symposium on Circuits and Systems proceedings · doi:10.1109/iscas46773.2023.10181456 · Cited by 4
“Some limitations of MLAs can be overcome by Genetic Programming Algorithms (GPAs) [9], which have been recently proposed in literature for BMs generation in power magnetic components [10] and wireless power systems [11] modeling problems.”
BackgroundAn Analytical Model for Lithium-Ion Batteries Based on Genetic Programming Approach
Milano, F., Capua, G. D., Oliva, N., Porpora, F., Bourelly, C., Ferrigno, L., & Laracca, M. (2023) · IEEE International Workshop on Metrology for Automotive (MetroAutomotive) · doi:10.1109/metroautomotive57488.2023.10219104 · Cited by 4
“The population of a GP algorithm is composed of models [7].”
BackgroundMethodErdağı, İ. G., Dobrota, N., Gavric, S., & Stevanović, A. (2023) · International Conference on Models and Technologies for Intelligent Transportation Systems (MT-ITS) · doi:10.1109/mt-its56129.2023.10241732 · Cited by 4
“Based on the values recommended in the previous studies [31], a practical range was considered for each parameter to find the best setting value.”
MethodShort Time Series Forecasting Method Based on Genetic Programming and Kalman Filter
Kone, L. A., Leonteva, A. O., Diallo, M. T., Haouba, A., & Collet, P. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-44355-8_6 · Cited by 4
Multimodal Multiple Federated Feature Construction Method for IoT Environments
Mahanipour, A., & Khamfroush, H. (2023) · Globecom · doi:10.1109/globecom54140.2023.10436777 · Cited by 4
“Genetic programming (GP) is mostly used for constructing either one or multiple new features [8].”
Automated Metaheuristic Algorithm Design With Autoregressive Learning
Zhao, Q. G., Liu, T., Bai, Y., Duan, Q., Yang, J. M., & Shi, Y. (2024) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2024.3464677 · Cited by 19
“Offline hyperheuristics adopt high-level heuristics/metaheuristics, e.g., genetic programming [14], to generate low-level metaheuristic algorithms.”
Gonzalez, G. M., Cortina, J. P. R., de Sousa, J. R. M., & Sagrilo, L. V. S. (2018) · Mathematical Problems in Engineering · doi:10.1155/2018/1040973 · Cited by 4
Multi-objective genetic programming with partial sampling and its extension to many-objective
Ohki, M. (2019) · SN Applied Sciences · doi:10.1007/s42452-019-0208-y · Cited by 4
“A technique of genetic programming (GP) [17, 18] is an algorithm to optimize structured data based on a evolutionary algorithm (EA) [11, 25].”
MethodDaily predictions of solar radiation utilizing genetic programming techniques
Nadya, R. U. K., Ahmed, A. N., Omran, A. A. B., Mardhiah, N. A., El-Shafie, A., & El‐Shafie, A. (2020) · Indonesian Journal of Electrical Engineering and Computer Science · doi:10.11591/ijeecs.v19.i2.pp900-905 · Cited by 4
Parametrized Model Predictive Control Approaches for Urban Traffic Networks
Jeschke, J., & Schutter, B. D. (2021) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2021.06.034 · Cited by 4
Multi-gene genetic programming expressions for simulating solute transport in fractures
Khafagy, M., El-Dakhakhni, W. W., & Dickson‐Anderson, S. E. (2021) · Journal of Hydrology · doi:10.1016/j.jhydrol.2021.127316 · Cited by 4
Ekmekcioğlu, Ö., Başakın, E. E., & Özger, M. (2022) · International Journal of Environmental Science and Technology · doi:10.1007/s13762-022-04035-9 · Cited by 4
“Genetic programming (GP) is an evolutionary technique that works by evolving the problem according to a certain consistency criterion (Koza 1994).”
BackgroundLi, Q., Wang, J., & Su, G. (2022) · Buildings · doi:10.3390/buildings12071061 · Cited by 4
“Nature-inspired algorithms, such as the genetic algorithm (GA) [53], particle swarm algorithm (PSO) [54], ant colony algorithm (AC) [55], etc.”
MethodDifference-based firefly programming for symbolic regression problems
Aliwi, M., Demіrcі, S., & Aslan, S. (2023) · Computer Standards & Interfaces · doi:10.1016/j.csi.2023.103722 · Cited by 4
One Pixel Adversarial Attacks via Sketched Programs
Yuviler, T., & Drachsler-Cohen, D. (2023) · Proceedings of the ACM on Programming Languages · doi:10.1145/3591301 · Cited by 5
“Similarly to other stochastic searches, e.g., random search [Karnopp 1963] and genetic search [Koza 1994], MH samples candidates based on a learned distribution over the search space.”
BackgroundA Genetic-Based Feature Construction Method for Data Summarisation
Alfred, R. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-88192-6_6 · Cited by 4
Using Code Bloat to Obfuscate Evolved Network Traffic
LaRoche, P., Zincir-Heywood, N., & Heywood, M. I. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-12242-2_11 · Cited by 4
“Code bloat, the rapid growth of Genetic Programs, without relationship to fitness, is well documented in literature [9,10].”
BackgroundA Comparative Study of Machine Learning Methods for Compressive Strength of Concrete
Silva, P. F. S., & Moita, G. F. (2019) · Proceedings of the World Congress on Civil, Structural, and Environmental Engineering · doi:10.11159/icsect19.136 · Cited by 4
“In this manner, the proposal of Koza (1992) [8] might be helpful for a newly developed method for modelling of the structural engineering issues.”
MethodCombining Evolution and Learning in Computational Ecosystems
Strannegård, C., Xu, W., Engsner, N., & Endler, J. A. (2020) · Journal of Artificial General Intelligence · doi:10.2478/jagi-2020-0001 · Cited by 5
Topology-based generation of sport training sessions
Fister, I., Fister, I., & Fister, I. (2020) · Journal of Ambient Intelligence and Humanized Computing · doi:10.1007/s12652-020-02048-1 · Cited by 4
“In general, there are four types of EAs, as follows: • Genetic Algorithms (GA) (Goldberg 1989), • Genetic Programming (GP) (Koza 1994), • Evolution Strategies (ES) (Bäck 2010), • Evolutionary Programming (EP) (Fogel 1999).”
BackgroundA phenotypic analysis of GP-evolved team behaviours
Doherty, D., & O’Riordan, C. (2007) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/1276958.1277347 · Cited by 4
Janardhanan, S. (2023) · ResearchOnline - JCU (James Cook University) · doi:10.25903/n73f-p471 · Cited by 4
Self-organising transparent learning system
Gu, X. (2018) · Lancaster EPrints (Lancaster University) · doi:10.17635/lancaster/thesis/407 · Cited by 4
“Currently, the main components of EC include genetic algorithms [91], [92], evolutionary strategies [93], genetic programming [94] and particle swarm optimisation [95], [96].”
BackgroundUtilizing genetic algorithm to detect collusive opportunities in deregulated energy markets
Esen, B. (2019) · Sabanci University · Cited by 4
pySRURGS - a python package for symbolic regression by uniform random global search
Towfighi, S. (2019) · The Journal of Open Source Software · doi:10.21105/joss.01675 · Cited by 4
Is PSO the Ultimate Algorithm or Just Hype?Preprint
Mustafa, A. I., Aladdin, A. M., Mohammed-Taha, S. R., Hasan, D. O., & Rashid, T. A. (2025) · doi:10.36227/techrxiv.173609965.50383071/v1 · Cited by 4
Le, B.-A., Vu, T.-S., Nguyen, H. Q., & Hưng, V. V. (2024) · Engineering Technology & Applied Science Research · doi:10.48084/etasr.7619 · Cited by 3
Koch, J., Alderliesten, T., & Bosman, P. A. N. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-70055-2_15 · Cited by 3
“Given a dataset and a library of atomic functions such as { + , − , × , ÷ , sin } , symbolic regression (SR) is the task of finding an interpretable expression that best describes the relation between one (output) variable and other (input) variables [15].”
Learning implicit yield surface models with uncertainty quantification for noisy datasets
Birky, D., Emery, J. M., Hamel, C. M., & Hochhalter, J. D. (2025) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/j.cma.2025.117738 · Cited by 3
Matsukawa, H., Imagaki, T., Tsuji, T., & Otake, K. (2025) · Journal of Chemical & Engineering Data · doi:10.1021/acs.jced.4c00652 · Cited by 3
Ehsaeyan, E. (2025) · International Journal of Engineering · doi:10.5829/ije.2025.38.09c.09 · Cited by 3
Li, Y., Xu, S., & Duan, J. (2025) · Communications in Nonlinear Science and Numerical Simulation · doi:10.1016/j.cnsns.2025.108751 · Cited by 5
Hybrids of Reinforcement Learning and Evolutionary Computation in Finance: A Survey
Yadav, S., Ravi, V., & Kalyanakrishnan, S. (2025) · ACM Computing Surveys · doi:10.1145/3728634 · Cited by 4
Multiple-Feature Construction for Image Segmentation Based on Genetic Programming
Herrera-Sánchez, D., Fuentes-Tomás, J.-A., Acosta‐Mesa, H., Mezura‐Montes, E., & Morales-Reyes, J.-L. (2025) · Mathematical and Computational Applications · doi:10.3390/mca30030057 · Cited by 4
“Input: Grayscale images Output: Five individuals, one from each population, with image processing functions for segmentation G ← 0; P i G ← Initialize five populations P 1 , P 2 , . . . , P 5 using the Full method by Koza [22]”
InfluentialData driven prediction of the neutral gas pressure in the stellarator Wendelstein 7-X
Angelis, D., Sofos, F. D., Misdanitis, S., Dritselis, C. D., Karakasidis, T. E., Valougeorgis, D., Haak, V., Naujoks, D., Schlisio, G., Bozhenkov, S., et al. (2025) · Plasma Physics and Controlled Fusion · doi:10.1088/1361-6587/ade33e · Cited by 3
“While there are numerous techniques to perform SR, the most prominent involve ML, where algorithms based on GP [53] concepts raise a vast number of expressions that progressively minimize a loss function.”
Angelis, D., Georgakopoulos, C., Sofos, F. D., & Karakasidis, T. E. (2025) · International Journal of Molecular Sciences · doi:10.3390/ijms26146748 · Cited by 4
Meng, L., Zhu, W., Xu, N., & Hower, J. C. (2025) · Fuel · doi:10.1016/j.fuel.2025.136072 · Cited by 4
Metadata
- Authors
- Koza, J.
- Affiliations
- Stanford University (US)
- Corresponding author
- Koza, JohnR.
- Venue
- Statistics and Computing
- Published
- 1994-06
- Volume
- 4
- Issue
- 2
- ISSN
- 0960-3174 (ISSN-L)
- 1573-1375
- OpenAlex
- W2040492000
- Cited by
- 1,685
- References
- 38
- Citations by year
- 2026: 189 · 2025: 245 · 2024: 268 · 2023: 212 · 2022: 149 · 2021: 110 · 2020: 117 · 2019: 115 · 2018: 84 · 2017: 24 · 2016: 20 · 2015: 22 · 2014: 27 · 2013: 33 · 2012: 8
- FWCI
- 2.48
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Statistics and Computing (publishedVersion)
- 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, program synthesis, Darwinian selection, genetic crossover, symbolic regression, machine learning
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.