Pengoptimalan Jaringan Pipa Primer PDAM Tirtanadi Cabang Tuasan Dengan Menggunakan Algoritma Kruskal

Abstract

Kruskal's algorithm in searching for minimum spanning trees can be applied to pipelines installed at the location of PDAM Tirtanadi Tuasan where problem identification starts with the water discharge reaching the consumer is small but the discharge flowing from the reservoir is sufficient, so this research is used as a solution to this problem and also as an optimization of the clean water distribution network in the Tirtanadi Regional Drinking Water Company (PDAM) of the Tuasan Branch with the intention of cutting the direction of the pipe flow to overcome this problem. The data obtained from PDAM Tirtanadi Tuasan Branch is in the form of a floor plan and formed into a weighted graph. After the data is obtained, then it is calculated manually that the length of the installed water pipe is 32,645 m with 86 vertices and 100 edges, then the pipe length is represented as a set of paths and the pipe connection ends are represented as nodes. The pipe length obtained using Kruskal's algorithm and inspection of iterations using the QM for windows software is 22,095 m, with 86 vertices and 85 edges. So, using the Kruskal Algorithm and the help of the QM for windows software, the difference in pipe length obtained is 10,610 m.