Particle Swarm Optimization In Solving Capacitated Vehicle Routing Problem

The Capacitated Vehicle Routing Problem (CVRP) is a NP – Complete problem and according to this definition there is no exact solution for it. So researchers try to achieve a near optimum solution for it, by using meta – heuristic algorithms. The aim of CVRP is to find optimum route for every vehicle as a sequence of customers, that vehicle served. We employ Particle Swarm Optimization to solve this problem. In following of this paper we completely explain how we adjust PSO for a discrete space problem like CVRP, and the process of tweaking solutions, and at last for evaluation of our approach and show the effectiveness of our work, we show the result of running proposed approach over benchmarking data set of capacitated vehicle routing problem.

Keywords:

Capacitated Vehicle Routing Problem (CVRP) , Particle Swarm Optimization (PSO) , Traveling Salesman Problem (TSP) , Meta – heuristic , Euclidean Distance