DocumentCode :
842379
Title :
Parallelism and evolutionary algorithms
Author :
Alba, Enrique ; Tomassini, Marco
Author_Institution :
Dept. of Comput. Sci., Malaga Univ., Spain
Volume :
6
Issue :
5
fYear :
2002
fDate :
10/1/2002 12:00:00 AM
Firstpage :
443
Lastpage :
462
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
Keywords :
computational complexity; genetic algorithms; parallel algorithms; evolutionary algorithms; first hitting time; parallel algorithms; parallelization; population; time complexity; Computer science; Evolutionary computation; Iterative algorithms; Knowledge representation; Machine learning; Machine learning algorithms; Simulated annealing; Software algorithms; Stochastic processes; Stress;
fLanguage :
English
Journal_Title :
Evolutionary Computation, IEEE Transactions on
Publisher :
ieee
ISSN :
1089-778X
Type :
jour
DOI :
10.1109/TEVC.2002.800880
Filename :
1041554
Link To Document :
بازگشت