计算机工程与应用 ›› 2008, Vol. 44 ›› Issue (32): 216-219.DOI: 10.3778/j.issn.1002-8331.2008.32.065

• 工程与应用 • 上一篇    下一篇

基于车辆路径问题的带近邻因子的粒子群算法

张念志,吴耀华   

  1. 山东大学 现代物流研究中心,济南 250061
  • 收稿日期:2008-05-29 修回日期:2008-08-19 出版日期:2008-11-11 发布日期:2008-11-11
  • 通讯作者: 张念志

Particle Swarm Optimization with near neighborhood factor based on Vehicle Routing Problem

ZHANG Nian-zhi,WU Yao-hua   

  1. The Logistics Research Center,Shandong University,Jinan 250061,China
  • Received:2008-05-29 Revised:2008-08-19 Online:2008-11-11 Published:2008-11-11
  • Contact: ZHANG Nian-zhi

摘要: 提出了一种改进的粒子群算法。该算法通过引入近邻因子,增强了当前粒子的学习功能,克服了基本粒子群算法易陷于局部最优的缺陷,提高了算法进化的收敛精度。将该算法用于解决车辆路径问题,实验结果表明具有较好的性能和很好的应用价值。

关键词: 近邻因子, 粒子群算法, 车辆路径问题

Abstract: A modified Particle Swarm Optimization(PSO) is given in this paper.By using a near neighborhood factor,the learning capability of particles is enhanced;it can effectively overcome the shortcoming of trapping into a local optimization as compared with original PSO and improve the accuracy in the evolution period.The proposed algorithm has been applied to the Vehicle Routing Problem(VRP).The experiment results verify that the new algorithm is effective and useful.

Key words: near neighbor factor, Particle Swarm Optimization(PSO), Vehicle Routing Problem(VRP)