Multi-Depot Capacitated Vehicle Routing Problem by Using Stable Marriage and K-Means Clustering to Minimize Number of Unserved Customers and Total Travel Distance

This work aims to minimize the total travel distance and the number of unserved customers in single routing cycle. The solution is developed by combining the stable marriage algorithm and k-means clustering in the clustering process. The nearest neighbour algorithm is used in the routing process.