Particle Swarm Optimization in Solving Capacitated Vehicle Routing Problem

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