Particle swarm optimization method in multiobjective problems
Proceedings of the 2002 ACM symposium on Applied computing
Multiple Objective Optimization with Vector Evaluated Genetic Algorithms
Proceedings of the 1st International Conference on Genetic Algorithms
Genetic Algorithms for Multiobjective Optimization: FormulationDiscussion and Generalization
Proceedings of the 5th International Conference on Genetic Algorithms
Multiobjective evolutionary algorithms: classifications, analyses, and new innovations
Multiobjective evolutionary algorithms: classifications, analyses, and new innovations
Approximating the Nondominated Front Using the Pareto Archived Evolution Strategy
Evolutionary Computation
Comparison of Multiobjective Evolutionary Algorithms: Empirical Results
Evolutionary Computation
Evolutionary Algorithms for Solving Multi-Objective Problems (Genetic and Evolutionary Computation)
Evolutionary Algorithms for Solving Multi-Objective Problems (Genetic and Evolutionary Computation)
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
Multi-objective genetic algorithms: Problem difficulties and construction of test problems
Evolutionary Computation
Multiobjective evolutionary algorithms: a comparative case studyand the strength Pareto approach
IEEE Transactions on Evolutionary Computation
IEEE Transactions on Evolutionary Computation
A fast and elitist multiobjective genetic algorithm: NSGA-II
IEEE Transactions on Evolutionary Computation
Considerations in engineering parallel multiobjective evolutionary algorithms
IEEE Transactions on Evolutionary Computation
Handling multiple objectives with particle swarm optimization
IEEE Transactions on Evolutionary Computation
Hi-index | 0.00 |
This paper introduces the solution exploration strategy into particle swarm optimization (PSO) to distribute local guides for each particle of the population to lead them find out the solutions of Pareto optimal set. After solution found, we utilize cluster concept to sift representative nondominated solutions from the external repository to keep their diversity. We also incorporate a mutation like operator that enhances the solution searching capability. We compared our method to other related MO methods. These methods are examined on different test functions and the results are compared with the results of multi-objective evolutionary algorithm (MOEA).