Synchronous parallelization of Particle Swarm Optimization with digital pheromones

被引:15
作者
Kalivarapu, Vijay [1 ]
Foo, Jung-Leng [1 ]
Winer, Eliot [1 ]
机构
[1] Iowa State Univ, Virtual Real Applicat Ctr, Dept Mech Engn, Ames, IA 50011 USA
关键词
Particle Swarm Optimization; Digital pheromones; Synchronous parallelization; Multi-modal design spaces; VELOCITY UPDATE RULES; ALGORITHM; DESIGN;
D O I
10.1016/j.advengsoft.2009.04.002
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
In this paper, Particle Swarm Optimization (PSO) using digital pheromones to coordinate swarms within n-dimensional design spaces in a parallel computing environment is presented. Digital pheromones are models simulating real pheromones emitted by insects for communication to indicate suitable food or nesting location. Particle swarms search the design space with digital pheromones aiding communication within the swarm during an iteration to improve search efficiency. Previous work by the authors demonstrated the capability of digital pheromones within PSO for searching the global optimum with improved accuracy, efficiency and reliability in a single processor computing environment. When multiple swarms explore and exploit the design space in a parallel computing environment, the solution characteristics can be further improved. This premise is investigated through deploying swarms on multiple processors in a distributed memory parallel computing environment. The primary hurdle for the developed algorithm was bandwidth latency due to synchronization across processors, causing the solution duration due to each swarm to be only as fast as the slowest participating processor. However, it has been observed that the speedup and parallel efficiency improved substantially as the dimensionality of the problems increased. The development of the method along with results from six test problems is presented. (C) 2009 Elsevier Ltd. All rights reserved,
引用
收藏
页码:975 / 985
页数:11
相关论文
共 61 条
[1]  
[Anonymous], 2005, P 6 WORLD C STRUCT M
[2]  
[Anonymous], 2004, DISCRETE PARTICLE SW
[3]  
[Anonymous], P 4 WORLD C STRUCT M
[4]  
BATKIEWICZ T, 2006, P 11 AIAA ISSMO MULT
[5]   Structural optimization for post-buckling behavior using particle swarms [J].
Bochenek, B. ;
Forys, P. .
STRUCTURAL AND MULTIDISCIPLINARY OPTIMIZATION, 2006, 32 (06) :521-531
[6]  
Carlisle A., 2001, P PARTICLE SWARM OPT, P1
[7]  
Coello CAC, 2004, IEEE T EVOLUT COMPUT, V8, P256, DOI [10.1109/TEVC.2004.826067, 10.1109/tevc.2004.826067]
[8]  
COLORNI A, 1991, P EUR C ART LIF AMST
[9]   Ant system: Optimization by a colony of cooperating agents [J].
Dorigo, M ;
Maniezzo, V ;
Colorni, A .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 1996, 26 (01) :29-41
[10]  
Eberhart R., MHS 95 P 6 INT S MIC, DOI [DOI 10.1109/MHS.1995.494215, 10.1109/mhs.1995.494215, 10.1109/MHS.1995.494215]