Comparative Analysis of K-Means, PSO-KMeans and Butterfly Optimization Algorithm for Road Damage Clustering
DOI:
https://doi.org/10.47709/brilliance.v6i2.8389Keywords:
BOA, Clustering analysis, K-Means, PSO-KMeans, Silhouette ScoreAbstract
Road damage on access routes to coastal tourism areas in Tanah Laut Regency, South Borneo has become a critical issue affecting travel safety and tourist visits. Various types of pavement distress such as cracking, depression, bump and sags, patching and potholes, polished aggregat, rutting, and swelling create complex data patterns that require robust analytical methods. This study adopts a data-driven approach to compare the performance of three clustering algorithms K-Means, Hybrid PSO–KMeans, and the Butterfly Optimization Algorithm (BOA) to determine the optimal grouping structure of road damage data. The dataset consists of seven types of road distress obtained from field surveys across three coastal locations. Data preprocessing was carried out through normalization and standardization to ensure consistency in scale, followed by clustering analysis with varying numbers of clusters (k = 2 to 7). The Silhouette Coefficient was used to evaluate clustering performance and determine the optimal number of clusters. The results show that the optimal clustering structure is achieved at k = 3, representing three levels of road damage severity: minor, moderate, and severe. Among the evaluated methods BOA produced the highest Silhouette Score of 0.7559, outperforming Hybrid PSO–KMeans (0.6583) and K-Means (0.442) indicating more compact and well-separated clusters. These findings suggest that BOA is more effective in handling complex and heterogeneous road damage data. Practically, this approach can support data-driven decision-making in prioritizing road maintenance.References
Agusniar, C., Ulfa, S. M., & Rhomadhona, H. (2025). Utilizing K-Means clustering for grouping student achievement data to evaluate learning activeness. Journal of Advanced Computer Knowledge and Algorithms, 2(3), 56–59.
Alguliyev, R. M., Aliguliyev, R. M., & Abdullayeva, F. J. (2019). PSO+K-means Algorithm for Anomaly Detection in Big Data. Statistics, Optimization & Information Computing, 7(2), 348–359. https://doi.org/10.19139/soic.v7i2.623
Alotaibi, A. S. (2018). Density-based clustering for road accident data analysis. International Journal of ADVANCED AND APPLIED SCIENCES, 5(8), 113–121. https://doi.org/10.21833/ijaas.2018.08.014
Arora, S., & Singh, S. (2019). Butterfly optimization algorithm: a novel approach for global optimization. Soft Computing, 23(3), 715–734. https://doi.org/10.1007/s00500-018-3102-4
Kaveh, M., & Mesgari, M. S. (2023). Application of Meta-Heuristic Algorithms for Training Neural Networks and Deep Learning Architectures: A Comprehensive Review. Neural Processing Letters, 55(4), 4519–4622. https://doi.org/10.1007/s11063-022-11055-6
Mutambik, I. (2024). Assessing Urban Vulnerability to Emergencies: A Spatiotemporal Approach Using K-Means Clustering. Land, 13(11), 1744. https://doi.org/10.3390/land13111744
Oktopianto, Y., Antonius, A., & Rochim, A. (2026). Classification of Urban Road Damage Levels Using Surface Distress Index Parameters and K-means Algorithm. Jurnal Ilmiah Dinamika Rekayasa, 22(1), 126–135.
Rahman, F. I., Lukman, L., & Hildayati, H. (2025). Sistem Klasifikasi Kerusakan Jalan Metode Machine Learning dengan Algoritma K-Means dan Random Forest. 3(1), 116–6. http://jurnal.ardenjaya.com/index.php/ajsthttp://jurnal.ardenjaya.com/index.php/ajst
Rhomadhona, H., Kusrini, W., Aprianti, W., & Permadi, J. (2025). Implementation of K-Means clustering for social assistance recipients with Silhouette Score evaluation. Brilliance: Research of Artificial Intelligence, 5(1), 136–143.
Saraswat, P., & Raj, S. (2022). DATA PRE-PROCESSING TECHNIQUES IN DATA MINING: A REVIEW. International Journal of Innovative Research in Computer Science & Technology, 10(1), 122–125. https://doi.org/10.55524/ijircst.2022.10.1.22
Schwenkreis, F. (2022). Using the Silhouette Coefficient for Representative Search of Team Tactics in Noisy Data. Proceedings of the 11th International Conference on Data Science, Technology and Applications, 193–202. https://doi.org/10.5220/0011100600003269
Sinaga, K. P., & Yang, M.-S. (2020). Unsupervised K-Means Clustering Algorithm. IEEE Access, 8, 80716–80727. https://doi.org/10.1109/ACCESS.2020.2988796
Takahashi, J., Shioiri, D., Shida, Y., Kobana, Y., Suzuki, R., Kobayashi, Y., Isoyama, N., Lopez, G., & Tobe, Y. (2016). Clustering for Road Damage Locations Obtained by Smartphone Accelerometers. Proceedings of the Second International Conference on IoT in Urban Space, 89–91. https://doi.org/10.1145/2962735.2962741
Teopilus, C. D., & Amrozi, M. R. F. (2023). The Evaluation of Pavement Condition Assessment Methods for Road Assets in Coastal Areas. INERSIA Lnformasi Dan Ekspose Hasil Riset Teknik Sipil Dan Arsitektur, 19(2), 183–193. https://doi.org/10.21831/inersia.v19i2.61089
Wahyono, H., Setiaji, H., Hartati, T., & Wiliani, N. (2024). K-Means Clustering for Identifying Traffic Accident Hotspots in Depok City. Journal of Applied Research In Computer Science and Information Systems, 2(1), 159–170. https://doi.org/10.61098/jarcis.v2i1.182
Yassin, S. S., & Pooja. (2020). Road accident prediction and model interpretation using a hybrid K-means and random forest algorithm approach. SN Applied Sciences, 2(9), 1576. https://doi.org/10.1007/s42452-020-3125-1
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2026 Herfia Rhomadhona, Widiya Astuti Alam Sur, Norminawati Dewi, Winda Aprianti, Jaka Permadi
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
info@itscience.org, web: 
