作者
KE Parsopoulos, MN Vrahatis
发表日期
2002/3/10
研讨会论文
ACM Symposium on Applied Computing
页码范围
603-607
出版商
ACM
简介
This paper constitutes a first study of the Particle Swarm Optimization (PSO) method in Multiobjective Optimization (MO) problems. The ability of PSO to detect Pareto Optimal points and capture the shape of the Pareto Front is studied through experiments on well-known non-trivial test functions. The Weighted Aggregation technique with fixed or adaptive weights is considered. Furthermore, critical aspects of the VEGA approach for Multiobjective Optimization using Genetic Algorithms are adapted to the PSO framework in order to develop a multi-swarm PSO that can cope effectively with MO problems. Conclusions are derived and ideas for further research are proposed.
引用总数
20022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024311262836716572976576717069775042424231292715
学术搜索中的文章
KE Parsopoulos, MN Vrahatis - Proceedings of the 2002 ACM symposium on Applied …, 2002