Using Ford-Fulkerson Algorithm and max flow-min cut theorem to minimize traffic congestion in Kota Kinabalu, Sabah

Traffic congestion is a major urban transportation problem which occurs when the traffic volume exceeds the capacity of existing road facilities. The occurring of traffic congestion is due to the freedom of owning private vehicle, poor traffic facility and unrestricted urban population growth. In this study, identification of maximum flow and bottleneck path in Kota Kinabalu, Sabah, Malaysia was carried out. The scope of this study is a network within the Central Business District of Kota Kinabalu. All the possible routes from source to sink will be established. In term of data collection, manual traffic count was used with the help of video recording. Ford & Fulkerson Algorithm will be applied to find out the maximum flow. Next, the max-flow and min-cut theorem will be used to determine the bottlenecks of a network. It allows the traffic engineer to decide which roadways facilities should be improved in order to minimize the traffic congestion problem