首页 | 本学科首页   官方微博 | 高级检索  
     

基于车辆路径问题的带近邻因子的粒子群算法
引用本文:张念志,吴耀华. 基于车辆路径问题的带近邻因子的粒子群算法[J]. 计算机工程与应用, 2008, 44(32): 216-219. DOI: 10.3778/j.issn.1002-8331.2008.32.065
作者姓名:张念志  吴耀华
作者单位:山东大学,现代物流研究中心,济南,250061;山东大学,现代物流研究中心,济南,250061
摘    要:提出了一种改进的粒子群算法。该算法通过引入近邻因子,增强了当前粒子的学习功能,克服了基本粒子群算法易陷于局部最优的缺陷,提高了算法进化的收敛精度。将该算法用于解决车辆路径问题,实验结果表明具有较好的性能和很好的应用价值。

关 键 词:近邻因子  粒子群算法  车辆路径问题
收稿时间:2008-05-29
修稿时间:2008-8-19 

Particle Swarm Optimization with near neighborhood factor based on Vehicle Routing Problem
ZHANG Nian-zhi,WU Yao-hua. Particle Swarm Optimization with near neighborhood factor based on Vehicle Routing Problem[J]. Computer Engineering and Applications, 2008, 44(32): 216-219. DOI: 10.3778/j.issn.1002-8331.2008.32.065
Authors:ZHANG Nian-zhi  WU Yao-hua
Affiliation:The Logistics Research Center,Shandong University,Jinan 250061,China
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.
Keywords:near neighbor factor  Particle Swarm Optimization(PSO)  Vehicle Routing Problem(VRP)
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号