Two-Stage Iterated Local Search for Solving Capacitated Vehicle Routing Problems

In this paper, we propose a two-stage iterated local search strategy to solve capacitated vehicle routing problems (CVRP), which discuss how to generate a best vehicle routing strategy to transport merchandise to multiple sites subject to different constraints such as vehicle capacity. CVRP problems have been proved to be a NP-complete problem, and different heuristic algorithms have been proposed to solve the problems. Among many others, iterated local search is one of common problem solving techniques for complicate problems. Our experiment results showed the proposed two-stage iterated local search scheme can solve the problem effectively for most of test cases.