A New Direction to The Maximal Flow Problem: A Route Merging Approach

Authors

Elias Munapo, School of Economics and Decision Sciences, North West Uiversity, Mafikeng Campus Private Bag X2046, Mafikeng, 2735, South AfricaFollow
Santosh Kumar, School of Mathematical and Geospatial Sciences, RMIT University,124 La Trobe Street, Melbourne VIC 3000, Australia\\ Department of Mathematics and Statistics, University of Melbourne, Grattan Street, Parkville, Victoria, 3010, AustraliaFollow
Kolentino Mpeta, School of Economics and Decision Sciences, North West Uiversity, Mafikeng Campus Private Bag X2046, Mafikeng, 2735, South AfricaFollow

Author Country (or Countries)

South Africa

Abstract

The paper presents a new direction to the maximal flow problem. A maximal-flow problem involves finding the largest flow rate a network supply can have from the source to sink. The proposed algorithm solves the flow problem by merging flow routes iteratively until there is only one route left. It has the strength that the problem reduces in size at every iteration. The route merging algorithm belongs to a family of algorithms that solves by reducing the complexity of the flow problem. The flow problem has applications in the networking of pipes and road transportation networks.

Digital Object Identifier (DOI)

http://dx.doi.org/10.18576/amis/150411

Recommended Citation

Munapo, Elias; Kumar, Santosh; and Mpeta, Kolentino (2021) "A New Direction to The Maximal Flow Problem: A Route Merging Approach," Applied Mathematics & Information Sciences: Vol. 15: Iss. 4, Article 11.
DOI: http://dx.doi.org/10.18576/amis/150411
Available at: https://digitalcommons.aaru.edu.jo/amis/vol15/iss4/11