| dc.description.abstract | The Capacitated Vehicle Routing Problem (CVRP) is a combinatorial optimization problem. Because the time and complexity in finding solution grow exponentially with the size in each problem, CVRP is also identified as a NP-hard problem. Meta-heuristic algorithms are considered as an effective method to solve CVRP. There are several meta-heuristic algorithms introduced with different philosophies of intensification. This report focuses on 2 heuristic algorithms: Particle Swarm Optimization, and Grey Wolf Optimization. This study also uses K-means algorithm in clustering, which is a good way to reduce the complexity of CVRP. The comparison of computation time, accuracy and convergence is also included in this report.
Keywords: Capacitated Vehicle Routing Problem, Particle Swarm Optimization, Grey Wolf Optimization, K-means | en_US |
