Penerapan Algoritma Reverse-Delete dalam Menentukan Minimum Spanning Tree Pada Jaringan Pipa PERUMDA Air Minum Tirta Mayang di Perumahan Sunderland. (Indonesian)

Item request has been placed! ×
Item request cannot be made. ×
loading   Processing Request
  • Additional Information
    • Alternate Title:
      Application of Reverse-Delete Algorithm in Determining Minimum Spanning Tree on Pipeline Network of PERUMDA Air Minum Tirta Mayang in Sunderland Housing Estate. (English)
    • Abstract:
      Pipeline network construction is the most expensive part of the water distribution system. Therefore, the distribution of clean water is an issue that needs attention. The right plan is needed in order to optimise the use of pipes and the funds spent on pipe installation in the water distribution of PERUMDA Air Minum Tirta Mayang Jambi City. Optimising the length of the water pipe network of PERUMDA Air Minum Tirta Mayang Jambi City can be done by finding the Minimum Spanning Tree (MST). In this study, the Minimum Spanning Tree (MST) search was carried out on the tertiary pipe network of PERUMDA Air Minum Tirta Mayang Jambi City in Sunderland Housing using the Reverse-Delete Algorithm. The PERUMDA Air Minum Tirta Mayang tertiary pipe network graph in Sunderland Housing has quite a lot of edges and points so that the search for Minimum Spanning Tree (MST) is quite effective by applying the Reverse-Delete Algorithm. Reverse-Delete Algorithm is very appropriate to be used on graphs with a large number of edges and nodes because the Minimum Spanning Tree (MST) search with Reverse-Delete Algorithm is done based on the order of edge weights, not based on nodes. Based on the results of the Minimum Spanning Tree (MST) search by applying the Reverse-Delete Algorithm, the total length of the tertiary pipe network of Perumda Air Minum Tirta Mayang Jambi City in Sunderland Housing is 3,968 metres with 70 nodes and 69 edges from the initial graph with a network length of 4. [ABSTRACT FROM AUTHOR]
    • Abstract:
      Konstruksi jaringan perpipaan adalah bagian termahal bagi sistem distribusi air. Oleh karena itu, pendistribusian air bersih merupakan persoalan yang perlu diperhatikan. Rencana yang tepat diperlukan agar dapat mengefisiensikan pemakaian pipa dan dana yang dikeluarkan untuk pemasangan pipa pada pendistribusian air PERUMDA Air Minum Tirta Mayang. Upaya untuk mengoptimalkan panjang jaringan pipa air PERUMDA Air Minum Tirta Mayang dapat dilakukan dengan mencari Minimum Spanning Tree (MST). Pada penelitian ini dilakukan pencarian Minimum Spanning Tree (MST) dari jaringan pipa tersier PERUMDA Air Minum Tirta Mayang di Perumahan Sunderland menggunakan Algoritma Reverse-Delete. Graf dari jaringan pipa tersier PERUMDA Air Minum Tirta Mayang di Perumahan Sunderland mempunyai cukup banyak sisi dan titik sehingga pencarian Minimum Spanning Tree (MST) cukup efektif dilakukan dengan menggunakan Algoritma Reverse-Delete. Algoritma ReverseDelete sangat tepat untuk digunakan pada graf dengan jumlah sisi dan titik yang banyak karena pencarian Minimum Spanning Tree (MST) dengan Algoritma Reverse-Delete dilakukan berdasarkan pada urutan bobot sisi, bukan berdasarkan pada titik. Berdasarkan hasil pencarian Minimum Spanning Tree (MST) dengan menerapkan Algoritma Reverse-Delete, maka diperoleh panjang total jaringan pipa tersier PERUMDA Air Minum Tirta Mayang di Perumahan Sunderland adalah 3.968 meter dengan 70 titik dan 69 sisi dari graf awal dengan panjang jaringan 4.493 meter dengan 70 titik dan 74 sisi. Dengan demikian, terdapat 5 sisi yang dihapus sehingga menyebabkan adanya penghematan pipa pendistribusian air sepanjang 525 meter pipa tersier. [ABSTRACT FROM AUTHOR]
    • Abstract:
      Copyright of Technologica is the property of Green Engineering Society and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)