Premium
Multi‐swarm competitive swarm optimizer for large‐scale optimization by entropy‐assisted diversity measurement and management
Author(s) -
Li Wuzhao,
Guo Weian,
Li Yongmei,
Wang Lei,
Wu Qidi
Publication year - 2020
Publication title -
concurrency and computation: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.309
H-Index - 67
eISSN - 1532-0634
pISSN - 1532-0626
DOI - 10.1002/cpe.6126
Subject(s) - swarm behaviour , premature convergence , swarm intelligence , computer science , mathematical optimization , entropy (arrow of time) , convergence (economics) , population , diversity (politics) , multi swarm optimization , local optimum , particle swarm optimization , algorithm , artificial intelligence , mathematics , economics , physics , quantum mechanics , sociology , anthropology , economic growth , demography
As a crucial factor, population diversity greatly affects performances of swarm intelligence algorithms. Especially, for large‐scale optimization problems (LSOPs), the searching space is huge and the number of local optima dramatically increases. Hence to well address LSOPs, a healthy population diversity is helpful to prevent a swarm from premature convergence. However, this is a big challenge to balance exploration and exploitation for swarm intelligence algorithms. To handle with this issue, in this paper, we design a novel algorithm structure for swarm update. In the proposed algorithm, a swarm is divided into several groups and conduct competition in each group where the loser will learn from the winner and meanwhile the winner does nothing in the corresponding iteration. For diversity measurement, we abandon the distance‐based measurement, but employ a frequency‐based measurement, namely entropy indicator, so that the diversity maintenance can be conducted with a different measurement of convergence situation. In this way, the diversity maintenance and convergence can be conducted simultaneously and independently. The benchmarks on the suite of LSOPs are employed to validate the performance of a proposed algorithm. By comparing several state‐of‐the‐art competitor algorithms, the results demonstrate that the proposed algorithm is effective and competitive in dealing with LSOPs.