The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Parameter Setting in Evolutionary Algorithms
Open accessAbstract
One of the main difficulties of applying an evolutionary algorithm (or, as a matter of fact, any heuristic method) to a given problem is to decide on an appropriate set of parameter values. Typically these are specified before the algorithm is run and include population size, selection rate, operator probabilities, not to mention the representation and the operators themselves. This book gives the reader a solid perspective on the different approaches that have been proposed to automate control of these parameters as well as understanding their interactions. The book covers a broad area of evolutionary computation, including genetic algorithms, evolution strategies, genetic programming, estimation of distribution algorithms, and also discusses the issues of specific parameters used in parallel implementations, multi-objective evolutionary algorithms, and practical consideration for real-world applications. It is a recommended read for researchers and practitioners of evolutionary computation and heuristic methods.
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
Genetic algorithms in search, optimization, and machine learning
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0936 · Cited by 49,010
Genetic Programming: On the Programming of Computers by Means of Natural Selection
Koza, J. R. (1992) · Medical Entomology and Zoology · Cited by 13,082
Handbook of Genetic Algorithms
Davis, L. D. (1991) · Cumulative Index of Computer Aided Architectural Design · Cited by 7,330
Bäck, T. (1996) · Oxford University Press eBooks · doi:10.1093/oso/9780195099713.001.0001 · Cited by 5,113
Genetic Algorithms + Data Structures = Evolution Programs
Michalewicz, Z. (1996) · Springer eBooks · doi:10.1007/978-3-662-03315-9 · Cited by 5,095
Completely Derandomized Self-Adaptation in Evolution Strategies
Hansen, N., & Ostermeier, A. (2001) · Evolutionary Computation · doi:10.1162/106365601750190398 · Cited by 4,397
Handbook of Evolutionary Computation
(1997) · Institute of Physics eBooks · doi:10.1887/0750308958 · Cited by 2,990
Hansen, N., Müller, S. D., & Koumoutsakos, P. (2003) · Evolutionary Computation · doi:10.1162/106365603321828970 · Cited by 2,601
Parameter control in evolutionary algorithms
Eiben, A. E., Hinterding, R., & Michalewicz, Z. (1999) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.771166 · Cited by 1,980
*13 Simulated Annealing and Boltzmann Machines
(1993) · Neural Network Learning and Expert Systems · doi:10.7551/mitpress/4931.003.0017 · Cited by 1,637
Genetic Programming: An Introduction
Banzhaf, W., Keller, R. E., & Nordin, P. C. (1997) · Cited by 1,052
Whitley, L. D. (1989) · international conference on Genetic algorithms · Cited by 992
Schwefel, H.-P. (1977) · Birkhäuser Basel eBooks · doi:10.1007/978-3-0348-5927-1 · Cited by 729
A Study of Reproduction in Generational and Steady-State Genetic Algorithms
Syswerda, G. (1991) · Foundations of Genetic Algorithms · doi:10.1016/b978-0-08-050684-5.50009-4 · Cited by 652
Proceedings of the 5th International Conference on Genetic Algorithms
Forrest, S. (1993) · Cited by 638
Self-Adaptive Genetic Algorithms with Simulated Binary Crossover
Deb, K., & Beyer, H.-G. (2001) · Evolutionary Computation · doi:10.1162/106365601750190406 · Cited by 437
Proceedings of the Genetic and Evolutionary Computation Conference
(2018) · doi:10.1145/3205455 · Cited by 427
Adaptation in evolutionary computation: a survey
Hinterding, R., Michalewicz, Z., & Eiben, A. E. (2002) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/icec.1997.592270 · Cited by 291
Introduction to evolutionary computation
Fogel, D. B. (2004) · Evolutionary Computation 1 · doi:10.1887/0750306645/b877c1 · Cited by 249
Balancing Accuracy and Parsimony in Genetic Programming
Zhang, B.-T., & Mühlenbein, H. (1995) · Evolutionary Computation · doi:10.1162/evco.1995.3.1.17 · Cited by 242
Adapting Crossover in Evolutionary Algorithms
Spears, W. M. (1995) · Evolutionary Programming IV · doi:10.7551/mitpress/2887.003.0035 · Cited by 237
The Interaction of Mutation Rate, Selection, and Self-Adaptation Within a Genetic Algorithm.
Bäck, T. (1992) · Parallel Problem Solving from Nature · Cited by 237
Operator and parameter adaptation in genetic algorithms
Smith, J. E., & Fogarty, T. C. (1997) · Soft Computing · doi:10.1007/s005000050009 · Cited by 215
Reducing bloat and promoting diversity using multi-objective methods
de Jong, E. D., Watson, R. A. R., & Pollack, J. B. (2001) · Cited by 204
Julstrom, B. A. (1995) · international conference on Genetic algorithms · Cited by 178
Self adaptation of mutation rates in a steady state genetic algorithm
Smith, J., & Fogarty, T. C. (2002) · Proceedings of IEEE International Conference on Evolutionary Computation · doi:10.1109/icec.1996.542382 · Cited by 172
Hansen, N., Ostermeier, A., & Gawelczyk, A. (1995) · Cited by 168
Strategy adaptation by competing subpopulations
Schlierkamp-Voosen, D., & Mühlenbein, H. (1994) · Lecture notes in computer science · doi:10.1007/3-540-58484-6_264 · Cited by 142
Self-adaptivity for constraint satisfaction: learning penalty functions
Eiben, A. E., & Ruttkay, Z. (2002) · IEEE International Conference on Evolutionary Computation (ICEC) · doi:10.1109/icec.1996.542371 · Cited by 57
"Optimal" mutation rates for genetic search
Cervantes, J., & Stephens, C. R. (2006) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/1143997.1144201 · Cited by 36
Swappers: introns promote flexibility, diversity and invention
Levenick, J. (1999) · Genetic and Evolutionary Computation Conference (GECCO) · Cited by 20
Cited by
A survey on optimization metaheuristics
Boussaïd, I., Lepagnot, J., & Siarry, P. (2013) · Information Sciences · doi:10.1016/j.ins.2013.02.041 · Cited by 1,655
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
Hyper-heuristics: a survey of the state of the art
Burke, E. K., Gendreau, M., Hyde, M., Kendall, G., Ochoa, G., Özcan, E., & Qu, R. (2013) · Journal of the Operational Research Society · doi:10.1057/jors.2013.71 · Cited by 1,263
Constraint-handling in nature-inspired numerical optimization: Past, present and future
Mezura-Montes, E., & Coello Coello, C. A. (2011) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2011.10.001 · Cited by 1,127
Parameter tuning for configuring and analyzing evolutionary algorithms
Eiben, A. E., & Smit, S. K. (2011) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2011.02.001 · Cited by 622
Metadata
- Venue
- Studies in Computational Intelligence
- Publisher
- Springer Berlin Heidelberg
- Published
- 2007
- ISSN
- 1860-949X (ISSN-L)
- 1860-9503
- OpenAlex
- W1543258308
- Cited by
- 422
- References
- 31
- FWCI
- 7.79
- Type
- book
- Language
- en
- Open access
- green
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.