The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
The compact genetic algorithm
Abstract
Introduces the compact genetic algorithm (cGA) which represents the population as a probability distribution over the set of solutions and is operationally equivalent to the order-one behavior of the simple GA with uniform crossover. It processes each gene independently and requires less memory than the simple GA. The development of the compact GA is guided by a proper understanding of the role of the GA's parameters and operators. The paper clearly illustrates the mapping of the simple GA's parameters into those of an equivalent compact GA. Computer simulations compare both algorithms in terms of solution quality and speed. Finally, this work raises important questions about the use of information in a genetic algorithm, and its ramifications show us a direction that can lead to the design of more efficient GAs.
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
Introduction to the theory of neural computation
(1994) · Neural Networks · doi:10.1016/0893-6080(94)90014-0 · Cited by 6,401
Baluja, S. (1994) · Cited by 1,290
Introduction to the Theory of Neural Computation
Hertz, J., Krogh, A., Palmer, R., & Jensen, R. V. (1994) · American Journal of Physics · doi:10.1119/1.17491 · Cited by 1,276
From recombination of genes to the estimation of distributions I. Binary parameters
Mühlenbein, H., & Paaß, G. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-61723-x_982 · Cited by 1,207
BOA: the Bayesian optimization algorithm
Pelikán, M., Goldberg, D. E., & Cantú‐Paz, E. (1999) · Cited by 1,053
Self-citationA Connectionist Machine for Genetic Hillclimbing
Ackley, D. H. (1987) · The Kluwer International Series in Engineering and Computer Science · doi:10.1007/978-1-4613-1997-9 · Cited by 731
Removing the Genetics from the Standard Genetic Algorithm
Baluja, S., & Caruana, R. (1995) · Machine Learning Proceedings 1995 · doi:10.1016/b978-1-55860-377-6.50014-1 · Cited by 573
MIMIC: Finding Optima by Estimating Probability Densities
Bonet, J. S. D., Isbell, C. L., & Viola, P. A. (1996) · Cited by 457
Analyzing Deception in Trap Functions
Deb, K., & Goldberg, D. E. (1993) · Foundations of Genetic Algorithms · doi:10.1016/b978-0-08-094832-4.50012-x · Cited by 334
Self-citationThe Bivariate Marginal Distribution Algorithm
Pelikan, M., & Muehlenbein, H. (1999) · Advances in Soft Computing · doi:10.1007/978-1-4471-0819-1_39 · Cited by 321
Cited by
Exploration and exploitation in evolutionary algorithms: A survey
Črepinšek, M., Liu, S.-H., & Mernik, M. (2013) · ACM Computing Surveys · doi:10.1145/2480741.2480752 · Cited by 1,298
Cooperative Co-Evolution With Differential Grouping for Large Scale Optimization
Omidvar, M. N., Li, X., Mei, Y., & Yao, X. (2014) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2013.2281543 · Cited by 744
Ma, X., Liu, F., Qi, Y., Wang, X., Li, L., Jiao, L., Yin, M., & Gong, M. (2016) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2015.2455812 · Cited by 523
Parameter Control in Evolutionary Algorithms: Trends and Challenges
Karafotias, G., Hoogendoorn, M., & Eiben, A. E. (2015) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2014.2308294 · Cited by 516
A Survey on Cooperative Co-Evolutionary Algorithms
Ma, X., Li, X., Zhang, Q., Tang, K., Liang, Z., Xie, W., & Zhu, Z. (2019) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2018.2868770 · Cited by 336
Linkage Problem, Distribution Estimation, and Bayesian Networks
Pelikan, M., Goldberg, D. E., & Cantú-Paz, E. (2000) · Evolutionary Computation · doi:10.1162/106365600750078808 · Cited by 314
Self-citationBayesian networks for interpretable machine learning and optimization
Mihaljević, B., Bielza, C., & Larrañaga, P. (2021) · Neurocomputing · doi:10.1016/j.neucom.2021.01.138 · Cited by 123
Language Model Crossover: Variation through Few-Shot Prompting
Meyerson, E., Nelson, M. J., Bradley, H., Gaier, A., Moradi, A., Hoover, A. K., & Lehman, J. (2024) · ACM Transactions on Evolutionary Learning and Optimization · doi:10.1145/3694791 · Cited by 75
Language model crossover: Variation through few-shot prompting
Meyerson, E., Nelson, M. J., Bradley, H., Gaier, A., Moradi, A., Hoover, A. K., & Lehman, J. (2023) · arXiv · doi:10.48550/arxiv.2302.12170 · Cited by 75
Arruti, A., Cearreta, I., Álvarez, A., Lazkano, E., & Sierra, B. (2014) · PLoS ONE · doi:10.1371/journal.pone.0108975 · Cited by 21
Yang, X., Ma, Z., Yu, L., Cao, Y., Yin, B., Wei, X., Zhang, Q., & Lau, R. W. H. (2021) · arXiv · Cited by 26
Metadata
- Authors
- Harik, G. R., Lobo, F. G., & Goldberg, D. E.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 1999
- Volume
- 3
- Issue
- 4
- Pages
- 287-297
- ISSN
- 1089-778X (ISSN-L)
- OpenAlex
- W2148379945
- Cited by
- 974
- References
- 17
- FWCI
- 8.14
- Type
- journal article
- Language
- en
- Open access
- closed
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.