The capacitated vehicle routing problem (CVRP) is an NP-hard problem. Therefore, metaheuristics are often more suitable for practical applications. In this paper, a genetic algorithm (GA) is proposed to solve the problem. The performance of the proposed algorithm is tested on different sets of benchmark instances. The computational results indicate that the algorithm has a satisfactory performance in solving the problem.
An Effective Genetic Algorithm for Capacitated Vehicle Routing Problem
12 Views
5 Downloads