• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

Computer Engineering & Science ›› 2010, Vol. 32 ›› Issue (11): 85-88.

Previous Articles     Next Articles

A MultiObjective Particle Swarm AlgorithmBased on the Pareto Optimization Solution Set

PEI Shengyu,ZHOU Yongquan   

  1. (School of Mathematics and Computer Science,Guangxi University for Nationalities,Nanning 530006,China)
  • Received:2009-06-12 Revised:2009-09-28 Online:2010-11-25 Published:2010-11-25

Abstract: This paper presents a novel effective multiobjective particle swarm algorithm based on the Pareto nondominated set,in which the Pareto nondominated ranking,the elitism strategy,the tournament selection and the crowding distance method are integrated into a new rule by improving the update strategy of particles. Finally,seven classical functions are used to test the performance of the algorithm. Experimental results show that the proposed approach is efficient and outperforms the conventional algorithms such as NSGAII,SPEA2.

Key words: Pareto nondominated set, elitism strategy, tournament selection, crowding distance, particle swarm optimization algorithm