Optimization of water flow on Regency Municipality Waterworks-network of Jonggat Central Lombok Regency using Ford Fulkerson Algorithm and Dinic Algorithm

Authors

  • Lilis Sriwahyuni Department of matematics FMIPA University of Mataram
  • Marwan Marwan Department of matematics FMIPA University of Mataram
  • Zata Yumni Awanis Department of matematics FMIPA University of Mataram

DOI:

https://doi.org/10.29303/emj.v6i1.157

Keywords:

Dinic algorithm, Ford Fulkerson algorithm, Maximum flow, Network flow

Abstract

Clean water is essential for humans which must be fulfilled for humans survival. The population in Jonggat, Central Lombok, increases from year to year which causes the using of clean water get an increase too. The necessity of rising clean water is not in line with the availability of water in nature, therefore the PDAM (Regency Municipality Waterworks) manages existing water resource. Then, it will be distributed to consumers. The purpose of this research is to determine the optimal solution in the distribution of clean water in Jonggat using Ford Fulkerson algorithm and Dinic algorithm. Both Ford Fulkerson algorithm and Dinic algorithm are methods used to calculate the maximum flow in a network. Based on the results of research using Python software on the Ford Fulkerson algorithm, the maximum current is 133 liters/second, while using the Dinic algorithm, the maximum current is 133.49 liters/second. Meanwhile, the average water flow is delivered by PDAM is 95 liters/second. It means, it can be added the amount of flow in the clean water distribution pipe by the PDAM. It’s for facilitating the flow of water that reaches consumers with the addition of a flow that cannot exceed 133.49 liters/second. Keywords:  Network flow, Maximum flow, Ford Fulkerson algorithm, Dinic algorithm

References

Khairani, N., & Sirait, J. (2015). Membandingkan Kemangkusan Algoritma Dinic Dan Algoritma Pelabelan Ford-Fulkerson Untuk Masalah Arus Maksimum. Generasi Kampus, 8(1):176-189.

Munir, R., & Mauladevi, U. (2012). Graf Matematika Diskrit Revisi Edisi Kelima, Bandung, Informatika.

Yudhianto, A., (2003), Algoritma Dinic untuk Masalah Arus Maksimum (Doctoral dissertation, IPB (Bogor Agricultural University)).

Thulasiraman, K. dan Swamy M. N. S., (1992), Graphs: Theory and Algorithms, John Wiley & Sons. Concordia University Montreal, Canada.

Downloads

Published

2023-06-27

How to Cite

Sriwahyuni, L., Marwan, M., & Awanis, Z. Y. (2023). Optimization of water flow on Regency Municipality Waterworks-network of Jonggat Central Lombok Regency using Ford Fulkerson Algorithm and Dinic Algorithm. EIGEN MATHEMATICS JOURNAL, 6(1), 49–54. https://doi.org/10.29303/emj.v6i1.157

Issue

Section

Articles

Similar Articles

You may also start an advanced similarity search for this article.