The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Genetic Algorithms and the Optimal Allocation of Trials
Abstract
This study gives a formal setting to the difficult optimization problems characterized by the conjunction of (1) substantial complexity and initial uncertainty, (2) the necessity of acquiring new information rapidly to reduce the uncertainty, and (3) a requirement that the new information be exploited as acquired so that average performance increases at a rate consistent with the rate of acquisition of information. The setting has as its basis a set $\mathcal{A}$ of structures to be searched or tried and a performance function $\mu :\mathcal{A} \to $ real numbers. Within this setting it is determined how to allocate trials to a set of random variables so as to maximize expected performance. This result is then transformed into a criterion against which to measure the performance of a robust and easily implemented set of algorithms called reproductive plans. It is shown that reproductive plans can in fact surpass the criterion because of a phenomenon called intrinsic parallelism—a single trial (individual $A \in \mathcal{A}$) simultaneously tests and exploits many random variables.
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
Adaptive Control Processes: A Guided Tour
Bellman, R. E. (1961) · doi:10.1515/9781400874668 · Cited by 2,802
Adaptation and Learning in Automatic Systems
(1971) · Mathematics in Science and Engineering · doi:10.1016/s0076-5392(08)x6155-7 · Cited by 303
Hellman, M. E., & Cover, T. M. (1970) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177696958 · Cited by 180
Cited by
A Comparative Analysis of Selection Schemes Used in Genetic Algorithms
Goldberg, D. E., & Deb, K. (1991) · Foundations of Genetic Algorithms · doi:10.1016/b978-0-08-050684-5.50008-2 · Cited by 2,407
Iterative Methods for Optimization
Kelley, C. T. (1999) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970920 · Cited by 2,052
EXPERT SYSTEMS WITH APPLICATIONS
(2005) · Expert Systems with Applications · doi:10.1016/j.eswa.2004.10.010 · Cited by 1,656
Classifier systems and genetic algorithms
Booker, L. B., Goldberg, D. E., & Holland, J. H. (1989) · Artificial Intelligence · doi:10.1016/0004-3702(89)90050-7 · Cited by 952
Self-citationPractical data-oriented microaggregation for statistical disclosure control
Domingo-Ferrer, J., & Mateo-Sanz, J. M. (2002) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.979982 · Cited by 576
EA-LSTM: Evolutionary attention-based LSTM for time series prediction
Li, Y., Zhu, Z., Kong, D., Han, H., & Zhao, Y. (2019) · Knowledge-Based Systems · doi:10.1016/j.knosys.2019.05.028 · Cited by 489
An introduction and survey of estimation of distribution algorithms
Hauschild, M., & Pelikan, M. (2011) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2011.08.003 · Cited by 478
(2012) · Cited by 466
Complete search in continuous global optimization and constraint satisfaction
Neumaier, A. (2004) · Acta Numerica · doi:10.1017/s0962492904000194 · Cited by 430
Houssein, E. H., Gad, A. G., Wazery, Y. M., & Suganthan, P. N. (2021) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2021.100841 · Cited by 355
An optimized XGBoost method for predicting reservoir porosity using petrophysical logs
Pan, S., Zheng, Z., Guo, Z., & Luo, H. (2022) · Journal of Petroleum Science and Engineering · doi:10.1016/j.petrol.2021.109520 · Cited by 287
How to Solve Problems with Crowds: A Computer‐Based Simulation Model
Vuculescu, O., & Bergenholtz, C. (2014) · Creativity and Innovation Management · doi:10.1111/caim.12059 · Cited by 22
Adaptive Simulation-Based Optimization for Production Scheduling: A Comparative Study
Quadras, D., Frazzon, E. M., Mendes, L. G., Pires, M. C., & Rodriguez, C. M. T. (2022) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2022.09.430 · Cited by 9
Metadata
- Authors
- Holland, J. H.
- Venue
- SIAM Journal on Computing
- Published
- 1973-06
- Volume
- 2
- Issue
- 2
- Pages
- 88-105
- ISSN
- 0097-5397 (ISSN-L)
- 1095-7111
- OpenAlex
- W2068878490
- Cited by
- 1,239
- References
- 3
- FWCI
- 1.34
- 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.