The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Adaptive probabilities of crossover and mutation in genetic algorithms
Abstract
In this paper we describe an efficient approach for multimodal function optimization using genetic algorithms (GAs). We recommend the use of adaptive probabilities of crossover and mutation to realize the twin goals of maintaining diversity in the population and sustaining the, convergence capacity of the GA. In the adaptive genetic algorithm (AGA), the probabilities of crossover and mutation, p/sub c/ and p/sub m/, are varied depending on the fitness values of the solutions. High-fitness solutions are 'protected', while solutions with subaverage fitnesses are totally disrupted. By using adaptively varying p/sub c/ and p/sub ,/ we also provide a solution to the problem of deciding the optimal values of p/sub c/ and p/sub m/, i.e., p/sub c/ and p/sub m/ need not be specified at all. The AGA is compared with previous approaches for adapting operator probabilities in genetic algorithms. The Schema theorem is derived for the AGA, and the working of the AGA is analyzed. We compare the performance of the AGA with that of the standard GA (SGA) in optimizing several nontrivial multimodal functions with varying degrees of complexity.>
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
Handbook of Genetic Algorithms
Davis, L. D. (1991) · Cumulative Index of Computer Aided Architectural Design · Cited by 7,330
Optimization of Control Parameters for Genetic Algorithms
Grefenstette, J. (1986) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1986.289288 · Cited by 2,854
Genetic algorithms with sharing for multimodal function optimization
Goldberg, D. E., & Richardson, J. T. (1987) · international conference on Genetic algorithms · Cited by 1,912
Genetic Algorithms and Simulated Annealing
Davis, L. D. (1987) · Cited by 1,759
An Analysis Of The Behavior Of A Class Of Genetic Adaptive Systems.
Jong, K. A. D. (1975) · Deep Blue (University of Michigan) · doi:10.7302/10966 · Cited by 1,290
Messy genetic algorithms: motivation, analysis, and first results
Goldberg, D. E., Korb, B., & Deb, K. (1989) · Complex Systems · Cited by 1,127
Schaffer, J. D., Caruana, R. A., Eshelman, L. J., & Das, R. (1989) · international conference on Genetic algorithms · Cited by 896
Genetic algorithms and neural networks: optimizing connections and connectivity
Whitley, D., Starkweather, T., & Bogart, C. (1990) · Parallel Computing · doi:10.1016/0167-8191(90)90086-o · Cited by 747
Baum, E. B., Boneh, D., & Garrett, C. (1995) · Proceedings of the eighth annual conference on Computational learning theory - COLT '95 · doi:10.1145/225298.225326 · Cited by 313
Polynomially Complete Fault Detection Problems
Ibarra, Ó. H., & Sahni, S. K. (1975) · IEEE Transactions on Computers · doi:10.1109/t-c.1975.224205 · Cited by 264
Goldberg, D. E. (1990) · Complex Systems · Cited by 207
Towards an optimal mutation probability for genetic algorithms
Hesser, J., & Männer, R. (2006) · Lecture Notes in Computer Science · doi:10.1007/bfb0029727 · Cited by 199
Genetic Algorithms and Walsh Functions: Part II, Deception and Its Analysis.
Goldberg, D. E. (1989) · Complex Systems · Cited by 183
Cited by
Srinivas, M., & Patnaik, L. M. (1994) · Computer · doi:10.1109/2.294849 · Cited by 2,180
Self-citationParameter 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
Mirjalili, S. (2019) · Studies in computational intelligence · doi:10.1007/978-3-319-93025-1_4 · Cited by 1,737
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
Metaheuristics: A bibliography
Osman, I. H., & Laporte, G. (1996) · Annals of Operations Research · doi:10.1007/bf02125421 · Cited by 672
Metadata
- Authors
- Srinivas, M., & Patnaik, L. M.
- Venue
- IEEE Transactions on Systems, Man, and Cybernetics
- Published
- 1994-04
- Volume
- 24
- Issue
- 4
- Pages
- 656-667
- ISSN
- 0018-9472 (ISSN-L)
- OpenAlex
- W1990771923
- Cited by
- 2,512
- References
- 14
- FWCI
- 16.30
- 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.