Jisuanji kexue yu tansuo (Jun 2024)

Multi-objective Particle Swarm Optimization Algorithm Guided by Extreme Learning Decision Network

  • ZHANG Yifan, SONG Wei

DOI
https://doi.org/10.3778/j.issn.1673-9418.2304026
Journal volume & issue
Vol. 18, no. 6
pp. 1513 – 1525

Abstract

Read online

When solving multi-objective optimization problems, particle swarm optimization algorithms usually employ preset example selection methods and search strategies, which cannot be adjusted according to specific optimization states. In the face of different optimization problems, inappropriate search strategies cannot effectively guide the population, resulting in low search performance of the population. To solve the above problems, a multi-objective particle swarm optimization algorithm guided by extreme learning decision network (ELDN-PSO) is proposed. First of all, the multi-objective optimization problem is decomposed into several scalar subproblems, and an extreme learning decision network is constructed. The network takes the particle position as input, and selects appropriate search actions for each particle according to the optimization state. The fitness change of a particle on the subproblem is obtained as the training sample for the reinforcement learning, and the training speed is improved by extreme learning machine. In the process of optimization, the network is automatically adjusted according to the optimization states, and it selects the appropriate search strategy for the particles at different search stages. Secondly, the non-dominated solutions in the multi-objective optimization problem are difficult to compare. Thus, the leadership of each solution is quantified into a comparable value, so that the examples are more clearly selected for the particles. In addition, an external archive is used to store better particles to maintain the quality of the solutions and guide the population. Comparative experiments are carried out on the ZDT and DTLZ test functions. The results show that ELDN-PSO can effectively cope with different Pareto front shapes, improving the optimization speed as well as the convergence and diversity of the solutions.

Keywords