An approach for diversity and convergence improvement of multi-objective particle swarm optimization

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

Abstract

To improve the diversity and convergence of multi-objective optimization, a modified Multi-Objective Particle Swarm Optimization (MOPSO) algorithm using Step-by-step Rejection (SR) strategy is presented in this paper. Instead of using crowding distance based sorting technique, the SR strategy allows only the solution with the least crowding distance to be rejected at one iteration and repeat until the predefined number of solutions selected. With introduction of SR to the selection of particles for next iteration, the modified algorithm MOPSO-SR has shown remarkable performance against a set of well-known benchmark functions (ZDT series). Comparison with the representative multi-objective algorithms, it is indicated that, with SR technique, the proposed algorithm performs well on both convergence and diversity of Pareto solutions. © Springer-Verlag Berlin Heidelberg 2013.

Cite

CITATION STYLE

APA

Cheng, S., Chen, M. Y., & Hu, G. (2013). An approach for diversity and convergence improvement of multi-objective particle swarm optimization. Advances in Intelligent Systems and Computing, 212, 495–503. https://doi.org/10.1007/978-3-642-37502-6_59

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