| 求解带时间窗车辆路径问题的改进粒子群算法 |
| |
| 引用本文： | 马炫,彭破,刘庆. 求解带时间窗车辆路径问题的改进粒子群算法[J]. 计算机工程与应用, 2009, 45(27): 200-202. DOI: 10.3778/j.issn.1002-8331.2009.27.061 |
| |
| 作者姓名： | 马炫 彭破 刘庆 |
| |
| 作者单位： | 西安理工大学,自动化与信息工程学院,西安,710048;西安理工大学,自动化与信息工程学院,西安,710048;西安理工大学,自动化与信息工程学院,西安,710048 |
| |
| 摘 要： | 通过分析已有粒子群算法对有时间窗约束的车辆路径问题求解质量不高的原因,提出了一种基于粒子交换原理的整数粒子更新方法。采用构造的双层粒子进化算法分别对8个和20个任务点的有时间窗约束的车辆路径问题求解,数值实验结果表明算法的求解精度和耗时均优于已有算法。
|
| 关 键 词： | 带时间窗车辆路径问题 粒子群算法 交换原理 |
| 收稿时间： | 2009-03-23 |
| 修稿时间： | 2009-6-1 |
Improved Particle Swarm Optimization for Vehicle Routing Problem with time windows |
| |
| MA Xuan,PENG Peng,LIU Qing. Improved Particle Swarm Optimization for Vehicle Routing Problem with time windows[J]. Computer Engineering and Applications, 2009, 45(27): 200-202. DOI: 10.3778/j.issn.1002-8331.2009.27.061 |
| |
| Authors: | MA Xuan PENG Peng LIU Qing |
| |
| Affiliation: | School of Automation and Information Engineering，Xi’an University of Technology，Xi’an 710048，China |
| |
| Abstract: | Through analysing the reason that the existing particle swarm optimization algorithms can not find good solutions of solving the vehicle routing problem with tim windows,this paper proposes a method of updating integer particle based on trans position.The algorithm that consists of double-layer Particle Swarm Optimization(PSO) is tested on the problem instances of 8 and 20 mission points,respectively.The numerical simmulation results show that the proposed algorithm is superior to the existing algorithms in... |
| |
| Keywords: | Vehicle Routing Problem（VRP） with time windows Particle Swarm Optimization（PSO） principle of transposition |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载免费的PDF全文 |
