Particle swarm optimization method in multiobjective problems
Proceedings of the 2002 ACM symposium on Applied computing
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
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 particle swarm optimization algorithm with cauchy mutation and natural selection strategy
ISICA'07 Proceedings of the 2nd international conference on Advances in computation and intelligence
An improved multi-objective particle swarm optimization algorithm
ISICA'07 Proceedings of the 2nd international conference on Advances in computation and intelligence
An orthogonal genetic algorithm with quantization for globalnumerical optimization
IEEE Transactions on Evolutionary Computation
A fast and elitist multiobjective genetic algorithm: NSGA-II
IEEE Transactions on Evolutionary Computation
Multi-objective PSO based on evolutionary programming
ICIC'10 Proceedings of the 6th international conference on Advanced intelligent computing theories and applications: intelligent computing
Hi-index | 0.00 |
Particle Swarm Optimization is a promising evolutionary optimization algorithm. In this paper, an improved hybrid multi-objective particle swarm optimization algorithm (IHMOPSO) is proposed. IHMOPSO uses orthogonal design to initialize population, selects global optimal position from Pareto set. Apply mutation, cross operation and evolutionary selection, and uses two ways to update the position and velocity of particles. Experimental results on many well-known benchmark optimization problems have shown that IHMOPSO is effective and efficient.