Implementasi Algoritma Welch-Powell pada Pembagian Lokasi Kantor Cabang dalam Pemeriksaan Pipa Perumda Tirta Batang Hari
DOI:
https://doi.org/10.63822/bnwja429Keywords:
Welch-Powell Algorithm, graph coloring, route allocation, PERUMDA Tirta Batang Hari.Abstract
PERUMDA Air Minum Tirta Batang Hari conducts routine inspections of pipeline connections and water pumps at branch offices to maintain the continuity of clean water distribution. The large number of inspection locations and the varying distances between branch offices result in inefficient technician route allocation. This study aims to model routine inspection locations into a graph and determine a more optimal route allocation using the Welch-Powell Algorithm. The data used are secondary data in the form of locations and distances among 13 branch offices of PERUMDA Tirta Batang Hari obtained through Google Maps. The research method was carried out by constructing a graph based on adjacency relationships between locations, determining the degree of each vertex, and applying the Welch-Powell Algorithm through a graph coloring process. The results showed that graph coloring produced a chromatic number of four colors, consisting of the blue group with vertices 8 and 9, the green group with vertices 12 and 13, the yellow group with vertices 10, 7, and 6, and the orange group with vertices 1, 2, 11, 3, 4, and 5. These results indicate that the Welch-Powell Algorithm can be applied to assist the grouping of routine inspection locations so that technician route allocation becomes more organized and efficient.
References
Afrianti, Helmi, & Fran, F. (2019). Pewarnaan simpul, sisi, wilayah pada graf dan penerapannya. Bimaster: Buletin Ilmiah Matematika, Statistika dan Terapannya, 8(4), 773–782.
Clark, J. (1991). A first look at graph theory. World Scientific Publishing Co. Pte. Ltd.
Daniel, F., & Taneo, P. N. (2019). Teori graf. Deepublish.
Dermawan, D. A., & Widiasih, D. (2022). Matematika diskrit. Lakeisha.
Gunawan, I., Tambunan, H. S., & Hartama, D. (2022). Monograf algoritma tabu search dalam kasus traveling salesman problem. Adanu Abimata.
Handayani, D., Rosely, E., & Mayadewi, R. P. (2016). Penerapan algoritma Welch Powell dengan pewarnaan graph pada mata pelajaran SMA. Dalam Seminar Nasional Sistem Informasi Indonesia.
Hapsan, A. (2022). Matematika diskrit. CV AA Rizky.
Hignasari, L. V. (2019). Optimasi sistem penjadwalan dengan implementasi algoritma Welch Powell pada sistem penjadwalan customer service di gerai Indosat Ooredoo Cabang Kuta. Vastuwidya, 2(1), 79–85.
Munir, R. (2016). Matematika diskrit (Edisi ke-6). Informatika.
Mursidi. (2016). Teori graf. UB Press.
Purwanto, D. (2006). Matematika diskrit. Ercontara Rajawali.
Rahayuningsih, S. (2018). Teori graph dan penerapannya. Universitas Wisnuwardhana Press.
Rosen, K. H. (2012). Discrete mathematics and its applications (7th ed.). McGraw-Hill.
Rozi, S., Rarasati, N., & Syelly, R. (2022). Efisiensi penyusunan jadwal perkuliahan menggunakan pendekatan pewarnaan graf. Euler: Jurnal Ilmiah Matematika, Sains dan Teknologi, 10(1), 26–36.
Sa’adah, T. N., Fathoni, M. I. A., & Sari, A. C. (2023). Pewarnaan graf pada penjadwalan UAS program studi matematika UNUGIRI menggunakan algoritma Welch–Powell. Jurnal Penelitian Matematika dan Pendidikan Matematika, 6(1), 14–24.
Saifudin, I., & Dafik. (2015). Bilangan khromatik pewarnaan sisi pada graf khusus dan operasinya. Teorema, 2, 203–210.
Siregar, M. K. (2018). Matematika diskrit. Perahu Litera.
Suweken, G. (2017). Matematika diskrit. PT Rajagrafindo Persada.
Wahyuningrum, T., & Usada, E. (2019). Matematika diskrit dan penerapannya dalam dunia informatika. Deepublish.
Welyyanti, D. (2018). Beberapa syarat cukup untuk bilangan kromatik lokasi hingga pada graf tak terhubung. Eksakta, 19(1). https://doi.org/10.24036/eksakta/vol19-iss01/130
Wulandari, G. S., & Sa’adah, S. (2021). Pengantar strategi algoritma. Penerbit KBM Indonesia.
Downloads
Published
Issue
Section
License
Copyright (c) 2026 Nurul Hasanah (Author)
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
