Bulletin of Electrical Engineering and Informatics
Vol 2, No 4: December 2013

Particle Swarm Optimization in Solving Capacitated Vehicle Routing Problem

M. M. Tavakoli (Shiraz University)
Ashkan Sami (Shiraz University)

Article Info

Publish Date
01 Dec 2013

Abstract

The Capacitated Vehicle Routing Problem (CVRP) is an NP-Hard problem, which means it is impossible to find a polynomial time solution for it. So researchers try to reach a near optimum solution by using meta-heuristic algorithms. The aim of CVRP is to find optimum route for every vehicle and a sequence of customers, that vehicle serve. This paper proposes a method on how PSO is adjusted for a discrete space problem like CVRP. The process of tweaking solutions is described in detail. At last for evaluation of proposed approach and show the effectiveness of it, the result of running proposed approach over benchmarking data set of capacitated vehicle routing problem is illustrated.

Copyrights © 2013




Citation Download
RIS
EndNote, Reference Manager, ProCite
BibTex
Latex, Jabref
Full PDF
157.565 KB
Original Source
Download Original
Google Scholar
Check in Google Scholar
Journal Info
Bulletin of Electrical Engineering and Informatics
Website

Abbrev

EEI

Publisher

Universitas Ahmad Dahlan

Subject

Electrical & Electronics Engineering

Description

Bulletin of Electrical Engineering and Informatics (Buletin Teknik Elektro dan Informatika) ISSN: 2089-3191, e-ISSN: 2302-9285 is open to submission from scholars and experts in the wide areas of electrical, electronics, instrumentation, control, telecommunication and computer engineering from the ...