Based on particles collision PSO for vehicle routing problem with time windows
The vehicle routing problem with time windows(VRPTW) is the NP hard combinatorial optimization discrete problem.There was certain inferiority performance on solving it with traditional PSO,so this paper proposed a particles collision discrete PSO to solve it.Inspired by the physical phenomena of the velocity and position changed after objects collision,it made the current particle collided with the personal best particle and global best particle to avoid the tradition rounding operating in updating,and kept particles swarm evolutional capability.It used the Solomon's VRP instance to test.The results of experiments show that the algorithm has good performance.