A hybrid two-stage sweep algorithm for capacitated vehicle routing problem

Capacitated Vehicle Routing Problem (CVRP) is a variant of Vehicle Routing Problem (VRP), where CVRP is only considered the capacity restrictions, and the object is to minimize the cost of the vehicles serve all customers. In this study, we proposed an approach which is hybrid two-phase sweep algorithm (SA) and greedy search for solving CVRP. At the first stage of SA, all customers are clustered by SA and define each cluster as a block. The second stage is to reconstruct each neighbour clusters based on the first stage. Then the greedy search is applied to minimize the cost of each vehicle. Finally, the computational result on standard instances show the proposed approach is effective.