<?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>K medoid-least cost combined model in combined and scheduled shipping service</dcterms:title><dcterms:identifier>https://doi.org/10.34820/FK2/KWI9RW</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-14T10:50:24Z</dcterms:modified><dcterms:description>In this work, we develop dispatch model that supports combined shipping model. In combined shipping model, customer can create one order that contains more than one destination.</dcterms:description><dcterms:subject>Computer and Information Science</dcterms:subject><dcterms:isReferencedBy>Purba Daru Kusuma, K medoid-least cost combined model in combined and scheduled shipping service, Journal of Theoretical and Applied Information Technology, 98(2), 2020.</dcterms:isReferencedBy><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>