A Particle Swarm Optimization for the Heterogeneous Fleet Vehicle Routing Problem

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

Preview	Text Paper 08 IJLSCM PSO for CVRP.pdf Download (8MB) | Preview
Preview	Text Paper 08 Peer Review.pdf Download (580kB) | Preview
Preview	Text turnitin 09 IJLSCM PSO for HVRP.pdf Download (6MB) | Preview

Abstract

This paper presents an application of particle swarrn optimization (PSO) for solving the heterogeneous fleet vehicle routing problem (HVRP). HVRP is a vehicle routing problem (VRP) variant that takes different types ofvehicle into consideration. Based on the number of vehicles 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 vehicles. This paper focus only on the latter since normally the number available vehicle is known in advance in the actual operations. A PSO algorithm, solution representations and decoding methods that have been successfully applied to the basic variant of VRP are re-utilized as the basic solution technique. In order to acquire the nature of heterogeneous type of vehicles into the technique, a special preprocessing method is incorporated to the vehicle list, so that a vehicle with lower relative routing cost is given higher priority 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 results for solving HVRP

Actions (login required)

View Item