A Particle Swarm Optimisation for Vehicle Routing Problem with Time Windows

A Particle Swarm Optimisation for Vehicle Routing Problem with Time Windows

0.00 Avg rating0 Votes
Article ID: iaor200969157
Country: United Kingdom
Volume: 6
Issue: 4
Start Page Number: 519
End Page Number: 537
Publication Date: Jul 2009
Journal: International Journal of Operational Research
Authors: ,
Keywords: heuristics
Abstract:

A heuristic based on Particle Swarm Optimisation (PSO) algorithm for solving VRPTW, which is an extension of a PSO application for the Capacitated Vehicle Routing Problem (CVRP) (Ai and Kachitvichyanukul, 2007), is presented in this paper. A computational experiment is carried out by running the proposed algorithm with the VRPTW benchmark data set of Solomon (1987). 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.

Reviews

Required fields are marked *. Your email address will not be published.