Optimization of Capacitated Vehicle Routing Problem Using PSO
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).