摘要
将粒子群算法(PSO)应用于带时间窗车辆路径优化问题(VRPTW),构造车辆路径问题的粒子表达方法,建立了此问题的粒子群算法,并与遗传算法作了比较.实验结果表明,粒子群算法可以快速、有效求得带时间窗车辆路径问题的优化解,是求解带时间窗车辆路径问题的一个较好方案.
This paper introduces a proposal to extend the heuristic called 'Particle Swarm Optimization'(PSO) to deal with the Vehicle Routing Problem with Time Windows (VRPTW), and proposes a novel Particle presentation for the vehicle routing problem. The PSO is compared with GA in the same VRPTW in experiments. Experimental results indicate that the PSO can effectively and quickly get optimal resolution of VRPTW, so it is proved to be an effective method for VRPTW.
出处
《系统工程理论与实践》
EI
CSCD
北大核心
2004年第4期130-135,共6页
Systems Engineering-Theory & Practice
基金
航天技术创新基金项目.
关键词
车辆路径问题
粒子群算法
优化
vehicle routing problem
particle swarm optimization
optimization
