The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Gradual distributed real-coded genetic algorithms
Open accessAbstract
A major problem in the use of genetic algorithms is premature convergence. One approach for dealing with this problem is the distributed genetic algorithm model. Its basic idea is to keep, in parallel, several subpopulations that are processed by genetic algorithms, with each one being independent of the others. Making distinctions between the subpopulations by applying genetic algorithms with different configurations, we obtain the so-railed heterogeneous distributed genetic algorithms. These algorithms represent a promising way for introducing a correct exploration/exploitation balance in order to avoid premature convergence and reach approximate final solutions. This paper presents the gradual distributed real-coded genetic algorithms, a type of heterogeneous distributed real-coded genetic algorithms that apply a different crossover operator to each sub-population. Experimental results show that the proposals consistently outperform sequential real-coded genetic algorithms.
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
Storn, R., & Price, K. (1997) · Journal of Global Optimization · doi:10.1023/a:1008202821328 · Cited by 29,569
Genetic Algorithms in Search, Optimization and Machine Learning
Goldberg, D. E., & Robson, D. (1988) · Cited by 18,391
Genetic Algorithms + Data Structures = Evolution Programs
Michalewicz, Z. (1992) · Artificial Intelligence · doi:10.1007/978-3-662-02830-8 · Cited by 11,553
Punctuated equilibria: an alternative to phyletic gradualism
Eldredge, N., Gould, S. J., & Schöpf, T. J. M. (1972) · Cited by 3,257
Storn, R. (1995) · Medical Entomology and Zoology · Cited by 2,800
Törn, A., & Žilinskas, A. (1989) · Cited by 1,673
Real-Coded Genetic Algorithms and Interval-Schemata
Eshelman, L. J., & Schaffer, J. D. (1993) · Foundations of Genetic Algorithms · doi:10.1016/b978-0-08-094832-4.50018-0 · Cited by 1,650
Numerical optimization of computer models
(1982) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(82)90117-3 · Cited by 1,624
Reducing bias and inefficiency in the selection algorithm
Baker, J. E. (1987) · international conference on Genetic algorithms · Cited by 1,415
Eshelman, L. J. (1991) · Foundations of Genetic Algorithms · doi:10.1016/b978-0-08-050684-5.50020-3 · Cited by 1,040
Adaptive Selection Methods for Genetic Algorithms
Baker, J. E. (1985) · international conference on Genetic algorithms · Cited by 1,022
Niching methods for genetic algorithms
Mahfoud, S. W. (1996) · Cited by 897
(1989) · Lecture Notes in Computer Science · doi:10.1007/3-540-50871-6 · Cited by 717
The parallel genetic algorithm as function optimizer
Mühlenbein, H., Schomisch, M., & Born, J. (1991) · Parallel Computing · doi:10.1016/s0167-8191(05)80052-3 · Cited by 716
Distributed Genetic Algorithms
Tanese, R. (1989) · international conference on Genetic algorithms · Cited by 660
Numerical Optimization of Computer Models
(1982) · Discrete Applied Mathematics · doi:10.1016/0166-218x(82)90059-2 · Cited by 413
Hybrid methods using genetic algorithms for global optimization
Renders, J.-M., & Flasse, S. P. (1996) · IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) · doi:10.1109/3477.485836 · Cited by 409
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
Generalized descent for global optimization
Griewank, A. (1981) · Journal of Optimization Theory and Applications · doi:10.1007/bf00933356 · Cited by 381
Fine-Grained Parallel Genetic Algorithms
Manderick, B., & Spiessens, P. (1989) · international conference on Genetic algorithms · Cited by 357
Evolution in Time and Space – The Parallel Genetic Algorithm
Mühlenbein, H. (1991) · Foundations of genetic algorithms · doi:10.1016/b978-0-08-050684-5.50023-9 · Cited by 328
Serial and Parallel Genetic Algorithms as Function Optimizers
Gordon, V. S., & Whitley, L. D. (1993) · Cited by 316
Further Research on Feature Selection and Classification Using Genetic Algorithms
Punch, W. F., Goodman, E. D., Pei, M., Chia-Shun, L., Hovland, P., & Enbody, R. J. (1993) · Cited by 242
The Distributed Genetic Algorithm RevisitedPreprint
Belding, T. C. (1995) · arXiv (Cornell University) · doi:10.48550/arxiv.adap-org/9504007 · Cited by 218
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
Fuzzy Recombination for the Breeder Genetic Algorithm
Voigt, H.-M., Mühlenbein, H., & Cvetković, D. (1995) · Cited by 114
Forking Genetic Algorithm with Blocking and Shrinking Modes (fGA)
Tsutsui, S., & Fujimoto, Y. (1993) · international conference on Genetic algorithms · Cited by 85
A genetic algorithm with disruptive selection
Kuo, T., & Hwang, S. (1996) · IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics) · doi:10.1109/3477.485880 · Cited by 79
Parallel Genetic Algorithms: Introduction and Overview of Current Research
Dorigo, M., Maniezzo, V., & Stender, J. (1993) · Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles) · Cited by 61
Mathematical optimization: are there abstract limits on natural selection?
Bossert, W. H. (1967) · PubMed · Cited by 24
Cited by
Differential Evolution Using a Neighborhood-Based Mutation Operator
Das, S., Abraham, A., Chakraborty, U. K., & Konar, A. (2009) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2008.2009457 · Cited by 1,165
Parallelism and evolutionary algorithms
Alba, E., & Tomassini, M. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2002.800880 · Cited by 823
The Exploration/Exploitation Tradeoff in Dynamic Cellular Genetic Algorithms
Alba, E., & Dorronsoro, B. (2005) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2005.843751 · Cited by 457
Distributed evolutionary algorithms and their models: A survey of the state-of-the-art
Gong, Y.-J., Chen, W.-N., Zhan, Z.-H., Zhang, J., Li, Y., Zhang, Q., & Li, J.-J. (2015) · Applied Soft Computing · doi:10.1016/j.asoc.2015.04.061 · Cited by 393
Global and local real-coded genetic algorithms based on parent-centric crossover operators
García-Martínez, C., Lozano, M., Herrera, F., Molina, D., & Sánchez, A. M. (2008) · European Journal of Operational Research · doi:10.1016/j.ejor.2006.06.043 · Cited by 268
Self-citation
Metadata
- Authors
- Herrera, F., & Lozano, M.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2000-04
- Volume
- 4
- Issue
- 1
- Pages
- 43-63
- ISSN
- 1089-778X (ISSN-L)
- OpenAlex
- W2100004220
- Cited by
- 293
- References
- 31
- FWCI
- 10.00
- Type
- journal article
- 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.