Multi-Depot Capacitated Vehicle Routing Problem by Using Stable Marriage and K-Means Clustering to Minimize Number of Unserved Customers and Total Travel Distancehttps://doi.org/10.34820/FK2/DOCE82Purba Daru KusumaMeta KallistaTelkom University Dataverse2022-07-142022-07-14T12:42:39ZThis 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.Computer and Information ScienceP. D. Kusuma and M. Kallista, "Multi-Depot Capacitated Vehicle Routing Problem by Using Stable Marriage and K-Means Clustering to Minimize Number of Unserved Customers and Total Travel Distance", International Journal of Intelligent Engineering and Systems, 14(6), 605-615, 2021.DARU KUSUMA, PURBA2022-07-14CC0CC0 Waiver