计算机科学 ›› 2011, Vol. 38 ›› Issue (4): 260-262.

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

基于自适应拥挤网格的多目标粒子群算法

刘衍民,邵增珍,赵庆祯   

  1. (遵义师范学院数学系 遵义563002);(山东师范大学管理与经济学院 济南250014);(山东师范大学信息科学与工程学院 济南250014)
  • 出版日期:2018-11-16 发布日期:2018-11-16
  • 基金资助:
    本文受山东省科技攻关项目(2009GG10001008)和遵义科技攻关项目【2008】21号资助。

Multi-objective Particle Swarm Optimizer Based on Adaptive Crowding Grid

LIU Yan-min,SHAO Zeng-zhen,ZHAO Qing-zhen   

  • Online:2018-11-16 Published:2018-11-16

摘要: 粒子群算法求解多目标问题极易收敛到伪Parct。前沿(等价于单目标优化问题中的局部最优解),并且收敛速度较慢。鉴于此,提出一种基于自适应拥挤网格的多目标粒子群算法(ACG-MOPSO)。其特点包括:利用自适应网格和拥挤距离确定外部存档中粒子的密度,并利用密度信息维持外部存档的规模;利用外部存档中非劣解的密度和拥挤距离信息确定全局最优粒子,提升粒子向Parcto前沿收敛的概率。模拟结果表明该算法在求解多目标问题上要优于其它算法。

关键词: 多目标,粒子群算法,自适应拥挤网格

Abstract: Multi-Objective Particle Swarm Optimizers(MOPSOs) easily converge to a false Pareto front(i. e.,the equivalent of a local optimum in single objective optimization) , and converge slowly. So, we proposed a multi-objective PSO based on adaptive crowding grid(ACG-MOPSO for short). The proposed algorithem has the following characteristic: adaptive crowding grid was used to define the diversity of particles in the external archive to keep the size of the external archive, and the global best particle was assigned by the informations of density and crowding distance to improve the probability of flying to Pareto front Simulation results show that the ACG-MOPSO algorithm is able to find better solutions compared with other algorithms.

Key words: Multi-objective, Particle swarm optimizer, Adaptive crowding grid

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!