A Particle Swarm Optimisation for Vehicle Routing Problem with Time Windows

Ai, The Jin and Kachitvichyanukul, Voratas (2009) A Particle Swarm Optimisation for Vehicle Routing Problem with Time Windows. International Journal of Operational Research (IJOR), 6 (4). pp. 519-537. ISSN 1745-7645

Paper 03 IJOR A PSO for VRP with Time Windows.pdf

Download (653kB) | Preview
Paper 03 Peer Riview.pdf

Download (609kB) | Preview
Turnitin 03.pdf

Download (7MB) | Preview
Official URL: http://www.inderscience.com/inorders.php


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

Item Type: Article
Uncontrolled Keywords: PSO; particle swarm optimisation; VRPTW; vehicle routing problem with time windows; heuristics.
Subjects: Teknik Industri > Industri
Divisions: Fakultas Teknologi Industri > Teknik Industri
Depositing User: wiwid bartolomeus wijayanto
Date Deposited: 01 Jul 2019 06:19
Last Modified: 15 Aug 2019 06:18
URI: http://e-journal.uajy.ac.id/id/eprint/19162

Actions (login required)

View Item View Item