16 March 2018 in IEEE Access
When dealing with complex multi-objective problems, particle swarm optimization algorithm is easy to fall into local optimum and lead to uneven distribution. Therefore, this paper presents a hybrid multi-objective particle swarm optimization algorithm based on R2 indicator (R2HMOPSO) for solving multi-objective optimization problem. The proposed algorithm uses the Sigmoid function mapping method to adjust the inertia weight and learning factors in order to tradeoffs the exploration and exploitation process effectively. In addition, simulation binary crossover operator is designed to re-initialize the particles to improve the search capability of the algorithm and to prevent particles from falling into local optimum and premature convergence. R2 indicator is incorporated into the R2HMOPSO algorithm so as to deal with the solutions of uneven distribution on the true Pareto front. Besides, polynomial mutation is used to maintain diversity in the external archive. The improved algorithm is evaluated on standard benchmarks. By comparing it with four state-of-the-art multi-objective optimization algorithms, the simulation results show that R2HMOPSO algorithm is competitive and effective in terms of convergence and distribution.
20 November 2019 in IEEE Access
Most multi-objective particle swarm optimization algorithms, which have demonstrated their good performance on various practical problems involving two or three objectives, face significant challenges in complex problems. For overcoming this challenges, a multi-objective particle swarm optimization algorithm based on enhanced selection(ESMOPSO) is proposed. In order to increase the ability of exploration and exploitation, enhanced selection strategy is designed to update personal optimal particles, and objective function weighting is used to update global optimal particle adaptively. In addition, R2 indicator is incorporated into the achievement scalarizing function to layer particles in archive, which promotes the archive update. Besides, Gaussian mutation strategy is designed to avoid particles falling into local optimum, and polynomial mutation is applied in archive to increase the diversity of elite solutions. The performance of the proposed algorithm is validated and compared with some state-of-the-art algorithms on a number of test problems. Experimental results demonstrate that ESMOPSO algorithm shows very competitive performance when dealing with complex MOPs.
6 November 2025 in European Journal of Operational Research