A Multi-Objective Chaotic Particle Swarm Optimization Algorithm Based on Improved Inertial Weights
Abstract
In order to enhance the convergence and distribution of multi-objective particle swarm algorithm, an improved multi-objective particle swarm optimization algorithm was proposed. Linear decreasing inertia weight was used to update. The method can improve the deficiency that the algorithm falls into local optimal easily. The improved Logistic mapping was used to increase ergodicity of the particles. The method can expand the search scope. At the same time, the elite archiving mechanism and the mutation probability were introduced to increase the disturbance. The method can improve the local optimal. Compared with the real Pareto front, NSGA-II and MOEAD algorithm, the simulation shows that the algorithm proposed in the paper is effective.
Keywords
Multi-Objective particle swarm optimization algorithm, Logistic map, Elite archiving mechanism, Mutation probability.
DOI
10.12783/dtcse/CCNT2018/24671
10.12783/dtcse/CCNT2018/24671
Refbacks
- There are currently no refbacks.