Multi-strategy competitive-cooperative co-evolutionary algorithm and its application

•An adaptive random competition strategy is designed.•A neighborhood crossover strategy to improve convergence speed and accuracy.•A more robust multi-strategy competitive-cooperative co-evolution algorithm is presented. In order to effectively solve multi-objective optimization problems (MOPs) and...

Full description

Saved in:
Bibliographic Details
Published inInformation sciences Vol. 635; pp. 328 - 344
Main Authors Zhou, Xiangbing, Cai, Xing, Zhang, Hua, Zhang, Zhiheng, Jin, Ting, Chen, Huayue, Deng, Wu
Format Journal Article
LanguageEnglish
Published Elsevier Inc 01.07.2023
Subjects
Online AccessGet full text
ISSN0020-0255
1872-6291
DOI10.1016/j.ins.2023.03.142

Cover

More Information
Summary:•An adaptive random competition strategy is designed.•A neighborhood crossover strategy to improve convergence speed and accuracy.•A more robust multi-strategy competitive-cooperative co-evolution algorithm is presented. In order to effectively solve multi-objective optimization problems (MOPs) and fully balance uniformity and convergence, a multi-strategy competitive-cooperative co-evolutionary algorithm based on adaptive random competition and neighborhood crossover, namely MSCOEA is developed in this paper. In the MSCOEA, a new adaptive random competition strategy is designed to determine whether one sub-population loses diversity through the performance. A random competition process is executed to increase the sub-population diversity in order to compete for participation opportunities in the next iteration. And the extra population is employed to store the found non-dominated solutions. A new neighborhood crossover strategy is designed to enhance the local search ability. Finally, three different types of multi-objective benchmark functions are selected to verify the effectiveness of the MSCOEA. The experiment results show that the MSCOEA can effectively balance convergence and uniformity, and obtains better optimization performance and robustness by comparing with other algorithms. The convergence performance of the adaptive random competition and the neighborhood crossover strategies are also analyzed in detail.
ISSN:0020-0255
1872-6291
DOI:10.1016/j.ins.2023.03.142