The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
A Comparison of Several Linear Genetic Programming Techniques
Open accessAbstract
A comparison between four Genetic Programming techniques is presented in this paper. The compared methods are Multi-Expression Programming, Gene Expression Programming, Grammatical Evolution, and Linear Genetic Programming. The comparison includes all aspects of the considered evolutionary algorithms: individual representation, fitness assignment, genetic operators, and evolutionary scheme. Several numerical experiments using five benchmarking problems are carried out. Two test problems are taken from PROBEN1 and contain real-world data. The results reveal that Multi-Expression Programming has the best overall behavior for the considered test problems, closely followed by Linear Genetic Programming.
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.
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
Bellman, R. E. (2010) · doi:10.1515/9781400835386 · Cited by 14,588
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
Genetic Programming: On the Programming of Computers by Means of Natural Selection
Koza, J. R. (1992) · Medical Entomology and Zoology · Cited by 13,082
Gene Expression Programming: a New Adaptive Algorithm for Solving Problems
Ferreira, C. (2001) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0102027 · Cited by 2,036
Uniform crossover in genetic algorithms
Syswerda, G. (1989) · international conference on Genetic algorithms · Cited by 1,965
No Free Lunch Theorems for SearchPreprint
Wolpert, D. H., & Macready, W. G. (1995) · RePEc: Research Papers in Economics · Cited by 927
Miller, J. F., & Thomson, P. (2000) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-46239-2_9 · Cited by 914
Grammatical evolution: Evolving programs for an arbitrary language
Ryan, C., Collins, J., & Neill, M. O. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0055930 · Cited by 733
A comparison of linear genetic programming and neural networks in medical data mining
Brameier, M., & Banzhaf, W. (2001) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.910462 · Cited by 505
Genotype-phenotype-mapping and neutral variation — A case study in Genetic Programming
Banzhaf, W. (1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-58484-6_276 · Cited by 180
Cited by
Nonlinear Genetic-Based Models for Prediction of Flow Number of Asphalt Mixtures
Gandomi, A. H., Alavi, A. H., Mirzahosseini, M. R., & Nejad, F. M. (2011) · Journal of Materials in Civil Engineering · doi:10.1061/(asce)mt.1943-5533.0000154 · Cited by 311
Metaheuristic Algorithms in Modeling and Optimization
Gandomi, A. H., Yang, X.-S., Talatahari, S., & Alavi, A. H. (2013) · Metaheuristic Applications in Structures and Infrastructures · doi:10.1016/b978-0-12-398364-0.00001-2 · Cited by 268
A robust data mining approach for formulation of geotechnical engineering systems
Hossein Alavi, A., & Hossein Gandomi, A. (2011) · Engineering Computations · doi:10.1108/02644401111118132 · Cited by 266
Metadata
- Authors
- moltean@nessie.cs.ubbcluj.ro., E. M. A., Oltean, M., Groşan, C., & Electronic mail address: cgrosan@nessie.cs.ubbcluj.ro. Department of Computer Science, F. O. M. A. C. S.
- Venue
- Complex Systems
- Publisher
- Wolfram Research, Inc.
- Published
- 2024-12-15
- Volume
- 14
- Issue
- 4
- Pages
- 285-313
- ISSN
- 0891-2513 (ISSN-L)
- OpenAlex
- W2169840877
- Cited by
- 279
- References
- 13
- FWCI
- 7.44
- Type
- journal article
- Language
- en
- Open access
- bronze
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: A Comparison of Several Linear Genetic Programming Techniques. https://app.cochat.ai/papers/10.25088/complexsystems.14.4.285
- The paper
- moltean@nessie.cs.ubbcluj.ro., E. M. A., Oltean, M., Groşan, C., & Electronic mail address: cgrosan@nessie.cs.ubbcluj.ro. Department of Computer Science, F. O. M. A. C. S. (2024). A Comparison of Several Linear Genetic Programming Techniques. Complex Systems. https://doi.org/10.25088/complexsystems.14.4.285
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.