Pengoptimalan Jaringan Pipa Primer PUDAM Tirtabina Menggunakan Algoritma Greedy
Abstract
Optimization can be defined as the process of finding the best value of a condition that will produce a maximum or minimum value. This research was conducted with the aim of applying the Greedy Algorithm to the optimization of the primary pipe network located in Bilah Hilir District, Labuhanbatu Regency. In the research conducted, the primary pipe will be formed into a weighted graph so that there are 58 edges and 57 points (vertex) with a total length of all pipes of 9,945 meters. In the results of the research conducted, there are two edges that can be removed so as to optimize 850 meters of primary pipes and can optimize costs of 31,450,000. It can be concluded that the pipe reduction is 850 meters from the length of the entire initial pipe, namely 9,945 meters. So, it will automatically reduce the cost of purchasing pipes where the pipe per meter is IDR. 37,000. So the total cost that can be optimized is Rp. 31,450,000
Keywords: Optimization, Primary Pipe, Graph, Greedy Algorithm
References
Darnita, Y., & Toyib, R. (2019). Penerapan Algoritma Greedy dalam Pencarian Jalur Terpendek pada Instansi-Instasi Penting di Kota Argamakmur Kabupaten Bengkulu Utara. Jurnal Media Infotama, 15(2). https://doi.org/10.37676/jmi.v15i2.867
Didiharyono, D., & Soraya, S. (2018). Penerapan Algoritma Greedy dalam Menentukan Minimum Spanning Trees pada Optimisasi Jaringan Listrik Jala. Jurnal VARIAN, 1(2), 1–10. https://doi.org/10.30812/varian.v1i2.66
Grace, D., Mu’amar, S. T., & Nurdin, N. (2021). Sistem Informasi Letak Geografis Penentuan Jalur Tercepat Rumah Sakit di Kota Palu Menggunakan Algoritma Greedy Berbasis Web. Jurnal Elektronik Sistem Informasi dan Komputer, 4(2), 59-76. https://www.jesik.web.id/index.php/jesik/article/view/87
Herli, A. M., Raharjana, I. K., & Soeparman, P. (2015). Sistem Pencarian Hotel Berdasarkan Rute Perjalanan Terpendek dengan Mempertimbangkan Daya Tarik Wisata Menggunakan Algoritma Greedy. Journal of Information Systems Engineering and Business Intelligence, 1(1), 9-16. https://doi.org/10.20473/jisebi.1.1.9-16
Kekal, H. P., Gata, W., Nurdiani, S., Jati, A., Rini, S., & Wita, D. S. (2021). Menggunakan Algoritma Greedy. 7(1). https://doi.org/10.35329/jiik.v7i1.179
Kusumawardani, Y., & Astuti, W. (2018). Evaluasi Pengelolaan Sistem Penyediaan Air Bersih di PDAM Kota Madiun. Jurnal Neo Teknika, 4(1), 1-10. http://download.garuda.kemdikbud.go.id/article.php?article=1109096
Ningrum, E. R., Sanwidi, A., Akbarita, R., & Qomaruddin, M. N. H. (2023). Optimasi Rute Pendistribusian Gas Elpiji Menggunakan Algoritma Floyd Warshall dan Algoritma Greedy. Jurnal Ilmiah Matematika Dan Terapan, 20(1), 1–14. https://doi.org/10.22487/2540766x.2023.v20.i1.15568
Nirmala Santi, M. (2019). Optimasi Biaya Jalur Tercepat Indarung-Unitas Menggunakan Algoritma Greedy. Menara Ilmu: Jurnal Penelitian dan Kajian Ilmiah, 13(11). https://doi.org/10.31869/mi.v13i11.1647
Paradis, I., Syamsudin, U., & Rantau, M. I. (2024). Optimalisasi Pelayanan Air Minum oleh PDAM Tirta Benteng Kota Tangerang. Jurnal Ilmiah Wahana Pendidikan, 10(8), 491-528. https://doi.org/10.5281/zenodo.11107719
Purnamasari, I., & Komarudin, O. (2019). Optimalisasi Manajemen Penerimaan & Penyimpanan Dokumen Fax Menggunakan Algoritma Greedy. Jurnal Teknologi Informasi dan Ilmu Komputer (JTIIK), 6(6), 625-636. https://www.academia.edu/download/78660587/pdf.pdf
Saifulloh, S., & Fitriyani, R. E. (2018). Analisa Pencarian Rute Tercepat Menuju Telaga Sarangan Menggunakan Algoritma Greedy. Jurnal Teknologi Dan Ilmu Komputer Prima (JUTIKOMP), 1(1), 1-5. https://doi.org/10.34012/jutikomp.v1i1.231
Situmorang, Y. M., & Mansyur, A. (2023). Pengoptimalan Jaringan Pipa Primer PDAM Tirtanadi Cabang Tuasan dengan Menggunakan Algoritma Kruskal. JURRIMIPA: Jurnal Riset Rumpun Matematika Dan Ilmu Pengetahuan Alam, 2(2), 225–237. https://doi.org/10.55606/jurrimipa.v2i2.1613
Zayid, M. (2021). Buku Ajar Struktur Data dan Implementasi Algoritma. - Indonesia.
Copyright (c) 2024 Atika Nabila, Rima Aprilia
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
