Parallel asynchronous particle swarm optimization. (English) Zbl 1114.65063
Summary: The high computational cost of complex engineering optimization problems has motivated the development of parallel optimization algorithms. A recent example is the parallel particle swarm optimization (PSO) algorithm, which is valuable due to its global search capabilities. Unfortunately, because existing parallel implementations are synchronous (PSPSO), they do not make efficient use of computational resources when a load imbalance exists. In this study, we introduce a parallel asynchronous PSO (PAPSO) algorithm to enhance computational efficiency. The performance of the PAPSO algorithm is compared to that of a PSPSO algorithm in homogeneous and heterogeneous computing environments for small- to medium-scale analytical test problems and a medium-scale biomechanical test problem. For all problems, the robustness and convergence rate of PAPSO are comparable to those of PSPSO. However, the parallel performance of PAPSO is significantly better than that of PSPSO for heterogeneous computing environments or heterogeneous computational tasks. For example, PAPSO is 3.5 times faster than was PSPSO for the biomechanical test problem executed on a heterogeneous cluster with 20 processors. Overall, PAPSO exhibits excellent parallel performance when a large number of processors (more than about 15) is utilized and either (1) heterogeneity exists in the computational task or environment, or (2) the computation-to-communication time ratio is relatively small.
|65K05||Mathematical programming (numerical methods)|
|65Y05||Parallel computation (numerical methods)|
|65Y20||Complexity and performance of numerical algorithms|