Vehicle Scheduling Optimization with Capacity Constraints Based on Improved Particle Swarm Algorithm
摘要
This paper explores the Capacitated Vehicle Routing Problem (CVRP) and introduces an Improved Particle Swarm Optimization (IPSO) algorithm, a metaheuristic method based on Particle Swarm Optimization (PSO). The proposed IPSO algorithm is evaluated through comparative experiments against the original PSO, the Max-Min Ant System (MMAS), and Variable Neighborhood Search (VNS), Multi-strategy Partheno-genetic Algorithm Based on Dynamic Reduction Mechanism (DRM-MSPGA), New spotted hyena intelligent algorithm (ISHO). The results highlight the IPSO algorithm’s superior performance in solving various CVRP instances. Specifically, the experimental findings show that IPSO achieves results that are either better than or comparable to known optimal solutions across multiple datasets. This demonstrates the effectiveness, robustness, and competitive edge of the IPSO algorithm in addressing the complex CVRP and optimizing vehicle routing solutions in capacitated scenarios.