<?xml version='1.0' encoding='UTF-8'?><metadata xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns="http://dublincore.org/documents/dcmi-terms/"><dcterms:title>Modified K-means clustering in multi store delivery service</dcterms:title><dcterms:identifier>https://doi.org/10.34820/FK2/ZLWUXK</dcterms:identifier><dcterms:creator>Purba Daru Kusuma</dcterms:creator><dcterms:publisher>Telkom University Dataverse</dcterms:publisher><dcterms:issued>2022-07-14</dcterms:issued><dcterms:modified>2022-07-14T09:58:45Z</dcterms:modified><dcterms:description>In this work, we propose the centralized shared delivery service model. As a centralized  model, the delivery service is handled by the central management so that coordination in delivery process  among vehicles can be more efficient.</dcterms:description><dcterms:subject>Computer and Information Science</dcterms:subject><dcterms:subject>clustering</dcterms:subject><dcterms:contributor>DARU KUSUMA, PURBA</dcterms:contributor><dcterms:dateSubmitted>2022-07-14</dcterms:dateSubmitted><dcterms:license>CC0</dcterms:license><dcterms:rights>CC0 Waiver</dcterms:rights></metadata>