Modifikasi Algoritma Edmonds Karp untuk Menentukan Aliran Maksimum Pada Jaringan Distribusi Air PDAM (Studi Kasus Jaringan Telaga Sari PDAM Giri Menang Mataram)

Husnul Hotimah; Syamsul Bahri; Lailia Awalushaumi

doi:10.29303/emj.v6i2.134

Authors

Husnul Hotimah Universitas Mataram
Syamsul Bahri Universitas Mataram
Lailia Awalushaumi Universitas Mataram

DOI:

https://doi.org/10.29303/emj.v6i2.134

Keywords:

Edmonds Karp algorithm, flow network, Maximum flow, modified Edmonds Karp algorithm

Abstract

Clean water is the main and basic need for humans which is of concern to the government. Distribution network system is a very important part to delivering water to all consumers. The lack of water discharge distribution in several areas, especially at the end of the pipeline service, is cause by not optimal water distribution, the flow rate of sorce and leak in pipeline effect. This research has to analyze the optimal network model and determine the maximum flow rate from the PDAM pipeline using modified Edmonds Karp algorithm. Modified Edmonds Karp algorithm is a method for calculating maximum flow of a network. Based on analysis of modified Edmonds Karp algorithm there is a less efficient us of pipe in PDAM network and result of maximum flow from the network is 202,30 liter/second. This means it can be adding flow discharge to the water distribution pipe by PDAM for expedite the flow to consumer with the addition of flow should not exceed 202,30 liter/second.

References

Ahmed, F., dkk., 2014, An Efficient Algorithm for Finding Maximum Flow in a NetworkFlow, Journal of Physical Sciennce, Vol. 19, 41-50.

Aji, A.S., Bhaskoro, R.G.E. dan Firdaus, N.A., 2017, Perencanaan dan Evaluasi Sistem Jaringan Distribusi PDAM Surya Sembada Kota Surabaya, Jurnal Community Empowerment, Vol. 2,No. 2, pp. 53-57.

Ardana, P.D.H. dan Suastika, I. W., 2012, Analisa Teknis Jaringan pipa sistem Penyediaan Air Minum, Denpasar : Universitas Ngurah Rai.

Djohan, D., 2011, Himpunan Produk Hukum Standar Pelayanan Minimal (SPM), Jakarta: Kementrian Dalam Negeri.

Jain, Chintan dan Deepak Garg, 2012, Improved Edmonds Karp Algorithm for Network Flow Problem, International Journal of Computer Applications, Vol 48-53.

Johnsonbaugh, R. 1941. Discrete Mathematics eight edition. New York : Pearson Education.

Khan, Md. Al-Amin, dkk., 2013, An Innovative Approach for Solving MaximalFlow Problem, Journal of Physical Sciences, Vol. 17, pp 143-154.

Madanella, E. D. M., 2007, Analisis Penggunaaan Algoritma Pencarian Melebar (BFS) dan Algoritma Pencarian Mendalam (DFS) dalam Teori Graf, Bandung: ITB.

Mallick, K. K., dkk., 2016, Modified Edmonds-Karp Algorithm to Solvve Maximum Flow Problem, Open Journal of Appplied Science,Vol.6,pp 131-140.

Rivai, Y., Masduki, A. dan Marsono, B.D., 2006, Evaluasi Sistem Distribusi dan Rencana Peningkatan Pelayanan Air Bersih PDAM Kota Gorontalo, Jurnal SMARTek, Vol. 4, No. 2, pp 126-134.

Shankar, H., dkk., 2014, Development of GIS Tool for the Solution of Maximum Flow Problem Using Ford Fulkerson and Edmonds Karp Algorithms, Journal Computer Science and Aplications, Vol. 1, pp 217-231.

Wigati R., Maddeppungeng A., Krisnanto I., Studi Analisis Kebutuhan Air Bersih Pedesaan Sistem Gravitasi Menggunakan Software Epanet 2.0, Jurnal Konstruksia, Vol. 6(2).