An effective use of crowding distance in multiobjective particle swarm optimization
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Approximating the Nondominated Front Using the Pareto Archived Evolution Strategy
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
Dynamic multiple swarms in multiobjective particle swarm optimization
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
A non-dominated sorting particle swarm optimizer for multiobjective optimization
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
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
AbYSS: Adapting Scatter Search to Multiobjective Optimization
IEEE Transactions on Evolutionary Computation
Hi-index | 0.00 |
This paper proposes a PSO-based hybrid multi-objective algorithm (HMOPSO) with the following three main features. First, the HMOPSO takes the crossover operator of the genetic algorithm as the particle updating strategy. Second, a propagating mechanism is adopted to propagate the nondominated archive. Third, a local search heuristic based on scatter search is applied to improve the non-dominated solutions. Computational study shows that the HMOPSO is competitive with previous multi-objective algorithms in literature.