In this paper, well known Ford-Fulkerson algorithm in graph theory is used to calculate the maximum flow in water distribution pipeline network. The maximum flow problem is one of the most fundamental problems in network flow theory and has been investigated extensively. The Ford-Fulkerson algorithm is a simple algorithm to solve the maximum flow problem and based on the idea of searching augmenting path from a started source node to a target sink node. It is one of the most widely used algorithms in optimization of flow networks and various computer applications. The implementations for the detail steps of algorithm will be illustrated by considering the maximum flow of proposed water distribution pipeline network in Pyigyitagon Township, Mandalay, Myanmar as a case study. The goal of this paper is to find the maximum possible flow from the source node s to the target node t through a given proposed pipeline network.
Myint Than Kyi, Lin Lin Naing (2018); Application of Ford-Fulkerson Algorithm to Maximum Flow in Water Distribution Pipeline Network; International Journal of Scientific and Research Publications (IJSRP)
8(12) (ISSN: 2250-3153), DOI: http://dx.doi.org/10.29322/IJSRP.8.12.2018.p8441