A novel multi-objective particle swarm optimization with K-means based global best selection strategy

12Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper, a multi-objective particle swarm optimization algorithm with a new global best (gbest) selection strategy is proposed for dealing with multi-objective problems. In multi-objective particle swarm optimization, gbest plays an important role in convergence and diversity of solutions. A K-means algorithm and proportional distribution based approach is used to select gbest from the archive for each particle of the population. A symmetric mutation operator is incorporated to enhance the exploratory capabilities. The proposed approach is validated using seven popular benchmark functions. The simulation results indicate that the proposed algorithm is highly competitive in terms of convergence and diversity in comparison with several state-of-the-art algorithms. © 2013 Copyright the authors.

Cite

CITATION STYLE

APA

Qiu, C., Wang, C., & Zuo, X. (2013). A novel multi-objective particle swarm optimization with K-means based global best selection strategy. International Journal of Computational Intelligence Systems, 6(5), 822–835. https://doi.org/10.1080/18756891.2013.805584

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