OPTIMIZATION OF CAPACITATED VEHICLE ROUTING PROBLEM USING PSO

Abstract: This paper presents solution techniques for Capacitated Vehicle Routing Problem (CVRP) using metaheuristics. Capacitated Vehicle Routing Problem is divided into set of customers called cluster, and find optimum travel distance of vehicle route. The CVRP is a combinatorial optimization problem; particle swarm optimization (PSO) technique is adapted in this paper to solve this problem. The main problem is divided into subprograms/clusters and each subprogram is treated as travelling salesman problem and solved by using particle swarm optimization techniques (PSO). This paper presents a sweep, Clark and wright algorithm to form the clusters. This model is then solved by using a particle swarm optimization (PSO) method to find optimum travel distance of vehicle route. Our analysis suggests that the proposed model enables users to establish route to serve all given customers with minimum distance of vehicles and maximum capacity