Modified Particle Swarm Optimization algorithm for vehicle routing problem with time windows
Zhang Nian-zhi · Computer Engineering and Applications Journal · 2010
This paper gives a local near neighborhood Particle Swarm Optimization (PSO) algorithm that can optimize the unfeasible particle’s position.By dividing the particle swarm into several overlapping subgroups and looking for near neighbors in various subgroups,the proposed algorithm can effectively improve the learning of particles and increase the speed of particles to find neighbors.It can also increase the speed to search the optimized result via optimizing the unfeasible particles.The experiment results prove the high efficiency of the algorithm to solve the vehicle routing problem with time windows.