An improved MOPSO with a crowding distance based external archive maintenance strategy

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

Abstract

For multi-objective optimization algorithms, the maintenance policy of external archive has a great impact on the performance of convergence and solution diversity. Considering the dilemma of large population and external archive, an improved strategy of external archive maintenance based on crowding distance is proposed, which requires less particle numbers and smaller archive size, resulting in the computation cost reduction. Furthermore, the information entropy of gbest is analyzed to emphasize the diversity improvement of non-dominant solutions and well-distribution on the Pareto-optimal front. Numerical experiments of benchmark functions demonstrate the effectiveness and efficiency of proposed multi-objective particle swarm optimization. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Li, W. X., Zhou, Q., Zhu, Y., & Pan, F. (2012). An improved MOPSO with a crowding distance based external archive maintenance strategy. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7331 LNCS, pp. 74–82). https://doi.org/10.1007/978-3-642-30976-2_9

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