Parallelization of the Conical Area Evolutionary Algorithm on Message-Passing Clusters

被引:0
|
作者
Ying, Weiqin [1 ]
Wu, Bingshen [1 ]
Xie, Yuehong [1 ]
Feng, Yuxiang [1 ]
Wu, Yu [2 ]
机构
[1] South China Univ Technol, Sch Software Engn, Guangzhou 510006, Guangdong, Peoples R China
[2] Guangzhou Univ, Sch Comp Sci & Educ Software, Guangzhou 510006, Guangdong, Peoples R China
基金
中国国家自然科学基金;
关键词
Bi-objective optimization; Evolutionary algorithm; Migration topology; Parallelization; Message passing; EFFICIENT; MOEA/D;
D O I
10.1007/978-3-319-49568-2_6
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The Conical Area Evolutionary Algorithm (CAEA) has exhibited significant performance for bi-objective optimization problems. In this paper, a parallel partially evolved CAEA (peCAEA) on message-passing clusters is proposed to further reduce the runtime of the sequential CAEA for bi-objective optimization. Each island maintains an entire population but is responsible for evolution of only a portion of the population. Further, the elitist migration adopted in order to share information among islands and speed up the evolutionary process. Additionally, a dynamic directional migration topology presented here to obtain a satisfactory balance between convergence speed and communication costs. Experimental results on ZDT test problems indicate that the peCAEA obtains satisfactory solution quality with good speedup on clusters.
引用
收藏
页码:36 / 44
页数:9
相关论文
共 50 条
  • [1] A message-passing algorithm with damping
    Pretti, M
    JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2005, : 165 - 179
  • [2] Approximate message-passing inference algorithm
    Jung, Kyomin
    Shah, Devavrat
    2007 IEEE INFORMATION THEORY WORKSHOP, VOLS 1 AND 2, 2007, : 224 - +
  • [3] Universal partially evolved parallelization of MOEA/D for multi-objective optimization on message-passing clusters
    Ying, Weiqin
    Xie, Yuehong
    Wu, Yu
    Wu, Bingshen
    Chen, Shiyun
    He, Weipeng
    SOFT COMPUTING, 2017, 21 (18) : 5399 - 5412
  • [4] A Partitioning Parallelization with Hybrid Migration of MOEA/D for Bi-Objective Optimization on Message-Passing Clusters
    Wu, Yu
    Xie, Yuehong
    Ying, Weiqin
    Xu, Xing
    Liu, Zixing
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2016, E99A (04) : 843 - 848
  • [5] Universal partially evolved parallelization of MOEA/D for multi-objective optimization on message-passing clusters
    Weiqin Ying
    Yuehong Xie
    Yu Wu
    Bingshen Wu
    Shiyun Chen
    Weipeng He
    Soft Computing, 2017, 21 : 5399 - 5412
  • [6] A comparison of different message-passing paradigms for the parallelization of two irregular applications
    Bae, SJ
    Ranka, S
    JOURNAL OF SUPERCOMPUTING, 1996, 10 (01): : 55 - 85
  • [7] A Message-Passing Algorithm for Wireless Network Scheduling
    Paschalidis, Ioannis Ch.
    Huang, Fuzhuo
    Lai, Wei
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2015, 23 (05) : 1528 - 1541
  • [8] ON AN EFFICIENT PARALLELIZATION OF EXHAUSTIVE SEQUENCE COMPARISON ALGORITHMS ON MESSAGE-PASSING ARCHITECTURES
    TRELLESSALAZAR, O
    ZAPATA, EL
    CARAZO, JM
    COMPUTER APPLICATIONS IN THE BIOSCIENCES, 1994, 10 (05): : 509 - 511
  • [9] A simple message-passing algorithm for compressed sensing
    Dept. EECS, MIT, Cambridge, MA 02139, United States
    IEEE Int Symp Inf Theor Proc, 2010, (1968-1972):
  • [10] A Simple Message-Passing Algorithm for Compressed Sensing
    Chandar, Venkat
    Shah, Devavrat
    Wornell, Gregory W.
    2010 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2010, : 1968 - 1972