A Particle Swarm Optimization for the Heterogeneous Fleet Vehicle Routing Problem

The Jin Ai, . and Kachitvichyanukul, Voratas (2009) A Particle Swarm Optimization for the Heterogeneous Fleet Vehicle Routing Problem. International Journal of Logistics and SCM Systems, 3 (1). pp. 32-38. ISSN 1881-5456

[img] Text (Jurnal Teknik Industri)
B14 IJLSCM Full.pdf

Download (3MB)
Paper 09 Peer Review.pdf

Download (573kB) | Preview
turnitin 09 IJLSCM PSO for HVRP.pdf

Download (6MB) | Preview


This paper present an application of particle swarm optimization (PSO) for solving the heterogenous fleet vehicle routing problem (HVRP). HVRP is a vehicle routing problem (VRP) vriant that takes different types of vehicle in each type, there are two types of HVRP in the literature: the vehicle fleet mix problem (VFM) that deals with unlimited number of vehicles and the fixed fleet version of HVRP that deals with fixed number of vehicle. This paper focus only on the latter since normally the number avaible vehicle is know in advance in theactual operations. A PSO algorithm, solution representations and decoding methods that have beensuccessfully applied to the basic variant of VRP are re-utilized as the basicsolution technique. In order to arquire the nature of heterogenous type of vehicles in to the technique, aspecial preprocessing method is incorporated to the vehicle list, so that a vehicle with lower relative routing cost is given higher priotity over the bigger one. The proposed algorithm is tested using benchmark data set and the computational result shows that the proposed method is competitive with other published result for solving HVRP>

Item Type: Article
Uncontrolled Keywords: ehicle Routing Problem, Heterogenous Fleet, Particle Swarm Optimization, Meta-heuristics
Subjects: Teknik Industri > Sistem Kerja
Divisions: Fakultas Teknologi Industri > Teknik Industri
Depositing User: Editor UAJY
Date Deposited: 16 Nov 2016 10:07
Last Modified: 27 Aug 2019 01:58
URI: http://e-journal.uajy.ac.id/id/eprint/10778

Actions (login required)

View Item View Item