期刊
MATHEMATICS AND COMPUTERS IN SIMULATION
卷 208, 期 -, 页码 246-282出版社
ELSEVIER
DOI: 10.1016/j.matcom.2022.12.020
关键词
Multi-sample learning; Particle swarm optimization; Adaptive; Crossover operation
This study proposes a multi-sample learning particle swarm optimization algorithm to overcome the drawbacks of traditional PSO. It uses a multi-sample selecting strategy and an adaptive sample crossover strategy to select proper learning samples for the population. Experimental results show that the proposed algorithm outperforms other competitive algorithms and meta-heuristics in most functions.
Particle swarm optimization (PSO) is a well-known optimization method used for solving various optimization problems. However, PSO suffers from premature convergence and is ineffective in balancing exploration and exploitation when solving complex optimization problems. To overcome these drawbacks of PSO, a multi-sample learning particle swarm optimization with adaptive crossover operation (MLPSO) is proposed. In MLPSO, two novel strategies, multi-sample selecting strategy (MSS) and adaptive sample crossover strategy (ASC), are used to select proper learning samples for the whole population. Firstly, in MSS, two sample pools, namely elite pool and improver pool, are used to save elites and improvers. Elites are the particles with preferable fitness, while improvers denote the particles whose fitness have been improved largely in recent consecutive generations. In each generation, two particles are randomly selected from the two sample pools respectively to breed a learning sample through crossover operation for the whole population. Therefore, the generated learning sample by MSS strategy contains more diversity information. Secondly, in ASC, various crossover operations are conducted for breeding a learning sample according to the evolutionary states. Therefore, the ASC strategy proposed in this paper can realize a better trade-off between exploration and exploitation. Finally, the performance of MLPSO is evaluated using CEC2013, CEC2017 test suites and three engineering optimization problems. Experimental results show that MLPSO outperforms compared seven competitive PSO variants and 19 meta-heuristics algorithms in most functions.(C) 2023 International Association for Mathematics and Computers in Simulation (IMACS). Published by Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据