计算机应用 ›› 2011, Vol. 31 ›› Issue (01): 82-84.

• 人工智能 • 上一篇    下一篇

基于交叉和变异的多目标粒子群算法

刘衍民   

  1. 山东师范大学管理与经济学院
  • 收稿日期:2010-06-17 修回日期:2010-08-10 发布日期:2011-01-12 出版日期:2011-01-01
  • 通讯作者: 刘衍民
  • 基金资助:
    国家863项目

Multi-objective particle swarm optimization based on crossover and mutation

  • Received:2010-06-17 Revised:2010-08-10 Online:2011-01-12 Published:2011-01-01

摘要: 为了保证粒子群算法求得的非劣解尽可能接近真实的Pareto前沿并保持多样性分布. 提出一种基于交叉和变异的多目标粒子群算法(CMMOPSO). 在CMMOPSO算法中, 首先, 识别Pareto前沿的稀疏部分包含的粒子, 并对这些粒子进行交叉操作以增加多样性分布; 其次, 对于远离Pareto前沿的粒子进行变异操作, 以提升粒子向真实的Pareto前沿飞行的概率. 在基准函数的测试中, 结果显示CMMOPSO算法比其它算法有更好的运行效果. 因此, CMMOPSO算法可以作为求解多目标问题的一种有效算法.

关键词: 多目标优化, 粒子群算法, 交叉, 变异, 外部存档

Abstract: In order to minimize the distance of the Pareto front produced by PSO with respect to the global Pareto front and maximize the spread of solutions found by PSO, we proposed an multi-objective particle swarm optimizer based on crossover and mutation (CMMOPSO for short). In the CMMOPSO algorithm, firstly, the number of particle in sparse part of Pareto front is defined and the crossover operator is employed to increase the diversity of the nondominated solutions; next, the mutation operation is used for the particles far away from Pareto front to improve the probability to fly to Pareto front. In benchmark functions, CMMOPSO achieves better solutions than other algorithms. Consequently, CMMOPSO can be used as an effective algorithm to solve multi-objective problems.

Key words: Multi-objective optimization, Particle swarm optimizer, Crossover, Mutation, External archive