{"dcterms:modified":"2022-07-15","dcterms:creator":"A Dataverse Instance","@type":"ore:ResourceMap","@id":"https://dataverse.telkomuniversity.ac.id/api/datasets/export?exporter=OAI_ORE&persistentId=doi:10.34820/FK2/DOCE82","ore:describes":{"Deposit Date":"2022-07-14","citation:Depositor":"DARU KUSUMA, PURBA","Subject":"Computer and Information Science","Title":"Multi-Depot Capacitated Vehicle Routing Problem by Using Stable Marriage and K-Means Clustering to Minimize Number of Unserved Customers and Total Travel Distance","Related Publication":{"Citation":"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."},"Author":[{"author:Name":"Purba Daru Kusuma","author:Affiliation":"Telkom University"},{"author:Name":"Meta Kallista","author:Affiliation":"Telkom University"}],"citation:Description":{"dsDescription:Text":"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.","dsDescription:Date":"2021-11-01"},"citation:Contact":{"datasetContact:Name":"DARU KUSUMA, PURBA","datasetContact:Affiliation":"fakultas teknik elektro - rekayasa komputer","datasetContact:E-mail":"purbodaru@telkomuniversity.ac.id"},"@id":"doi:10.34820/FK2/DOCE82","@type":["ore:Aggregation","schema:Dataset"],"schema:version":"1.0","schema:datePublished":"2022-07-14","schema:name":"Multi-Depot Capacitated Vehicle Routing Problem by Using Stable Marriage and K-Means Clustering to Minimize Number of Unserved Customers and Total Travel Distance","schema:dateModified":"Thu Jul 14 19:42:39 WIB 2022","schema:license":"https://creativecommons.org/publicdomain/zero/1.0/","dvcore:fileTermsOfAccess":{"dvcore:fileRequestAccess":false},"schema:includedInDataCatalog":"Purba Daru Kusuma Journal Publication","ore:aggregates":[{"schema:name":"ijies_published_multidepotvrp.pdf","dvcore:restricted":false,"schema:version":1,"dvcore:datasetVersionId":520,"@id":"doi:10.34820/FK2/DOCE82/QADSUN","schema:sameAs":"https://dataverse.telkomuniversity.ac.id/api/access/datafile/:persistentId?persistentId=doi:10.34820/FK2/DOCE82/QADSUN","@type":"ore:AggregatedResource","schema:fileFormat":"application/pdf","dvcore:filesize":432354,"dvcore:storageIdentifier":"file://181fcbaac4e-443012ebba9d","dvcore:rootDataFileId":-1,"dvcore:checksum":{"@type":"MD5","@value":"9eabb5ac0fd87de23355e2ae6de81fe8"}}],"schema:hasPart":["doi:10.34820/FK2/DOCE82/QADSUN"]},"@context":{"Author":"http://purl.org/dc/terms/creator","Citation":"http://purl.org/dc/terms/bibliographicCitation","Deposit Date":"http://purl.org/dc/terms/dateSubmitted","Related Publication":"http://purl.org/dc/terms/isReferencedBy","Subject":"http://purl.org/dc/terms/subject","Title":"http://purl.org/dc/terms/title","author":"https://dataverse.org/schema/citation/author#","citation":"https://dataverse.org/schema/citation/","datasetContact":"https://dataverse.org/schema/citation/datasetContact#","dcterms":"http://purl.org/dc/terms/","dsDescription":"https://dataverse.org/schema/citation/dsDescription#","dvcore":"https://dataverse.org/schema/core#","ore":"http://www.openarchives.org/ore/terms/","schema":"http://schema.org/"}}