Asynchronous parallelization of particle swarm optimization through digital pheromone sharing

被引:6
作者
Kalivarapu, Vijay K. [1 ]
Winer, Eliot H. [1 ]
机构
[1] Iowa State Univ, Dept Mech Engn, Virtual Real Applicat Ctr, Ames, IA 50011 USA
关键词
Particle swarm optimization; Digital pheromones; Asynchronous parallelization; Parallelization; VELOCITY UPDATE RULES; DESIGN OPTIMIZATION; ALGORITHM; COLONY;
D O I
10.1007/s00158-008-0324-6
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
In this paper, a model for sharing digital pheromones between multiple particle swarms to search n-dimensional design spaces in an asynchronous parallel computing environment is presented. Particle swarm optimization (PSO) is an evolutionary technique used to effectively search multi-modal design spaces. With the aid of digital pheromones, members in a swarm can better communicate with each other to improve search performance. Previous work by the authors demonstrated the capability of digital pheromones within PSO for searching the global optimum in both single and coarse grain synchronous parallel computing environments. In the coarse grain approach, multiple swarms are simultaneously deployed across various processors and synchronization is carried out only when all swarms achieved convergence, in an effort to reduce processor-to-processor communication and network latencies. However, it is theorized that with an appropriate parallelization scheme, the benefits of digital pheromones and communication between swarms can outweigh the network bandwidth latencies resulting in improved search efficiency and accuracy. To explore this idea, a swarm is deployed in the design space across different processors. Through an additional processor, each part of the swarm can communicate with the others. While digital pheromones aid communication within a swarm, the developed parallelization model facilitates communication between multiple swarms resulting in improved search accuracy and efficiency. The development of this method and results from solving several multi-modal test problems are presented.
引用
收藏
页码:263 / 281
页数:19
相关论文
共 82 条
[61]   A study of global optimization using particle swarms [J].
Schutte, JF ;
Groenwold, AA .
JOURNAL OF GLOBAL OPTIMIZATION, 2005, 31 (01) :93-108
[62]   Parallel global optimization with the particle swarm algorithm [J].
Schutte, JF ;
Reinbolt, JA ;
Fregly, BJ ;
Haftka, RT ;
George, AD .
INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, 2004, 61 (13) :2296-2315
[63]   Sizing design of truss structures using particle swarms [J].
Schutte, JF ;
Groenwold, AA .
STRUCTURAL AND MULTIDISCIPLINARY OPTIMIZATION, 2003, 25 (04) :261-269
[64]  
Sedlaczek K, 2006, STRUCT MULTIDISCIP O, V32, P277, DOI 10.1007/s00158-006-0032-z
[65]  
SHEN B, 2006, LECT NOTES COMPUTER, P859
[66]  
Shi XH, 2003, IEEE C EVOL COMPUTAT, P2393
[67]  
SHI Y, 1998, P 1998 ANN C EV COMP
[68]   A modified particle swarm optimizer [J].
Shi, YH ;
Eberhart, R .
1998 IEEE INTERNATIONAL CONFERENCE ON EVOLUTIONARY COMPUTATION - PROCEEDINGS, 1998, :69-73
[69]  
Sivanandam S., 2008, INTRO GENETIC ALGORI, P165, DOI [DOI 10.1007/978-3-540-73190-0, 10.1007/978-3-540-73190-07]
[70]   GENETIC ALGORITHMS - A SURVEY [J].
SRINIVAS, M ;
PATNAIK, LM .
COMPUTER, 1994, 27 (06) :17-26