Adjusted Clustering Clarke-Wright Saving Algorithm for Two Depots-N Vehicles

In this paper we modeled the distribution of a
single type of products, which are distributed from two
depots and use N-vehicles. This problem can be modeled
using Capacitated Vehicle Routing Problems (CVRP), and
the common algorithm to solve that model is Clarke and
Wright Saving Algorithm (CWSA). The needed computational time for finding the nearly global optimum of CWSA grows exponentially with the numbers of the existed routes. Therefore, in this paper, we proposed to combine the
clustering algorithm with CWSA. Additionally, we consider
the largest item in the cluster, which has to be transported, as the starting point to find the optimum solution.