系统工程与电子技术

• 软件、算法与仿真 • 上一篇    下一篇

结合局部理想点搜索的多目标粒子群算法

程诗信, 詹浩, 舒兆鑫   

  1. (西北工业大学翼型叶栅空气动力学国防科技重点研究室, 陕西 西安 710072)
  • 出版日期:2015-09-25 发布日期:2010-01-03

Multi-objective particle swarm optimization algorithm with#br# local optimal particles search method

CHENG Shixin, ZHAN Hao, SHU Zhaoxin   


  1. (National Key Laboratory of Aerodynamic Design and Research, Northwestern
    Polytechnical University, Xi’an 710072, China)
  • Online:2015-09-25 Published:2010-01-03

摘要:

提出了一种结合约束二次逼近优化(bound optimization by quadratic approximation,BOBYQA)搜索算法的理想点法对非支配解进行局部优化的混合多目标粒子群方法(local search with multiobjective particle swarm optimization, LSMOPSO),以提高多目标粒子群算法的收敛性能和非支配解集的精度与多样性。LSMOPSO算法使用拥挤距离选择领导粒子组成领导粒子集,并对其进行理想点局部搜索;分析比较了全局理想点和局部理想点对算法性能的影响,提出基于局部理想点的局部搜索策略;在粒子的设计空间的多个维度上引入均匀变异操作,降低算法陷入局部最优的可能。基本测试函数的求解结果表明,算法的收敛速度很快,而且搜索到的非支配解集的精度高、多样性好。

Abstract:

A new hybrid multiobjective optimizer is presented, which combines particle swarm optimization (PSO) with an innovative optimal particles local search strategy based on bound optimization by quadratic approximation (BOBYQA) algorithm. The main goal of the approach is to improve the convergence performance of PSO and diversity of nondominated set. The new approach constructs the leader particles set using crowding distance to select leader particles, then makes full use of the optimal particles method to guide leader particles approach the Pareto front quickly. Meanwhile, a new local optimal particles search strategy is proposed after analysis on disadvantage of the global optimal particles search method. Furthermore, the multidimensional uniform mutation is introduced to prevent algorithm from being trapped into local optimum. Simulation results of benchmark functions show that our approach is highly competitive in convergence speed and generates a well distributed and accurate set of nondominated solutions.