求解带时间窗车辆路径问题的改进粒子群算法

Improved Particle Swarm Optimization for Vehicle Routing Problem with time windows

通过分析已有粒子群算法对有时间窗约束的车辆路径问题求解质量不高的原因,提出了一种基于粒子交换原理的整数粒子更新方法。采用构造的双层粒子进化算法分别对8个和20个任务点的有时间窗约束的车辆路径问题求解,数值实验结果表明算法的求解精度和耗时均优于已有算法。

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 algorithmsin searching high quality solutions and time-consuming.