Particle Swarm Optimization for Vehicle Routing Problem with Time Windows
带时间窗车辆路径问题的粒子群算法

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.