A Particle Swarm Optimisation for Vehicle Routing Problem with Time Windows

The Jin Ai and Voratas Kachitvichyanukul

International Journal of Operational Research, 2009, vol. 6, issue 4, 519-537

Abstract: 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) (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.

Keywords: PSO; particle swarm optimisation; VRPTW; vehicle routing problem; time windows; heuristics. (search for similar items in EconPapers)
Date: 2009
References: Add references at CitEc
Citations: View citations in EconPapers (14)

Downloads: (external link)
http://www.inderscience.com/link.php?id=27156 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:6:y:2009:i:4:p:519-537

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().