Particle swarm optimization method in multiobjective problems
Proceedings of the 2002 ACM symposium on Applied computing
Multiobjective optimization using dynamic neighborhood particle swarm optimization
CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
MOPSO: a proposal for multiple objective particle swarm optimization
CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
Two-level of nondominated solutions approach to multiobjective particle swarm optimization
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Molecular docking with multi-objective Particle Swarm Optimization
Applied Soft Computing
A fast and elitist multiobjective genetic algorithm: NSGA-II
IEEE Transactions on Evolutionary Computation
Energy and path aware clustering algorithm (EPAC) for mobile ad hoc networks
ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part IV
Hi-index | 0.00 |
Particle Swarm Optimization (PSO) is easier to realize and has a better performance than evolutionary algorithm in many fields. This paper proposes a novel multi-objective particle swarm optimization algorithm inspired from Game Strategies (GMOPSO), where those optimized objectives are looked as some independent agents which tend to optimize own objective function. Therefore, a multi- player game model is adopted into the multi-objective particle swarm algorithm, where appropriate game strategies could bring better multi-objective optimization performance. In the algorithm, novel bargain strategy among multiple agents and nondominated solutions archive method are designed for improving optimization performance. Moreover, the algorithm is validated by several simulation experiments and its performance is tested by different benchmark functions.