Particle Swarm Optimization for Capacitated Vehicle Routing Problem

Abstract

This thesis explores the application of Particle Swarm Optimization (PSO) to solve the Capacitated Vehicle Routing Problem (CVRP). The proposed PSO-based approach demonstrates superior performance in terms of solution quality and computational efficiency compared to existing methods. The findings highlight the potential of PSO as an effective tool for addressing complex combinatorial optimization problems like the CVRP, with implications for real-world transportation and logistics applications