The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
On the Futility of Blind Search: An Algorithmic View of “No Free Lunch”
Abstract
The paper is in three parts. First, we use simple adversary arguments to redevelop and explore some of the no-free-lunch (NFL) theorems and perhaps extend them a little. Second, we clarify the relationship of NFL theorems to algorithm theory and complexity classes such as NP. We claim that NFL is weaker in the sense that the constraints implied by the conjectures of traditional algorithm theory on what an evolutionary algorithm may be expected to accomplish are far more severe than those implied by NFL. Third, we take a brief look at how natural evolution relates to computation and optimization. We suggest that the evolution of complex systems exhibiting high degrees of orderliness is not equivalent in difficulty to optimizing hard (in the complexity sense) problems, and that the optimism in genetic algorithms (GAs) as universal optimizers is not justified by natural evolution. This is an informal tutorial paper—most of the information presented is not formally proven, and is either “common knowledge” or formally proven elsewhere. Some of the claims are intuitions based on experience with algorithms, and in a more formal setting should be classified as conjectures.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
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
On computable numbers, with an application to the entscheidungsproblem
Turing, A. M. (1937) · Proceedings of the London Mathematical Society · doi:10.1112/plms/s2-42.1.230 · Cited by 8,283
Cited by
A Tutorial for Competent Memetic Algorithms: Model, Taxonomy, and Design Issues
Krasnogor, N., & Smith, J. (2005) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2005.850260 · Cited by 727
Automated Algorithm Selection: Survey and Perspectives
Kerschke, P., Hoos, H. H., Neumann, F., & Trautmann, H. (2019) · Evolutionary Computation · doi:10.1162/evco_a_00242 · Cited by 435
Currin, A., Swainston, N., Day, P. J., & Kell, D. B. (2015) · Chemical Society Reviews · doi:10.1039/c4cs00351a · Cited by 388
Self-adaptive learning based particle swarm optimization
Wang, Y., Li, B., Weise, T., Wang, J., Yuan, B., & Tian, Q. (2011) · Information Sciences · doi:10.1016/j.ins.2010.07.013 · Cited by 347
Oppositional biogeography-based optimization
Ergezer, M., Simon, D., & Du, D. (2009) · 2009 IEEE International Conference on Systems, Man and Cybernetics · doi:10.1109/icsmc.2009.5346043 · Cited by 300
Metadata
- Authors
- Culberson, J. C.
- Venue
- Evolutionary Computation
- Publisher
- MIT Press
- Published
- 1998-06
- Volume
- 6
- Issue
- 2
- Pages
- 109-127
- ISSN
- 1063-6560 (ISSN-L)
- 1530-9304
- OpenAlex
- W2027293986
- Cited by
- 164
- References
- 2
- FWCI
- 5.25
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On the Futility of Blind Search: An Algorithmic View of “No Free Lunch”. https://app.cochat.ai/papers/10.1162/evco.1998.6.2.109
- The paper
- Culberson, J. C. (1998). On the Futility of Blind Search: An Algorithmic View of “No Free Lunch”. Evolutionary Computation. https://doi.org/10.1162/evco.1998.6.2.109
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.