A New Model Based Multi-objective PSO Algorithm

Authors:
Jingxuan Wei;Yuping Wang
Affiliations:
School of Computer Science and Technology, Xidian University, Xi' an 710071, China and Department of Mathematics, Xidian University, Xi' an 710071, China;School of Computer Science and Technology, Xidian University, Xi' an 710071, China
Venue:
Computational Intelligence and Security
Year:
2007

Citing 4
Cited 0

Evolutionary Algorithms for Solving Multi-Objective Problems

Evolutionary Algorithms for Solving Multi-Objective Problems
Multiobjective evolutionary algorithms: classifications, analyses, and new innovations

Multiobjective evolutionary algorithms: classifications, analyses, and new innovations
Comparison of Multiobjective Evolutionary Algorithms: Empirical Results

Evolutionary Computation
A fast and elitist multiobjective genetic algorithm: NSGA-II

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, the multi-objective optimization problem is converted into the constrained optimization problem. For the converted problem, a novel PSO algorithm with dynamical changed inertia weight is proposed. Meanwhile, in order to overcome the drawback that most algorithms take pareto dominance as selection strategy but do not use any preference information. A new selection strategy based on the constraint dominance principle is proposed. The computer simulations for four difficulty benchmark functions show that the new algorithm is able to find uniformly distributed pareto optimal solutions and is able to converge to the pareto-optimal front.