The particle swarm optimization (PSO) algorithm, which uses the best experience of an individual and its neighborhood to find the optimum solution, has proven useful in solving various optimization problems, including multiobjective optimization (MOO) problems. In MOO problems, existing multi-objective PSO algorithms use one or two leaders to guide the movement of every particle in a search space. This study introduces the concept of multiple leaders to guide the particles in solving MOO problems. In the proposed Multi-Leader PSO (MLPSO) algorithm, the movement of a particle is determined by all leaders that dominate that particle. This concept allows for more information sharing between particles. The performance of the MLPSO is assessed by several benchmark test problems, with their convergence and diversity values are computed. Solutions with good convergence and diversity prove the superiority of the proposed algorithm over MOPSOrand algorithm.
|ジャーナル||ARPN Journal of Engineering and Applied Sciences|
|出版ステータス||Published - 2015|
ASJC Scopus subject areas