@article{MAKHILLJEAS2019142318680,
    title = {Modified k-Medoids based Driver Dispatch Model in City Courier Service},
    journal = {Journal of Engineering and Applied Sciences},
    volume = {14},
    number = {23},
    pages = {8891-8898},
    year = {2019},
    issn = {1816-949x},
    doi = {jeasci.2019.8891.8898},
    url = {https://makhillpublications.co/view-article.php?issn=1816-949x&doi=jeasci.2019.8891.8898},
    author = {Purba and},
    keywords = {k-medoids,city courier service,dispatch system,least cost,telecommunication,PHP language},
    abstract = {Now a days, city courier service grows fast, especially, in Indonesia. Unfortunately, current city
courier service is still inefficient, especially, that is held by online motorcycle taxi companies. Single transaction
still means only for single destination. So, delivering many packets to many destinations from single customer
is still difficult. Based on this problem in this research, we develop dispatch model that accomodates multi
destinations delivery order. By using this model, one transaction may contain more than one destination. In
the other side, a driver can deliver many packets simultaneuosly. In this research, we use k-medoids clustering
model as a basis model. We improve this k-medoids model to create harmonization among drivers. This model
is then implemented into web based simulation application and it is developed by using PHP language. Based
on the simulation result, it is proven that this model can give advantages in user’s cost reduction and average
driver’s revenue improvement. The user’s cost is reduced to approximately 30%. In the other side, the average
driver’s revenue increases to approximately 250%.}
    }