A particle swarm optimization for the capacitated vehicle routing problem

Ai, The Jin and Kachitvichyanukul, Voratas (2007) A particle swarm optimization for the capacitated vehicle routing problem. International Journal of Logistics and SCM Systems, 2 (1). pp. 50-55. ISSN 1881-5456

[img] Text
B13 Full.PDF

Download (8MB)
Paper 08 Peer Review.pdf

Download (580kB) | Preview
Turnitin 08 IJLSCM PSO for CVRP.pdf

Download (6MB) | Preview


This paper proposed a random-key based solution representaion and decoding metdod for solving the Capacitated Vehicle Routing Problem (CVRP) using Particle Swarm Optimization (PSO). The Solution CVRP with n customers and m vehicles. The decoding method start with transforming the particle to a priority list of customer to enterroute and priority matrix of vehicle to serve each customer. The vehicle routes are constructed based on the costumer representation is applied using GLNPSO, a PSO algorithm with multiple social learning structures. The proposed algorithm is tested using the benchmark data set provided by Christofides. The computational result shows that representation ang decoding method is promising to be applied for CVRP.

Item Type: Article
Uncontrolled Keywords: Capacitated Vehicle Routing Problem Particle Swarm Optimization, Random Key Representation, Decoding Method.
Subjects: Industrial Engineering > Logistics and Supply Chain Management
Divisions: Fakultas Teknologi Industri > Teknik Industri
Depositing User: Editor UAJY
Date Deposited: 16 Nov 2016 09:49
Last Modified: 15 Aug 2019 07:05
URI: http://e-journal.uajy.ac.id/id/eprint/10777

Actions (login required)

View Item View Item