OPTIMIZATION OF THE INSTALLATION OF CLEAN WATER PIPELINES THROUGH MINIMUM SPANNING TREE WITH PRIM ALGORITHM
DOI:
https://doi.org/10.33379/gtech.v7i1.1819Keywords:
Clean Water Pipes, Minimum Spanning Tree, Prim AlgorithmAbstract
Water is a very important need for human survival, without water there will be no life on earth. Because of the importance of the need for clean water, it’s natural if the clean water sector gets priority main handling because it involves the lives of many people. There are many ways to get clean water, one of which is by installing the pipes of clean water will be done in Kwala Air Hitam Village. The issue of pipe installation this clean water can be overcome through the Minimum Spanning Tree approach pipe installation can be more optimal. Search for the Minimum Spanning Tree using the prim algorithm manually. The research aims to get a minimum cost of installation of clean water pipes through Minimum Spanning Tree uses Prim Algorithm. The Prim Algorithm is a algorithm in the graph theory to find a minimal range tree for a graph which is connected to each other. In the results of research the Minimum Spanning Tree using the Prim Algorithm manually is obtained in total the length of the pipe which will be installed is 9.806 metres with 52 points and 56 sides. And the first graph had 52 points and 59 sides with a length of the pipes are 9.969 metres. So, the minimum fee amount Rp. 1.732.850.000 (one billion seven hundred thirty two million eight hundred fifty thousand rupiahs).
References
Anonym, 2006. Laporan Pendahuluan Penyusunan Dokumen Perencanaan Jaringan Air Bersih di Kabupaten Brebes Tahun Anggaran 2006. Brebes : Badan Perencanaan Pembangunan Daerah.
Budayasa, I Ketut. 1997. Matematika Diskrit I. Surabaya: University Press IKIP Surabaya.
Efendi, R. 2003. Penerapan Algoritma Semut Untuk Pemecahan Masalah Spanning Tree Pada Kasus Pemasangan Kabel Telepon. Tugas Akhir. Jurursan Teknik Informatika, Fakultas Teknik. Universitas Islam Indonesia : Yogyakarta.
Greenberg, H.J., (1998), Greedy Algorithm for Minimum Spanning Tree, http://glossary.computing.society.informs.org/notes/spanningtree.pdf, University of Coloardo, Denver.
Harahap, J. (2021), Pengoptimalan Jaringan Distribusi Air PDAM Tirta Keumueneng Kota Langsa Dengan Algoritma Prim. Tugas Akhir. MIPA Matematika. Universitas : Langsa.
Mariano, A., Lee, D., Gerstlauer, A., dan Chiou, D. 2013. Hardware and Software Implementations ofPrim's Algorithm for Efficient MinimumSpanning Tree Computation. International Embedded Systems Symposium, Paderborn, Germany, 17-19 June, 201
Nugraha, Deny Wiria. 2011. Aplikasi Algoritma Prim Untuk Menentukan Minimum Spanning Tree Suatu Graf Berbobot Dengan Menggunakan Pemrograman Berorientasi Objek. Jurnal Ilmiah Foristek Vol.1, No.2, September 2011
Purwanto, E. B., (2008), Perancanangan Dan Analisis Algoritma, Edisi 1, Graha Ilmu, Yogyakarta.
Ramadhan, A. F. 2017. Aplikasi Algoritma Prim Dalam Penentuan Pohon Rentang Minimum Untuk Jaringan Pipa PDAM Kota Tangerang. Jurnal Ilmiah. Vol 2 (1): 30 – 38.
Rosen, Kenneth H. 1997. Exploring Discrete Mathematics With Maple. Singapore: MC Graw-Hill Book Co. Siang, Jong Jek. 2002. Matematika Diskrit dan Aplikasinya pada Ilmu Komputer. Yogyakarta : ANDI.
Sitinjak, Tumpul JR. 2006. Riset Operasi untuk Pengambilan Keputusan Manajerial dengan Aplikasi Excek. Yogyakarta : Graha Ilmu. Zakaria, T. M., Prijono, A., (2005), Konsep Dan Implementasi Struktur Data, Bandung : Informatika.
Downloads
Published
Issue
Section
License
Copyright (c) 2023 Rina Filia Sari, Rina Widyasari, Fithria Aidra Marpaung

This work is licensed under a Creative Commons Attribution 4.0 International License.









