Multiobjective evolutionary algorithms: a comparative case studyand the strength Pareto approach
IEEE Transactions on Evolutionary Computation
A fast and elitist multiobjective genetic algorithm: NSGA-II
IEEE Transactions on Evolutionary Computation
Handling multiple objectives with particle swarm optimization
IEEE Transactions on Evolutionary Computation
A Multiobjective Memetic Algorithm Based on Particle Swarm Optimization
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Interactive Particle Swarm: A Pareto-Adaptive Metaheuristic to Multiobjective Optimization
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Hi-index | 0.00 |
Particle swarm optimization (PSO) has been applied to multiobjective problems. However, PSO may easily get trapped in the local optima when solving complex problems. In order to improve convergence and diversity of solutions, a correlative particle swarm optimization (CPSO) with disturbance operation is proposed, named MO-CPSO, for dealing with multi-objective problems. MO-CPSO adopts the correlative processing strategy to maintain population diversity, and introduces a disturbance operation to the nondominated particles for improving convergence accuracy of solutions. Experiments were conducted on multi-objective benchmark problems. The experimental results showed that MO-CPSO operates better in convergence metric and diversity metric than three other related works.