Penentuan Rute Terpendek Jalur Distribusi Air Artesis Menggunakan Kruskal

Diah Ayu Retnani Wulandari, Fajrin Nurman Arifin

Abstract


Water flow distribution to home residents from the artesian well is affected by infrastructure. The more houses that distributed makes decreased amount supply of artesian water in every house. the longer of pipe leight and many branches traversed makes decrease of water supply because there will be many possible pipeline leaks. The more pipes used make the more expensive infrastructure cost. This problem occurs in Jubung area. These problems is one variation of the minimum Spanning Tree problems. This problem can be solved by the shortest path optimization route. It uses network method by implementing graph theory through kruskal algorithm. The first step is determined the nodes and sides. Nodes represent house and the sides represents the connecting pipes between houses. Kruskal is chosen because the kruskal focuses on the side and the graph is incomplete. focus of this study is the length optimation of the connecting pipe that is represented by side. In the pipe infrastructure figure map is representing of an incomplete graph because there are several nodes that are not connected to all nodes because it is adapted to the contour of the land that is not possible traversed the pipe. The results is there are several paths that are changed, especially the side to connect between node 1-4, 4-12, 19-20, 21-6 dispensed because forming cycles. The result of this research is kruskal can make decreasing infrastrukture cost Rp.7.535.500 with length of 201,5 meter so can save Rp.4.401.000 from Rp Rp.11.936.500.

Full Text:

PDF

References


Hayu W., Yuliani, Dan Sam, M., “Pembentukan Pohon Merentang Minimum Dengan Algoritma Kruskal”, Jurnal Scientific Pinisi, Volume 3, Nomor 2, , Hlm. 108-115, Oktober 2017

Lufira, R. D., Suhardjono, S., Dan Marsudi, S., “Optimasi Dan Simulasi Sistem Penyediaan Jaringan Air Bersih Di Kecamatan Kademangan Kabupaten Blitar”, Vol 3, No 1, Jurnal Pengairan, Http://Jurnalpengairan.Ub.Ac.Id, Universitas Brawijaya, Malang, 2012

Nelfiyanti, Dan Dermawan D., “Penentuan Rute Distribusi Bbm Yang Optimal Menggunakan Metode Minimal Spanning Tree (Mst) Dan Algoritma Heuristik Di Pt.Telkomsel Area Kabupaten Pelalawan, Jurnal Teknik Industri – Universitas Hung Hatta, Vol. 1, No. 1, Halaman 58-69, Issn : 2302-0318 , Juni 2012

Sam M., Dan Yuliani, “Penerapan Algoritma Prim Untuk Membangun Pohon Merentang Minimum (Minimum Spanning Tree) Dalam Pengoptimalan Jaringan Transmisi Nasional Provinsi Sulawesi Selatan. Jurnal Dinamika”, Vol. 07, No. 1, Halaman 50-61, Issn 2087 – 7889, April, 2016

Wattimena A.Z, Dan Lawalata S., “ Aplikasi Algoritma Kruskal Dalam Pengotimalan Panjang Pipa Kruskal Algorithm Application On Optimlaizing Pipes Network”, Jurnal Barekeng, Vol. 7, No. 2, Hal. 13 – 18, 2013

Zakiah N, Desniarti, Samosir B.S. 2015. Minimum Spanning Tree Determination Program Using Kruskal Algorithm On Visual Basic 6.0. International Journal Of Science And Research (Ijsr),. Volume 4, Issue 12, ISSN (Online): 2319-7064, December, 2015.




DOI: http://dx.doi.org/10.30645/j-sakti.v2i2.72

Refbacks

  • There are currently no refbacks.


J-SAKTI (Jurnal Sains Komputer & Informatika)
Published Papers Indexed/Abstracted By:

Jumlah Kunjungan :

View My Stats