Particle swarm optimization (PSO) is an optimizing method that is based on the theory of swarm intelligence. PSO is an effective algorithm that is used to search in a parallel manner compared to other methods. However, PSO has a tendency towards local optima when tackling complex multimodal optimization problems. It also has the disadvantages of slow convergence process and poor stability in the latter evolutionary period. In view of these demerits, a hybrid PSO method based on chaotic opposition-based initialization and an adaptive learning strategy is presented in this work (abbreviated as ACMPSO). First, the chaos initialization and opposition-based learning (OBL) are employed to produce high-quality initial particles in the feasible region, which is able to improve the quality of the initial solutions. Second, the logistic mapping embedded inertia weight is formulated to better trade off the global and local search process. Third, the global optimal particle is regulated by an exclusive velocity and position updating strategy whereas the rest particles are adjusted by the standard updating mechanism so as to prevent particles from premature convergence. Furthermore, an adaptive position update paradigm is developed to finely regulate the global exploration and local exploitation. Finally, conducted experiments on CEC’13 and CEC’22 reveal that the proposed ACMPSO outperforms several other advanced PSO variants regarding their convergence rate and accuracy. Alternatively, to further illustrate the effect of ACMPSO, we have applied it to two real-world problems, and simulation results ascertain its effectiveness and robustness.
Tian et al. (Thu,) studied this question.