Hybrid Heuristic Algorithm for solving Capacitated Vehicle Routing problem

The Capacitated Vehicle Routing Problem is the most common and basic variant of the vehicle routing problem, where it represents an important problem in the fields of transportation, distribution and logistics. It involves finding a set of optimal routes that achieve the minimum cost and serve scattered customer locations under several constraints such as the distance between customers’ locations, available vehicles, vehicle capacity and customer demands. The Cluster first ? Route second is the proposed approach used to solve capacitated vehicle routing problem which applied in a real case study used in that research, it consists of two main phases. In the first phase, the objective is to group the closest geographical customer locations together into clusters based on their locations, vehicle capacity and demands by using Sweep algorithm. In the second phase, the objective is to generate the minimum cost route for each cluster by using the Nearest Neighbor algorithm. The hybrid approach is evaluated by Augerat’s Euclidean benchmark datasets.