Multi-Depot Capacitated Vehicle Routing Problem by Using Stable Marriage and K-Means Clustering to Minimize Number of Unserved Customers and Total Travel Distancedoi:10.34820/FK2/DOCE82Telkom University Dataverse2022-07-141Purba Daru Kusuma; Meta Kallista, 2022, "Multi-Depot Capacitated Vehicle Routing Problem by Using Stable Marriage and K-Means Clustering to Minimize Number of Unserved Customers and Total Travel Distance", https://doi.org/10.34820/FK2/DOCE82, Telkom University Dataverse, V1Multi-Depot Capacitated Vehicle Routing Problem by Using Stable Marriage and K-Means Clustering to Minimize Number of Unserved Customers and Total Travel Distancedoi:10.34820/FK2/DOCE82Purba Daru KusumaMeta KallistaTelkom University DataverseDARU KUSUMA, PURBADARU KUSUMA, PURBA2022-07-14Computer and Information ScienceThis 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.CC0 WaiverP. 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.ijies_published_multidepotvrp.pdfapplication/pdf