A new model based multi-objective PSO algorithm

1Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Wei, J., & Wang, Y. (2007). A new model based multi-objective PSO algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4456 LNAI, pp. 87–94). https://doi.org/10.1007/978-3-540-74377-4_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free