A Study of Sweep Algorithm Based Candidate List Performance in Capacitated Vehicle Routing Problem Using Nested Particle Swarm Optimization
The vehicle routing problem needs to determine optimum set of vehicle routes under various constraints and classified as NP- Complete problem. The problem had been solved using exact solution, heuristics and metaheuristics and needs further attention to improve of the solution quality and computational performance. In this context this study focuses on solving Capacitated Vehicle Routing Problem (CVRP) using Nested Particle Swarm Optimization (NPSO) technique which is initiated with sweep based improved candidate list i.e. initial swarm. The sweep based candidate list enhances the search capability of the algorithm. The nested form of algorithm is implemented with Master Particle Swarm Optimization (MPSO) to select candidate list and Slave Particle Swarm Optimization (SPSO) to develop vehicle route.