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

车辆路径问题的粒子群算法研究
引用本文:李宁,邹彤,孙德宝.车辆路径问题的粒子群算法研究[J].系统工程学报,2004,19(6):596-600.
作者姓名:李宁  邹彤  孙德宝
作者单位:1. 华中科技大学控制科学与工程系,湖北,武汉,430074;武汉理工大学计算机科学与技术学院,湖北,武汉,430070
2. 华中科技大学控制科学与工程系,湖北,武汉,430074
摘    要:车辆路径优化问题是一类具有重要实用价值的组合NP问题.粒子群算法(panicle swarm optimization)是一种新出现的群智能(swarm intellingece)优化方法,将其应用于车辆路径优化问题,构造车辆路径问题的粒子表达方法,建立了此问题的粒子群算法,并与遗传算法作了对比试验.结果表明,粒子群算法可以快速、有效求得车辆路径问题的优化解,是求解车辆路径问题的一个较好方案。

关 键 词:粒子群算法  车辆路径问题  遗传算法
文章编号:1000-5781(2004)06-0596-05

Particle swarm optimization for vehicle routing problem
LI Ning.Particle swarm optimization for vehicle routing problem[J].Journal of Systems Engineering,2004,19(6):596-600.
Authors:LI Ning
Abstract:The vehicle routing problem (VRP) is a kind of combination NP problem which possesses important practical value. Particle swarm optimization (PSO) is a newly appeared method for swarm intelligence optimization. PSO is used in this paper to solve the VRP. This paper proposes a novel particle presentation for the vehicle routing problem, establishes an algorithm of PSO for this kind of problem, and compares PSO with GA in the same VRP experiments. Experimental results indicate that the established algorithm of PSO can quickly and effectively get optimal solution to the vehicle routing problem, which demonstrates that the algorithm is an effective method for solving the vehicle routing problem.
Keywords:particle swarm optimization  vehicle routing problem  genetic algorithm  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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