Parallelism and evolutionary algorithms

681Citations
Citations of this article
198Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper contains a modern vision of the parallelization techniques used for evolutionary algorithms (EAs). The work is motivated by two fundamental facts: first, the different families of EAs have naturally converged in the last decade while parallel EAs (PEAs) seem still to lack unified studies, and second, 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 PEAs in order to make researchers aware of the benefits of decentralizing and parallelizing an EA.

Cite

CITATION STYLE

APA

Alba, E., & Tomassini, M. (2002). Parallelism and evolutionary algorithms. IEEE Transactions on Evolutionary Computation, 6(5), 443–462. https://doi.org/10.1109/TEVC.2002.800880

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free