Parallelism and evolutionary algorithms

被引:504
|
作者
Alba, E [1 ]
Tomassini, M
机构
[1] Univ Malaga, Dept Comp Sci, E-29071 Malaga, Spain
[2] Univ Lausanne, Inst Comp Sci, CH-1015 Lausanne, Switzerland
关键词
evolutionary algorithms; first hitting time; population; time complexity;
D O I
10.1109/TEVC.2002.800880
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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.
引用
收藏
页码:443 / 462
页数:20
相关论文
共 50 条
  • [1] SCALABLE PARALLELISM BY EVOLUTIONARY ALGORITHMS
    HOFFMEISTER, F
    [J]. LECTURE NOTES IN ECONOMICS AND MATHEMATICAL SYSTEMS, 1991, 367 : 177 - 198
  • [2] Analysis of implicit parallelism in evolutionary algorithms: A stochastic version
    Ding, LX
    Kang, LS
    [J]. ICCIMA 2001: FOURTH INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND MULTIMEDIA APPLICATIONS, PROCEEDINGS, 2001, : 172 - 179
  • [3] Evolutionary Parallelism
    Hocart, A. M.
    [J]. MAN, 1937, 37 (04): : 70 - 70
  • [4] Increasing parallelism of evolutionary algorithms by Nash games in design inverse flow problems
    Leskinen, Jyri
    Wang, Hong
    Periaux, Jacques
    [J]. ENGINEERING COMPUTATIONS, 2013, 30 (04) : 581 - 600
  • [5] MEASURING PARALLELISM IN ALGORITHMS
    JEREB, B
    PIPAN, L
    [J]. MICROPROCESSING AND MICROPROGRAMMING, 1992, 34 (1-5): : 49 - 52
  • [6] The Tao of Parallelism in Algorithms
    Pingali, Keshav
    Donald Nguyen
    Kulkarni, Milind
    Burtscher, Martin
    Hassaan, M. Amber
    Kaleem, Rashid
    Lee, Tsung-Hsien
    Lenharth, Andrew
    Manevich, Roman
    Mendez-Lojo, Mario
    Prountzos, Dimitrios
    Sui, Xin
    [J]. ACM SIGPLAN NOTICES, 2011, 46 (06) : 12 - 25
  • [7] The Tao of Parallelism in Algorithms
    Pingali, Keshav
    Donald Nguyen
    Kulkarni, Milind
    Burtscher, Martin
    Hassaan, M. Amber
    Kaleem, Rashid
    Lee, Tsung-Hsien
    Lenharth, Andrew
    Manevich, Roman
    Mendez-Lojo, Mario
    Prountzos, Dimitrios
    Sui, Xin
    [J]. PLDI 11: PROCEEDINGS OF THE 2011 ACM CONFERENCE ON PROGRAMMING LANGUAGE DESIGN AND IMPLEMENTATION, 2011, : 12 - 25
  • [8] Evolutionary search for musical parallelism
    Madsen, ST
    Widmer, G
    [J]. APPLICATIONS OF EVOLUTIONARY COMPUTING, PROCEEDINGS, 2005, 3449 : 488 - 497
  • [9] EVOLUTIONARY PARALLELISM AND HUMAN PHYLOGENY
    不详
    [J]. MAN, 1936, 36 (01): : 4 - 8
  • [10] Foreword: Parallelism in Algorithms and Architectures
    Geppino Pucci
    Victor Luchangco
    Rajmohan Rajaraman
    [J]. Theory of Computing Systems, 2014, 55 : 449 - 450