{"id":8975,"identifier":"FK2/DOCE82","persistentUrl":"https://doi.org/10.34820/FK2/DOCE82","protocol":"doi","authority":"10.34820","publisher":"Telkom University Dataverse","publicationDate":"2022-07-14","storageIdentifier":"file://10.34820/FK2/DOCE82","datasetVersion":{"id":520,"datasetId":8975,"datasetPersistentId":"doi:10.34820/FK2/DOCE82","storageIdentifier":"file://10.34820/FK2/DOCE82","versionNumber":1,"versionMinorNumber":0,"versionState":"RELEASED","lastUpdateTime":"2022-07-14T12:42:39Z","releaseTime":"2022-07-14T12:42:39Z","createTime":"2022-07-14T12:41:46Z","license":"CC0","termsOfUse":"CC0 Waiver","fileAccessRequest":false,"metadataBlocks":{"citation":{"displayName":"Citation Metadata","fields":[{"typeName":"title","multiple":false,"typeClass":"primitive","value":"Multi-Depot Capacitated Vehicle Routing Problem by Using Stable Marriage and K-Means Clustering to Minimize Number of Unserved Customers and Total Travel Distance"},{"typeName":"author","multiple":true,"typeClass":"compound","value":[{"authorName":{"typeName":"authorName","multiple":false,"typeClass":"primitive","value":"Purba Daru Kusuma"},"authorAffiliation":{"typeName":"authorAffiliation","multiple":false,"typeClass":"primitive","value":"Telkom University"}},{"authorName":{"typeName":"authorName","multiple":false,"typeClass":"primitive","value":"Meta Kallista"},"authorAffiliation":{"typeName":"authorAffiliation","multiple":false,"typeClass":"primitive","value":"Telkom University"}}]},{"typeName":"datasetContact","multiple":true,"typeClass":"compound","value":[{"datasetContactName":{"typeName":"datasetContactName","multiple":false,"typeClass":"primitive","value":"DARU KUSUMA, PURBA"},"datasetContactAffiliation":{"typeName":"datasetContactAffiliation","multiple":false,"typeClass":"primitive","value":"fakultas teknik elektro - rekayasa komputer"},"datasetContactEmail":{"typeName":"datasetContactEmail","multiple":false,"typeClass":"primitive","value":"purbodaru@telkomuniversity.ac.id"}}]},{"typeName":"dsDescription","multiple":true,"typeClass":"compound","value":[{"dsDescriptionValue":{"typeName":"dsDescriptionValue","multiple":false,"typeClass":"primitive","value":"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."},"dsDescriptionDate":{"typeName":"dsDescriptionDate","multiple":false,"typeClass":"primitive","value":"2021-11-01"}}]},{"typeName":"subject","multiple":true,"typeClass":"controlledVocabulary","value":["Computer and Information Science"]},{"typeName":"publication","multiple":true,"typeClass":"compound","value":[{"publicationCitation":{"typeName":"publicationCitation","multiple":false,"typeClass":"primitive","value":"P. 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."}}]},{"typeName":"depositor","multiple":false,"typeClass":"primitive","value":"DARU KUSUMA, PURBA"},{"typeName":"dateOfDeposit","multiple":false,"typeClass":"primitive","value":"2022-07-14"}]}},"files":[{"label":"ijies_published_multidepotvrp.pdf","restricted":false,"version":1,"datasetVersionId":520,"dataFile":{"id":8976,"persistentId":"doi:10.34820/FK2/DOCE82/QADSUN","pidURL":"https://doi.org/10.34820/FK2/DOCE82/QADSUN","filename":"ijies_published_multidepotvrp.pdf","contentType":"application/pdf","filesize":432354,"storageIdentifier":"file://181fcbaac4e-443012ebba9d","rootDataFileId":-1,"md5":"9eabb5ac0fd87de23355e2ae6de81fe8","checksum":{"type":"MD5","value":"9eabb5ac0fd87de23355e2ae6de81fe8"},"creationDate":"2022-07-14"}}],"citation":"Purba 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, V1"}}