Penerapan Algoritma K-Means untuk Klasterisasi Wilayah Tujuan Pengiriman Kargo Udara pada PT Eka Cipta Mandiri
Original Full-Text Article
Download published version for reading and archivingAbstract
PT Eka Cipta Mandiri grouped air cargo destinations manually based on subjective estimates, which led to suboptimal cargo space allocation and route pricing. This study applied K-Means clustering, optimized with the Elbow Method and validated with the Silhouette Coefficient, to profile 46 destinations from 2020 to 2025 based on total cargo volume (Kg) and average annual flight frequency. Of 276 annual transaction records, 36 inactive records (zero volume and frequency) were removed, leaving 240 valid records that were aggregated into 46 destinations and scaled with Min-Max normalization. The Within-Cluster Sum of Squares (WCSS) evaluated from K=1 to K=10 showed an elbow at K=3, with a WCSS of 0.8412 and a Silhouette Coefficient of 0.612. Initial centroids were selected from real data points: DJJ (C2), SUB (C1), and AAP (C0). Euclidean distance computations converged at the fourth iteration and divided the destinations into three clusters: Cluster 2 (high/main routes) with 6 destinations (AMQ, BDJ, BTH, DJJ, KNO, UPG), Cluster 1 (medium/growth routes) with 17 destinations, and Cluster 0 (low/niche routes) with 23 destinations. The model was implemented in a web application built with Python, Flask, and SQLite. Testing showed results identical to manual Excel calculations, all Black Box scenarios matching specifications, and successful execution of four independent paths in White Box testing
Keywords:
Author Biographies
Program Studi Teknik Informatika, Fakultas Ilmu Komputer, Universitas Pamulang, Kota Tangerang Selatan, Provinsi Banten, Indonesia
Program Studi Teknik Informatika, Fakultas Ilmu Komputer, Universitas Pamulang, Kota Tangerang Selatan, Provinsi Banten, Indonesia
How to Cite
This work is licensed under a Copyright (c) 2027 Nouval Fadillah, Devi Damayanti .
This is an open-access article distributed under the terms of the Creative Commons Attribution 4.0 International License .
- Share: You are free to copy, distribute, and transmit the work in any medium or format.
- Adapt: You are free to remix, transform, and build upon the work for any purpose, even commercially.
- Attribution: You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
References
Total: 16 References- Ahmed, M., Seraj, R., & Islam, S. M. S. (2020). The k-means algorithm: A comprehensive survey and performance evaluation. Electronics, 9(8), Article 1295. https://doi.org/10.3390/electronics9081295
- Budiyanto, I., Hermawan, A., & Avianto, D. (2025). Segmentasi nasabah kartu kredit berdasarkan pola transaksi untuk penentuan profil nasabah. Jurnal Informatika dan Komputer (JIKO), 9(3), 560–569. https://doi.org/10.26798/jiko.v9i3.1669
- Febrian, F., Suarna, N., & Dwilestari, D. (2022). Penerapan algoritma K-Means untuk mengelompokkan data pengiriman paket di Kantor Pos Cirebon. Jurnal Sistem Informasi dan Komputer Terapan, 15(1), 23–27.
- Feng, B., Li, Y., & Shen, Z. J. M. (2020). Air cargo operations: Literature review and comparison with passenger transportation. Transportation Research Part E: Logistics and Transportation Review, 140, Article 102008. https://doi.org/10.1016/j.tre.2020.102008
- Hanum, N., Prianto, C., Rahayu, W. I., & Kishendrian, H. D. (2023). Penerapan metode clustering dalam segmentasi pelanggan perusahaan logistik. Sintech Journal, 6(3), 137–146. https://doi.org/10.31598/sintechjournal.v6i3.1465
Similar Articles
Articles sharing related keywords and machine learning classifications: