A particle swarm optimisation for vehicle routing problem with time windows (Q1040636)

Summary: A heuristic based on Particle Swarm Optimisation (PSO) algorithm for solving VRPTW, which is an extension of PSO application for the Capacitated Vehicle Routing Problem (CVRP), is presented in this paper. A computational experiment is carried out by running the proposed algorithm with the VRPTW benchmark data set of \textit{M. M. Solomon} [Oper. Res. 35, 254--262 (1987; Zbl 0625.90047)]. The results show that the proposed algorithm is able to provide VRPTW solutions that are very close to its optimal solutions for problems with 25 and 50 customers within reasonably short of computational time.