Two-lbests based multi-objective particle swarm optimizer

The global best (gbest) or local best (lbest) of every particle in state-of-the-art multi-objective particle swarm optimization (MOPSO) implementations is selected from the non-dominated solutions in the external archive. This approach emphasizes the elitism at the expense of diversity when the size of the current set of non-dominated solutions in the external archive is small. This article proposes that the gbests or lbests should be chosen from the top fronts in a non-domination sorted external archive of reasonably large size. In addition, a novel two local bests (lbest) based MOPSO (2LB-MOPSO) version is proposed to focus the search around small regions in the parameter space in the vicinity of the best existing fronts unlike the current MOPSO variants in which the pbest and gbest (or lbest) of a particle can be located far apart in the parameter space thereby potentially resulting in a chaotic search behaviour. Comparative evaluation using 19 multi-objectives test problems and 11 state-of-the-art multi-objective evolutionary algorithms ranks overall the 2LB-MOPSO as the best while two state-of-the-art MOPSO algorithms are ranked the worst with respect to other multi-objective evolutionary algorithms.

[1]  Chun Chen,et al.  Multiple trajectory search for multiobjective optimization , 2007, 2007 IEEE Congress on Evolutionary Computation.

[2]  Cheng Wang,et al.  A Novel Method for Finding Good Local Guides in Multi-objective Particle Swarm Optimization , 2007, Third International Conference on Natural Computation (ICNC 2007).

[3]  R. K. Ursem.  Multi-objective Optimization using Evolutionary Algorithms , 2009 .

[4]  Konstantinos E. Parsopoulos,et al.  MULTIOBJECTIVE OPTIMIZATION USING PARALLEL VECTOR EVALUATED PARTICLE SWARM OPTIMIZATION , 2003 .

[5]  Carlos A. Coello Coello,et al.  Improving PSO-Based Multi-objective Optimization Using Crowding, Mutation and epsilon-Dominance , 2005, EMO.

[6]  Jing J. Liang,et al.  Comprehensive learning particle swarm optimizer for solving multiobjective optimization problems , 2006, Int. J. Intell. Syst..

[7]  Carlos A. Coello Coello,et al.  Handling multiple objectives with particle swarm optimization , 2004, IEEE Transactions on Evolutionary Computation.

[8]  R. Lyndon While,et al.  A review of multiobjective test problems and a scalable test problem toolkit , 2006, IEEE Transactions on Evolutionary Computation.

[9]  C. Coello,et al.  Improving PSO-based Multi-Objective Optimization using Crowding , Mutation and �-Dominance , 2005 .

[10]  David W. Corne,et al.  Approximating the Nondominated Front Using the Pareto Archived Evolution Strategy , 2000, Evolutionary Computation.

[11]  Andrew Lewis,et al.  Hybrid Particle Guide Selection Methods in Multi-Objective Particle Swarm Optimization , 2006, 2006 Second IEEE International Conference on e-Science and Grid Computing (e-Science'06).

[12]  Gary B. Lamont,et al.  Evolutionary Algorithms for Solving Multi-Objective Problems , 2002, Genetic Algorithms and Evolutionary Computation.

[13]  Rainer Laur,et al.  Differential evolution with adaptive parameter setting for multi-objective optimization , 2007, 2007 IEEE Congress on Evolutionary Computation.

[14]  Rainer Laur,et al.  Adaptive parameter setting for a multi-objective particle swarm optimization algorithm , 2007, 2007 IEEE Congress on Evolutionary Computation.

[15]  Kalyanmoy Deb,et al.  Hybridization of SBX based NSGA-II and sequential quadratic programming for solving multi-objective optimization problems , 2007, 2007 IEEE Congress on Evolutionary Computation.

[16]  Jing J. Liang,et al.  Comprehensive learning particle swarm optimizer for global optimization of multimodal functions , 2006, IEEE Transactions on Evolutionary Computation.

[17]  Mehmet Fatih Tasgetiren,et al.  Multi-objective optimization based on self-adaptive differential evolution algorithm , 2007, 2007 IEEE Congress on Evolutionary Computation.

[18]  Marco Laumanns,et al.  An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method , 2006, Eur. J. Oper. Res..

[19]  Lothar Thiele,et al.  A Tutorial on the Performance Assessment of Stochastic Multiobjective Optimizers , 2006 .

[20]  Kalyanmoy Deb,et al.  A hybrid multi-objective optimization procedure using PCX based NSGA-II and sequential quadratic programming , 2007, 2007 IEEE Congress on Evolutionary Computation.

[21]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[22]  Janez Brest,et al.  Differential evolution for multiobjective optimization with self adaptation , 2007, 2007 IEEE Congress on Evolutionary Computation.

[23]  Russell C. Eberhart,et al.  A new optimizer using particle swarm theory , 1995, MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science.

[24]  Günter Rudolph,et al.  Capabilities of EMOA to Detect and Preserve Equivalent Pareto Subsets , 2007, EMO.

[25]  Vui Ann Shim,et al.  Evolutionary algorithms for solving multi-objective travelling salesman problem , 2011 .

[26]  Jouni Lampinen,et al.  Performance assessment of Generalized Differential Evolution 3 (GDE3) with a given set of problems , 2007, 2007 IEEE Congress on Evolutionary Computation.

[27]  Jürgen Branke,et al.  About Selecting the Personal Best in Multi-Objective Particle Swarm Optimization , 2006, PPSN.

[28]  M Reyes Sierra,et al.  Multi-Objective Particle Swarm Optimizers: A Survey of the State-of-the-Art , 2006 .

[29]  Tapabrata Ray,et al.  A Swarm Metaphor for Multiobjective Design Optimization , 2002 .

[30]  Jing J. Liang,et al.  Problem Definitions for Performance Assessment of Multi-objective Optimization Algorithms , 2007 .