计算机科学 ›› 2012, Vol. 39 ›› Issue (11): 174-178.

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

局部搜索与改进MOPSO的混合优化算法及其应用

王丽萍,吴秋花,邱飞岳,吴裕市   

  1. (浙江工业大学经贸管理学院 杭州310023);(浙江工业大学智能信息处理研究所 杭州310023);(浙江工业大学现代教育技术研究所 杭州310014);(浙江工业大学信息工程学院 杭州310023)
  • 出版日期:2018-11-16 发布日期:2018-11-16

Hybrid Optimized Algorithm Based on Improved MOPSO and Local Search and its Application

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

摘要: 为弥补粒子群后期收敛缓慢与早熟的不足,提出了一种局部搜索与改进MOPSO的混合优化算法(H-MOP- SO)。该算法首先采用非均匀变异算子和自适应惯性权重,强化全局搜索能力;继而建立混合算法模型,并利用侧步 爬山搜索算法对粒子群作周期性优化,使远离前沿的粒子朝下降方向搜索,而靠近前沿的粒子朝非支配方向搜索,加 快粒子群的收敛并改善解集多样性。对标准测试函数的求解表明,该算法比MOPSO, NSGA-II和MOEA/D具有更 好的多样性和收敛性。供应商优选问题的求解进一步验证了H-MOPSO的有效性。

关键词: 多目标优化,粒子群算法,局部搜索,混合算法

Abstract: In order to improve the weaknesses of the particle swarm's easily premature and slow convergence in late stage, the H-MOPSO, based on the integration of improved MOPSO and local search, was proposed. First of all, the non-uniform mutation operator and self-adaptive inertia weight were adopted to enhance its ability of global search. I}hen, the model of MOPSO hybrid with local search was established. According to the model, the local search algorithm based on hill climbing strategy with sidesteps was periodically used to optimize the swarm, making particles search a- long descent direction when they were away from Pareto front, and search along non-dominated direction while they were near Pareto front Simulation results of benchmark functions show that H-MOPSO has better performance com- pared with MOPSO,NSGA-II and MOEA/D. The solving of supplier selection problem further validates its effective- ness.

Key words: Multi-objcctivc optimization, Particle swarm optimization, Local search, Hybrid algorithm

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!