The DOI matches its Crossref record; 49 of the 49 references it cites were found in a registry or an index.
A survey of techniques for characterising fitness landscapes and some possible ways forward
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
Goldberg, D. E., & Shakespeare, W. (2002) · Cited by 16,088
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
The origins of order; self organization and selection in evolution
(1994) · International Journal of Biochemistry · doi:10.1016/0020-711x(94)90119-8 · Cited by 6,649
Genetic Algorithms and Simulated Annealing
Davis, L. D. (1987) · Cited by 1,759
Towards a general theory of adaptive walks on rugged landscapes
Kauffman, S., & Levin, S. (1987) · Journal of Theoretical Biology · doi:10.1016/s0022-5193(87)80029-2 · Cited by 1,386
(2004) · Lecture Notes in Computer Science · doi:10.1007/b100601 · Cited by 1,147
No Free Lunch Theorems for SearchPreprint
Wolpert, D. H., & Macready, W. G. (1995) · RePEc: Research Papers in Economics · Cited by 927
Proceedings of the fourth international conference on Genetic algorithms
Belew, R. K., & Booker, L. B. (1991) · Cited by 822
Advances in genetic programming
Fogel, D. B. (1995) · Biosystems · doi:10.1016/0303-2647(95)90007-1 · Cited by 703
Proceedings of the 5th International Conference on Genetic Algorithms
Forrest, S. (1993) · Cited by 638
Correlated and uncorrelated fitness landscapes and how to tell the difference
Weinberger, E. (1990) · Biological Cybernetics · doi:10.1007/bf00202749 · Cited by 561
Parallel Problem Solving from Nature PPSN VI
Schoenauer, M., Deb, K., Rudolph, G., Yao, X., Lutton, É., Merelo, J. J., & Schwefel, H. (2000) · Lecture notes in computer science · doi:10.1007/3-540-45356-3 · Cited by 561
Fitness landscape analysis and memetic algorithms for the quadratic assignment problem
Freisleben, B., & Merz, P. (2000) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.887234 · Cited by 423
Evaluating evolutionary algorithms
Whitley, D., Rana, S., Dzubera, J., & Mathias, K. E. (1996) · Artificial Intelligence · doi:10.1016/0004-3702(95)00124-7 · Cited by 406
Biological evolution and statistical physics
Drossel, B. (2001) · Advances in Physics · doi:10.1080/00018730110041365 · Cited by 404
Proceedings of the 6th International Conference on Genetic Algorithms
Eshelman, L. J. (1995) · Cited by 355
The Evolution of Evolvability in Genetic Programming
(2003) · Advances in Genetic Programming · doi:10.7551/mitpress/1108.003.0008 · Cited by 325
Surfaces of Selective Value Revisited
Wright, S. (1988) · The American Naturalist · doi:10.1086/284777 · Cited by 322
Simple Genetic Algorithms and the Minimal, Deceptive Problem
Goldberg, D. E. (1987) · Medical Entomology and Zoology · Cited by 297
Lectures In The Sciences Of Complexity
Stein, D. L. (1989) · Cited by 276
RNA folding and combinatory landscapes
Fontana, W., Stadler, P. F., Bornberg-Bauer, E. G., Griesmacher, T., Hofacker, I. L., Tacker, M., Tarazona, P., Weinberger, E. D., & Schuster, P. (1993) · Physical Review E · doi:10.1103/physreve.47.2083 · Cited by 234
What makes a problem hard for a genetic algorithm? Some anomalous results and their explanation
Forrest, S., & Mitchell, M. (1994) · Machine Learning · doi:10.1007/bf00993046 · Cited by 217
A study of NK landscapes' basins and local optima networks
Ochoa, G., Tomassini, M., Vérel, S., & Darabos, C. (2008) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/1389095.1389204 · Cited by 204
Information Characteristics and the Structure of Landscapes
Vassilev, V. K., Fogarty, T. C., & Miller, J. F. (2000) · Evolutionary Computation · doi:10.1162/106365600568095 · Cited by 198
Genetic Algorithms and Walsh Functions: Part II, Deception and Its Analysis.
Goldberg, D. E. (1989) · Complex Systems · Cited by 183
Fitness Landscapes and Evolvability
Smith, T., Husbands, P., & O'Shea, M. (2002) · Evolutionary Computation · doi:10.1162/106365602317301754 · Cited by 179
The dispersion metric and the CMA evolution strategy
Lunacek, M., & Whitley, D. (2006) · Proceedings of the 8th annual conference on Genetic and evolutionary computation · doi:10.1145/1143997.1144085 · Cited by 171
Theoretical Aspects of Evolutionary Computing
(2001) · Natural computing series · doi:10.1007/978-3-662-04448-3 · Cited by 169
Advanced Fitness Landscape Analysis and the Performance of Memetic Algorithms
Merz, P. (2004) · Evolutionary Computation · doi:10.1162/1063656041774956 · Cited by 166
A comparison of predictive measures of problem difficulty in evolutionary algorithms
Naudts, B., & Kallel, L. (2000) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.843491 · Cited by 147
Neutrality in fitness landscapes
Reidys, C. M., & Stadler, P. F. (2001) · Applied Mathematics and Computation · doi:10.1016/s0096-3003(99)00166-6 · Cited by 144
Towards a theory of landscapes
Stadler, P. F., & Santa Fe Institute (2008) · Springer eBooks · doi:10.1007/bfb0103571 · Cited by 143
Genetic Algorithm Difficulty and the Modality of Fitness Landscapes
Horn, J., & Goldberg, D. E. (1995) · Foundations of genetic algorithms · doi:10.1016/b978-1-55860-356-1.50016-9 · Cited by 129
Local Optima Networks of NK Landscapes With Neutrality
Vérel, S., Ochoa, G., & Tomassini, M. (2010) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2010.2046175 · Cited by 126
Fitness Variance of Formae and Performance Prediction
Radcliffe, N. J., & Surry, P. D. (1995) · Foundations of genetic algorithms · doi:10.1016/b978-1-55860-356-1.50007-8 · Cited by 125
Quantifying ruggedness of continuous landscapes using entropy
Malan, K. M., & Engelbrecht, A. P. (2009) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2009.4983112 · Cited by 121
Self-citationWhat Makes a Problem Hard for a Genetic Algorithm? Some Anomalous Results and Their Explanation
Forrest, S., & Mitchell, M. (1993) · Machine Learning · doi:10.1023/a:1022626114466 · Cited by 114
Properties of Fitness Functions and Search Landscapes
Kallel, L., Naudts, B., & Reeves, C. R. (2001) · Natural computing series · doi:10.1007/978-3-662-04448-3_8 · Cited by 107
Smoothness, Ruggedness and Neutrality of Fitness Landscapes: from Theory to Application
Vassilev, V. K., Fogarty, T. C., & Miller, J. F. (2003) · Natural computing series · doi:10.1007/978-3-642-18965-4_1 · Cited by 84
GECCO ’14: Proceedings of the 2014 conference on Genetic and evolutionary computation
Igel, C., Arnold, D., Gagné, C., Popovici, E., Auger, A., Bacardit, J., Brockhoff, D., Cagnoni, S., Deb, K., Doerr, B., et al. (2014) · Cited by 76
Fitness landscapes and difficulty in genetic programming
Kinnear, K. E. (2002) · doi:10.1109/icec.1994.350026 · Cited by 70
Adaptive walks with noisy fitness measurements
Levitan, B. S., & Kauffman, S. A. (1995) · Molecular Diversity · doi:10.1007/bf01715809 · Cited by 69
Negative Slope Coefficient: A Measure to Characterize Genetic Programming Fitness Landscapes
Vanneschi, L., Tomassini, M., Collard, P., & Vérel, S. (2006) · Lecture notes in computer science · doi:10.1007/11729976_16 · Cited by 61
PSO and multi-funnel landscapes
Sutton, A. M., Whitley, D., Lunacek, M., & Howe, A. E. (2006) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/1143997.1144008 · Cited by 51
On the Futility of Blind Search
Culberson, J. C. (1996) · doi:10.7939/r3wp9t925 · Cited by 37
The effect of spin-flip symmetry on the performance of the simple GA
Naudts, B., & Naudts, J. (1998) · Lecture notes in computer science · doi:10.1007/bfb0056850 · Cited by 37
Fitness-proportional negative slope coefficient as a hardness measure for genetic algorithms
Poli, R., & Vanneschi, L. (2007) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/1276958.1277209 · Cited by 35
Guo, H., & Hsu, W. H. (2003) · Lecture notes in computer science · doi:10.1007/3-540-45110-2_36 · Cited by 15
Ochoa, G. (2000) · Lecture notes in computer science · doi:10.1007/3-540-45356-3_13 · Cited by 7
Cited by
Maier, H. R., Kapelan, Z., Kasprzyk, J., Kollat, J., Matott, L. S., Cunha, M. C., Dandy, G. C., Gibbs, M. S., Keedwell, E., Marchi, A., et al. (2014) · Environmental Modelling & Software · doi:10.1016/j.envsoft.2014.09.013 · Cited by 657
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
Fuzzy Self-Tuning PSO: A settings-free algorithm for global optimization
Nobile, M. S., Cazzaniga, P., Besozzi, D., Colombo, R., Mauri, G., & Pasi, G. (2018) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2017.09.001 · Cited by 274
Benchmarking in Optimization: Best Practice and Open Issues
Bartz-Beielstein, T., Doerr, C., Berg, D. V. D., Bossek, J., Chandrasekaran, S., Eftimov, T., Fischbach, A., Kerschke, P., La Cava, W., Lopez-Ibanez, M., et al. (2020) · arXiv · doi:10.48550/arxiv.2007.03488 · Cited by 214
Self-citationWitkowski, O., & Ikegami, T. (2019) · Artificial Life · doi:10.1162/artl_a_00288 · Cited by 14
Metadata
- Authors
- Malan, K. M., & Engelbrecht, A. P.
- Venue
- Information Sciences
- Publisher
- Elsevier BV
- Published
- 2013-08
- Volume
- 241
- Pages
- 148-163
- ISSN
- 0020-0255 (ISSN-L)
- OpenAlex
- W2044400415
- Cited by
- 280
- References
- 49
- FWCI
- 20.61
- 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.