Aplikasi Pemilihan Rute Pengiriman Barang pada Perusahaan Elektronik di Surabaya dengan Menggunakan Metode K-Means Clustering Dan Google Maps API

Liliana Ester(1*), Rolly Intan(2), Andreas Handojo(3),


(1) Program Studi Teknik Informatika
(2) Program Studi Teknik Informatika
(3) Program Studi Teknik Informatika
(*) Corresponding Author

Abstract


Company X is an electronics retailer company operated in Surabaya city. The company is trying to improve their customer satisfaction by doing some evaluations and enhancement on their existing business processes. One of them is the process of goods delivery services. Some shortcomings occur in the process. For example, it is difficult to determine the order of the delivery routes, especially if there are some customers who have preference delivery hours. Another thing, the company cannot provide any information about the time estimation of the goods arrival that makes their customer feel bad about the delivery services. Because of these problems, the company needs a system that is capable of providing the route sequence recommendation and also giving information about estimation of goods arrival.

The system is implemented on website by using codeigniter framework and SQL Server as the database. In this system, the first process is matching the addresses with the response from Google Maps API. This Google Maps API responses are being used in the next process which is calculating route. In order to perform the calculations, Google Maps API has already provided a free of charge service that is capable of giving the best waypoint through the maximum of 8 points addresses. However, the amount of the addresses in one shipment is usually more than 8 addresses. Therefore a method of clustering using K-Means is needed in order to make a group of delivery area into 8 clusters. By then, the route calculation can be done by using the clusters.

The end result of this program is a shipping information system for administrators and drivers of the company. This system is able to provide recommendations for the selection of goods delivery routes and information on the estimated time of goods delivery. Based on some testings, the system can perform route calculations with an average time calculation of 133 seconds for 30 destination routes.


Keywords


K-Means, Google Maps API, Delivery Service

Full Text:

PDF

References


Aggarwal, C. C., & Reddy, C. K. 2014. Data clustering: algorithms and applications. Boca Raton: CRC Press/Taylor & Francis Group.

Agusta, Y. 2007. K-means - Penerapan, Permasalahan dan Metode Terkait. Jurnal Sistem dan Informatika Vol. 3 (Februari 2007): 47-60

Chia, W. C., Yeong, L. S., Lee, F. J., & Chng, S. I. 2016. Trip planning route optimization with operating hour and duration of stay constraints. 2016 11th International Conference on Computer Science & Education (ICCSE). doi:10.1109/iccse.2016.7581

Gambardella, L. M., Taillard, E., & Agazzi, G., 1999. A Multiple Ant Colony System For Vehicle Routing Problems With Time Windows. New Ideas in Optimization”, 3

J. R., & R. C. 2012. Travelling Salesman Problem. Book On Demand.

Khachay, M., & Neznakhina, K. (2016). Polynomial Time Approximation Scheme for the Minimum-weight k-Size Cycle Cover Problem in Euclidean space of an arbitrary fixed dimension. IFAC-PapersOnLine, 49(12), 6-10. doi:10.1016/j.ifacol.2016.07.541

Orunga, E. 2012, Challenges facing the Courier industry and their solutions

R. Nallusamy, K. Duraiswamy, R. Dhanalaksmi, and P. Parthiban. 2010. Optimization of multiple vehicle routing problems using approximation algorithms.

Santosa, B. 2007. Data Mining: Teknik Pemanfaatan Data untuk Keperluan Bisnis. Yogyakarta: Graha Ilmu


Refbacks

  • There are currently no refbacks.


Jurnal telah terindeks oleh :