Journal of Northeastern University ›› 2010, Vol. 31 ›› Issue (7): 913-916.DOI: -

• OriginalPaper •     Next Articles

Dynamic swarm multiobjective optimization PSO-based maximin function

Feng, Lin (1); Mao, Zhi-Zhong (1); Yuan, Ping (1)   

  1. (1) School of Information Science and Engineering, Northeastern University, Shenyang 110004, China
  • Received:2013-06-20 Revised:2013-06-20 Online:2010-07-15 Published:2013-06-20
  • Contact: Feng, L.
  • About author:-
  • Supported by:
    -

Abstract: Since the local convergence was often found in the process that the PSO algorithm is used to deal with multiobjective optimization problems, an new algorithm based on Maximin PSO algorithm is presented for multiobjective PSO, where the swarm size is adjusted dynamically to avoid converging at a false Pareto optimal solutions. Meanwhile, the relative fitness variance of particle is introduced into the formula of Maximin to get rid of the effect of reducing the diversity of particle swarm. Then, based on the idea about Pareto optimum, the variance Maximin strategy is used to evaluate the optimal solutions and the non-dominated solutions are stored in a size-variable elitism repository so as to provide a good diversity in its solutions. Experimental results showed the feasibility of the algorithm in solving complicated multi-objective optimization in industry.

CLC Number: