The DOI matches its Crossref record; 60 of the 60 references it cites were found in a registry or an index.
Parallelism and evolutionary algorithms
Abstract
This paper contains a modern vision of the parallelization techniques used for evolutionary algorithms (EAs). The work is motivated by two fundamental facts: 1) the different families of EAs have naturally converged in the last decade while parallel EAs (PEAs) are still lack of unified studies; and 2) there is a large number of improvements in these algorithms and in their parallelization that raise the need for a comprehensive survey. We stress the differences between the EA model and its parallel implementation throughout the paper. We discuss the advantages and drawbacks of PEAs. Also, successful applications are mentioned and open problems are identified. We propose potential solutions to these problems and classify the different ways in which recent results in theory and practice are helping to solve them. Finally, we provide a highly structured background relating to PEAs in order to make researchers aware of the benefits of decentralizing and parallelizing an EA.
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
Genetic algorithms in search, optimization, and machine learning
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0936 · Cited by 49,010
Holland, J. H. (1992) · The MIT Press eBooks · doi:10.7551/mitpress/1090.001.0001 · Cited by 47,002
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
An Introduction to Genetic Algorithms
Mitchell, M. (1996) · doi:10.7551/mitpress/3927.001.0001 · Cited by 11,340
The Grid 2: Blueprint for a New Computing Infrastructure
Foster, I. T., & Kesselman, C. (1998) · Cited by 7,637
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
Whitley, D. (1994) · Statistics and Computing · doi:10.1007/bf00175354 · Cited by 4,522
Globus: a Metacomputing Infrastructure Toolkit
Foster, I., & Kesselman, C. (1997) · The International Journal of Supercomputer Applications and High Performance Computing · doi:10.1177/109434209701100205 · Cited by 3,133
Handbook of Evolutionary Computation
(1997) · Institute of Physics eBooks · doi:10.1887/0750308958 · Cited by 2,990
Simulated annealing: theory and applications.
(1988) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(88)90023-7 · Cited by 2,966
MPI: A Message-Passing Interface Standard
Forum, M. P. (1994) · Cited by 2,703
A Comparative Analysis of Selection Schemes Used in Genetic Algorithms
Goldberg, D. E., & Deb, K. (1991) · Foundations of Genetic Algorithms · doi:10.1016/b978-0-08-050684-5.50008-2 · Cited by 2,407
Uniform crossover in genetic algorithms
Syswerda, G. (1989) · international conference on Genetic algorithms · Cited by 1,965
A Comprehensive Survey of Evolutionary-Based Multiobjective Optimization Techniques
Coello Coello, C. A. (1999) · Knowledge and Information Systems · doi:10.1007/bf03325101 · Cited by 1,367
The MPI Message Passing Interface Standard
Clarke, L., Glendinning, I., & Hempel, R. (1994) · Programming Environments for Massively Parallel Distributed Systems · doi:10.1007/978-3-0348-8534-8_21 · Cited by 1,295
Fractals and Scaling in Finance
Mandelbrot, B. B. (1997) · Springer eBooks · doi:10.1007/978-1-4757-2763-0 · Cited by 1,295
Comer, D. E. (1988) · UCLA - Biblioteca de Ciencias y Tecnologia Felix Morales Bueno · Cited by 1,245
Predictive Models for the Breeder Genetic Algorithm I. Continuous Parameter Optimization
Mühlenbein, H., & Schlierkamp-Voosen, D. (1993) · Evolutionary Computation · doi:10.1162/evco.1993.1.1.25 · Cited by 1,199
PVM: A framework for parallel distributed computing
Sunderam, V. S. (1990) · Concurrency: Practice and Experience · doi:10.1002/cpe.4330020404 · Cited by 1,170
Glover, F., Taillard, E., & Taillard, E. (1993) · Annals of Operations Research · doi:10.1007/bf02078647 · Cited by 902
A Survey of Parallel Genetic Algorithms
Cantú‐Paz, E. (2000) · Cited by 900
Efficient and Accurate Parallel Genetic Algorithms
Cantú‐Paz, E. (2001) · Genetic algorithms and evolutionary computation · doi:10.1007/978-1-4615-4369-5 · Cited by 869
Co-evolving parasites improve simulated evolution as an optimization procedure
Hillis, W. D. (1990) · Physica D: Nonlinear Phenomena · doi:10.1016/0167-2789(90)90076-2 · Cited by 780
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
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
Simulated annealing: Theory and applications
Rota, G. (1988) · Advances in Mathematics · doi:10.1016/0001-8708(88)90072-2 · Cited by 607
Genetic algorithms + data structures = evolution programs (3rd ed.)
Michalewicz, Z. (1996) · Springer eBooks · Cited by 553
Sizing Populations for Serial and Parallel Genetic Algorithms
Goldberg, D. E. (1989) · international conference on Genetic algorithms · Cited by 467
Co-evolving parasites improve simulated evolution as an optimization procedure
Hillis, W. D. (1991) · Cited by 447
Handbook of Evolutionary Computation
(1997) · CRC Press eBooks · doi:10.1201/9780367802486 · Cited by 413
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
A Survey on the Parallel Genetic Algorithms
Nang, J., & Matsuo, K. (1994) · Jidō seigyo/Jido seigyo · Cited by 401
Fine-Grained Parallel Genetic Algorithms
Manderick, B., & Spiessens, P. (1989) · international conference on Genetic algorithms · Cited by 357
Serial and Parallel Genetic Algorithms as Function Optimizers
Gordon, V. S., & Whitley, L. D. (1993) · Cited by 316
Nonstationary function optimization using genetic algorithm with dominance and diploidy
Goldberg, D. E., & Smith, R. E. (1987) · international conference on Genetic algorithms · Cited by 298
Gradual distributed real-coded genetic algorithms
Herrera, F., & Lozano, M. (2000) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.843494 · Cited by 293
Genetic-algorithm programming environments
Ribeiro Filho, J. L., Treleaven, P. C., & Alippi, C. (1994) · Computer · doi:10.1109/2.294850 · Cited by 284
Evolution of parallel cellular machines: The cellular programming approach
(1997) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(97)90209-1 · Cited by 257
ASPARAGOS An Asynchronous Parallel Genetic Optimization Strategy
Gorges-Schleuter, M. (1989) · Publikationsdatenbank der Fraunhofer-Gesellschaft (Fraunhofer-Gesellschaft) · 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
Analyzing synchronous and asynchronous parallel distributed genetic algorithms
Alba, E., & Troya, J. M. (2001) · Future Generation Computer Systems · doi:10.1016/s0167-739x(99)00129-6 · Cited by 167
Self-citationAn ANTS heuristic for the frequency assignment problem
Maniezzo, V., & Carbonaro, A. (2000) · Future Generation Computer Systems · doi:10.1016/s0167-739x(00)00046-7 · Cited by 155
Whitley, L. D. (1993) · international conference on Genetic algorithms · Cited by 153
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
An evolutionary approach to combinatorial optimization problems
Khuri, S., Bäck, T., & Heitkötter, J. (1994) · doi:10.1145/197530.197558 · Cited by 107
Improving flexibility and efficiency by adding parallelism to genetic algorithms
Alba, E., & Troya, J. M. (2002) · Statistics and Computing · doi:10.1023/a:1014803900897 · Cited by 98
Self-citationStructure and Performance of Fine-Grain Parallelism in GeneticSearch
Baluja, S. (2019) · CRC Press eBooks · doi:10.1201/9780429128332-7 · Cited by 79
Parallel genetic programming and its application to trading model induction
Oussaidène, M., Bastien Chopard, B., Pictet, O. V., & Tomassini, M. (1997) · Parallel Computing · doi:10.1016/s0167-8191(97)00045-8 · Cited by 78
Self-citationGlobal optimization by means of distributed evolution strategies
Rudolph, G. (2006) · Springer eBooks · doi:10.1007/bfb0029754 · Cited by 61
A parallel implementation of genetic programming that achieves super-linear performance
André, D., & Koza, J. R. (1998) · Information Sciences · doi:10.1016/s0020-0255(97)10011-1 · Cited by 59
An Efficient Migration Scheme for Subpopulation-Based Asynchronously Parallel Genetic Algorithms
Munetomo, M., Takai, Y., & Sato, Y. (1993) · international conference on Genetic algorithms · Cited by 53
A cellular genetic algorithm with self-adjusting acceptance threshold
Rudolph, G. (1995) · doi:10.1049/cp:19951076 · Cited by 47
Optimal design of flywheels using an injection island genetic algorithm
Eby, D. J., Averill, R. C., Punch, W. F., & Goodman, E. D. (1999) · Artificial intelligence for engineering design analysis and manufacturing · doi:10.1017/s0890060499135066 · Cited by 41
Structure and Performance of Fine-Grain Parallelism in Genetic Search
Baluja, S. (1995) · CRC Press eBooks · doi:10.1201/9781420050073.ch6 · Cited by 29
Mathematical optimization: are there abstract limits on natural selection?
Bossert, W. H. (1967) · PubMed · Cited by 24
Application of Parallel Mixed-Integer Evolution Strategies with Mutation Rate Pooling.
Schütz, M., & Sprave, J. (1996) · Cited by 22
The Design of Analog Circuits by Means of Genetic Programming
Koza, J. R., André, D., & Keane, M. A. (2004) · Cited by 7
Cited by
Differential Evolution: A Survey of the State-of-the-Art
Das, S., & Suganthan, P. N. (2011) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2010.2059031 · Cited by 5,307
Introduction to Genetic Algorithms
Haupt, S. E. (2008) · Artificial Intelligence Methods in the Environmental Sciences · doi:10.1007/978-1-4020-9119-3_5 · Cited by 1,006
Ten years of genetic fuzzy systems: current framework and new trends
Cordón, O., Gomide, F., Herrera, F., Hoffmann, F., & Magdalena, L. (2004) · Fuzzy Sets and Systems · doi:10.1016/s0165-0114(03)00111-8 · Cited by 819
Dynamic Security Risk Management Using Bayesian Attack Graphs
Poolsappasit, N., Dewri, R., & Ray, I. (2012) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2011.34 · Cited by 617
Bio-inspired computation: Where we stand and what's next
Del Ser, J., Osaba, E., Molina, D., Yang, X.-S., Salcedo-Sanz, S., Camacho, D., Das, S., Suganthan, P. N., Coello Coello, C. A., & Herrera, F. (2019) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2019.04.008 · Cited by 593
Metadata
- Authors
- Alba, E., & Tomassini, M.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2002-10
- Volume
- 6
- Issue
- 5
- Pages
- 443-462
- ISSN
- 1089-778X (ISSN-L)
- OpenAlex
- W2166348281
- Cited by
- 823
- References
- 60
- FWCI
- 22.42
- 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.