Centroid Optimization of K-Means Using Ant Colony Optimization for Culinary MSME Clustering
DOI:
https://doi.org/10.63158/journalisi.v8i1.1443Keywords:
Data Mining, Ant Colony Optimization, K-Means, MSMEAbstract
Micro, Small, and Medium Enterprises (MSMEs) are economic activities conducted by individuals or groups, particularly in the culinary sector. The rapid expansion of culinary MSMEs, especially in tourism-oriented regions such as the Special Region of Yogyakarta, necessitates effective data clustering to systematically analyze their characteristics. High-quality clustering plays a crucial role in supporting informed decision-making, including business development planning, MSME assistance programs, and the formulation of well-targeted policies. This study applies the K-Means algorithm to cluster culinary MSME data; however, its performance is sensitive to centroid initialization, which may result in suboptimal clustering outcomes. To address this limitation, Ant Colony Optimization (ACO) is employed as a centroid optimization approach. ACO is a metaheuristic algorithm inspired by the foraging behavior of ant colonies, where pheromone trails guide the search toward optimal solutions. The results indicate that the integration of ACO enhances clustering performance compared to K-Means. The silhouette scores obtained are 0.88 and 0.89 for two clusters, 0.80 and 0.86 for three clusters, and 0.80 and 0.92 for four clusters for K-Means and ACO-optimized K-Means, respectively. These findings demonstrate that ACO effectively improves centroid initialization, with four clusters identified as the optimal configuration.
Downloads
References
[1] U. Linarti, A. H. Soleliza Jones, L. Zahrotun, and A. Rahmawati, “Penerapan Metode K-Medoids Guna Pengelompokan Data Usaha Mikro, Kecil dan Menengah (UMKM) Bidang Kuliner Di Kota Yogyakarta,” J. Ilmu Komput. dan Sist. Inf., vol. 7, no. 1, pp. 37–45, 2024, doi: 10.55338/jikomsi.v7i1.2194.
[2] C. Andriani, “Pemberdayaan Umkm Dengan Pendaftaran Nomor Induk Berusaha Melalui Oss Di Kelurahan Krembangan Selatan Surabaya,” PATIKALA J. Pengabdi. Kpd. Masy., vol. 2, no. 1, pp. 406–413, 2022, doi: 10.51574/patikala.v2i1.487.
[3] Badan Pusat Statistik Provinsi Daerah Istimewa Yogyakarta, “Perkembangan Pariwisata Daerah Istimewa Yogyakarta Desember 2024,” Berita Resmi Statistik, no. 11, pp. 1–12, Feb. 2025.
[4] N. A. Sudibyo, M. Najb, M. S. Andrianto, E. Alimovich, M. Marhadi, and A. Boros, “The Rise of ASEAN SMEs: How to Successfully Enter the Global Market,” Preprints, Jul. 2023.
[5] C. Zai, “Implementasi Data Mining sebagai Pengolahan Data,” J. Portal Data, vol. 2, no. 3, pp. 1–12, 2022.
[6] E. Muningsih, I. Maryani, and V. R. Handayani, “Penerapan Metode K-Means dan Optimasi Jumlah Cluster dengan Davies–Bouldin Index untuk Clustering Provinsi Berdasarkan Potensi Desa,” J. Sains dan Manajemen, vol. 9, no. 1, pp. 96–104, 2021.
[7] S. Andriani, “Distribution Analysis Active Small and Medium Industries Bogor City Using K-means Clustering,” Komputasi J. Ilm. Ilmu Komput. dan Mat., vol. 20, no. 1, pp. 56–70, 2022, doi: 10.33751/komputasi.v20i1.6559.
[8] M. Hernita, E. Pramesty, Y. U. Aprilia, R. Bryan, J. Purba, and M. Athoillah, “Klasterisasi Kabupaten dan Kota Menggunakan Algoritma K-Means dengan Metode Elbow dan Silhouette Score,” in Seminar Nasional Hasil Riset dan Pengabdian, Indonesia, 2023, pp. 359–368.
[9] I. Yaputera, R. Hanafi, and M. Rusman, “Optimasi Rute Kunjungan Cluster Sales Officer (CSO) Menggunakan Ant Colony Optimization (ACO)(Studi Kasus: Indosat Ooredoo Hutchison Micro Cluster Mamuju),” J. Penelit. Enj., vol. 26, no. 2, pp. 82–90, 2022, doi: 10.25042/jpe.112022.04.
[10] E. Febianti, Y. Muharni, D. Falti, L. Herlina, and K. Kulsum, “Usulan Penjadwalan Mesin Paralel Menggunakan Metode Ant Colony Optimization Algorithm dan Longest Processing Time,” J. Integr. Syst., vol. 6, no. 1, pp. 42–52, 2023, doi: 10.28932/jis.v6i1.5610.
[11] R. Y. C. Sianturi, B. Rahayudi, and A. W. Widodo, “Implementasi Algoritma Ant Colony Optimization untuk Optimasi Rute Distribusi Produk Kebutuhan Pokok dari Toko Sasana Bonafide Mojoroto,” J. Pengemb. Teknol. Inf. dan Ilmu Komput., vol. 5, no. 7, pp. 3190–3197, 2021.
[12] D. J. Ratnaningsih, “Clustering with K-Means Hybridization Ant Colony Optimization (K-ACO),” Int. J. Math. Model. Comput., vol. 12, no. 2, pp. 143–152, 2022.
[13] I. Sari, Y. Maulita, L. Arliana, and N. Kadim, “Pengelompokan UMKM Kota Binjai Menggunakan Metode Clustering K-Means untuk Identifikasi Pola Perkembangan Bisnis,” Jurnal Sistem Informasi, vol. 3, no. 1, pp. 45–52, 2024.
[14] M. Tonggiroh, S. Nurhayati, Yakub, and Jusmawati, “Sistem Pendukung Keputusan Pemilihan Wireless Router Menggunakan Pendekatan Rank Reciprocal dan ARAS,” J. Fasilkom, vol. 14, no. 1, pp. 206–215, 2024, doi: 10.37859/jf.v14i1.6838.
[15] S. Widaningsih, “Penerapan Data Mining untuk Memprediksi Siswa Berprestasi dengan Menggunakan Algoritma K Nearest Neighbor,” JATISI (Jurnal Tek. Inform. dan Sist. Informasi), vol. 9, no. 3, pp. 2598–2611, 2022, doi: 10.35957/jatisi.v9i3.859.
[16] D. Andriansyah, “Implementasi Extract-Transform-Load (ETL) Data Warehouse Laporan Harian Pool,” J. Teknik Informatika, vol. 8, no. 2, pp. 45–49, Jun. 2022, doi: 10.51998/jti.v8i2.486.
[17] S. A. Salasa and W. Maharani, “Personality Detection of Twitter Social Media Users using the Support Vector Machine Method,” J. Sist. Komput. dan Inform., vol. 4, no. 2, p. 263, 2022, doi: 10.30865/json.v4i2.5345.
[18] D. Prasetyawan and R. Gatra, “Analisis Cluster untuk Pengelompokan Kemampuan Penguasaan ICT Menggunakan K-Means dan Autoencoder,” JISKA, vol. 10, no. 2, pp. 145–157, 2025, doi: 10.14421/jiska.2025.10.2.145-157.
[19] F. Putra, H. F. Tahiyat, R. M. Ihsan, R. Rahmaddeni, and L. Efrizoni, “Penerapan Algoritma K-Nearest Neighbor Menggunakan Wrapper Sebagai Preprocessing untuk Penentuan Keterangan Berat Badan Manusia,” MALCOM Indones. J. Mach. Learn. Comput. Sci., vol. 4, no. 1, pp. 273–281, 2024, doi: 10.57152/malcom.v4i1.1085.
[20] J. C. Quiroz et al., “Extract, Transform, Load Framework for the Conversion of Health Databases to OMOP,” PLoS One, vol. 17, no. 4, pp. 1–13, Apr. 2022, doi: 10.1371/journal.pone.0266911.
[21] I. H. Witten, E. Frank, M. A. Hall, and C. J. Pal, “Deep Learning,” in Data Mining: Practical Machine Learning Tools and Techniques, 4th ed. Burlington, MA: Morgan Kaufmann, 2017, ch. 10, pp. 389–420.
[22] P. A. Leonardo, M. Arifin, and S. Y. Siswanto, “Penerapan Euclidean Distance untuk analisis driver variable Perubahan Penggunaan Lahan dari Jarak Jalan di Sub-DAS Cikapundung,” Soilrens, vol. 22, no. 1, pp. 61–66, 2024, doi: 10.24198/soilrens.v22i1.57248.
[23] Y. Hasan, “Pengukuran Silhouette Score dan Davies–Bouldin Index pada Hasil Cluster K-Means dan DBSCAN,” J. Inform. dan Teknik Elektro Terapan, vol. 12, no. 3S1, pp. 60–74, 2024, doi: 10.23960/jitet.v12i3s1.5001.
[24] N. Alfa Husna et al., “Implementasi Algoritma Ant Colony Optimization untuk Penentuan Jalur Terpendek Klinik,” in Seminar Nasional SENTIMAS, Indonesia, 2023, pp. 112–119.
[25] N. Rohman and A. Wibowo, “Perbandingan Metode K-Medoids dan Metode K-Means Dalam Analisis Segmentasi Pelanggan Mall,” SINTECH (Science Inf. Technol. J.), vol. 7, no. 1, pp. 49–58, 2024, doi: 10.31598/sintechjournal.v7i1.1507.
[26] W. Lidysari, H. S. Tambunan, and H. Qurniawan, “Penerapan Data Mining Dalam Menentukan Kelayakan Penerima Bantuan Sosial Pemko Dengan Algoritma C4.5 (Kasus Kantor Kelurahan Martoba),” Kesatria J. Penerapan Sist. Inf. (Komputer dan Manajemen), vol. 3, no. 1, pp. 53–61, 2022, doi: 10.30645/kesatria.v3i1.97.
[27] D. N. Yoliadi, “Data Mining dalam Analisis Tingkat Penjualan Barang Elektronik Menggunakan Algoritma K-Means,” Insearch Journal, vol. 3, no. 1, Feb. 2023.
[28] S. Harris and R. C. De Amorim, “An Extensive Empirical Comparison of k-means Initialization Algorithms,” IEEE Access, vol. 10, no. 2, pp. 58752–58768, 2022, doi: 10.1109/ACCESS.2022.3179803.
[29] S. Wang, “Ant Colony Optimization for Clustering College Students’ Physical Exercise Behavior Patterns,” Inform., vol. 48, no. 20, pp. 179–190, 2024, doi: 10.31449/inf.v48i20.6566.
Downloads
Published
Issue
Section
License
Copyright (c) 2026 Journal of Information Systems and Informatics
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors Declaration
- The Authors certify that they have read, understood, and agreed to the Journal of Information Systems and Informatics (JournalISI) submission guidelines, policies, and submission declaration. The submission has been prepared using the provided template.
- The Authors certify that all authors have approved the publication of this manuscript and that there is no conflict of interest.
- The Authors confirm that the manuscript is their original work, has not received prior publication, is not under consideration for publication elsewhere, and has not been previously published.
- The Authors confirm that all authors listed on the title page have contributed significantly to the work, have read the manuscript, attest to the validity and legitimacy of the data and its interpretation, and agree to its submission.
- The Authors confirm that the manuscript is not copied from or plagiarized from any other published work.
- The Authors declare that the manuscript will not be submitted for publication in any other journal or magazine until a decision is made by the journal editors.
- If the manuscript is finally accepted for publication, the Authors confirm that they will either proceed with publication immediately or withdraw the manuscript in accordance with the journal’s withdrawal policies.
- The Authors agree that, upon publication of the manuscript in this journal, they transfer copyright or assign exclusive rights to the publisher, including commercial rights
