A multi-objective particle swarm optimization algorithm based on Gaussian mutation and an improved learning strategy

39Citations
Citations of this article
38Readers
Mendeley users who have this article in their library.

Abstract

Obtaining high convergence and uniform distributions remains a major challenge in most metaheuristic multi-objective optimization problems. In this article, a novel multi-objective particle swarm optimization (PSO) algorithm is proposed based on Gaussian mutation and an improved learning strategy. The approach adopts a Gaussian mutation strategy to improve the uniformity of external archives and current populations. To improve the global optimal solution, different learning strategies are proposed for non-dominated and dominated solutions. An indicator is presented to measure the distribution width of the non-dominated solution set, which is produced by various algorithms. Experiments were performed using eight benchmark test functions. The results illustrate that the multi-objective improved PSO algorithm (MOIPSO) yields better convergence and distributions than the other two algorithms, and the distance width indicator is reasonable and effective.

Cite

CITATION STYLE

APA

Sun, Y., & Gao, Y. (2019). A multi-objective particle swarm optimization algorithm based on Gaussian mutation and an improved learning strategy. Mathematics, 7(2). https://doi.org/10.3390/math7020148

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free