粒子群优化
多目标优化
计算机科学
进化算法
多群优化
元启发式
数学优化
进化计算
帕累托原理
启发式
帝国主义竞争算法
优化测试函数
最优化问题
数学
作者
Carlos A. Coello Coello,Gregorio Toscano‐Pulido,M.S. Lechuga
标识
DOI:10.1109/tevc.2004.826067
摘要
This paper presents an approach in which Pareto dominance is incorporated into particle swarm optimization (PSO) in order to allow this heuristic to handle problems with several objective functions. Unlike other current proposals to extend PSO to solve multiobjective optimization problems, our algorithm uses a secondary (i.e., external) repository of particles that is later used by other particles to guide their own flight. We also incorporate a special mutation operator that enriches the exploratory capabilities of our algorithm. The proposed approach is validated using several test functions and metrics taken from the standard literature on evolutionary multiobjective optimization. Results indicate that the approach is highly competitive and that can be considered a viable alternative to solve multiobjective optimization problems.
科研通智能强力驱动
Strongly Powered by AbleSci AI