Abstract
A maximum flow algorithm based on network reconstruction method is proposed in this paper. The principal idea of the method is to identify an outmost route in the network and remove it in such a way that the reduced network has the same maximum value as the original network. The complexity of the algorithm decreases as number of iterations increases. Numerical illustrations and computational comparisons are used to prove the validity and efficiency of the algorithm respectively. Computational comparisons have revealed that the proposed method requires less number of iterations as compared to other algorithms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Mallick, K.K., Khan, A.R., Ahmed, M.M., Arefin, M., Uddin, M.: Modified EDMONDSKARP algorithm to solve maximum flow problems. Open J. Appl. Sci. 6, 131–140 (2016)
Munapo, E., Kumar, S., Mpeta, K.: A new direction to the maximal flow problem: a route merging approach. Appl. Math. Inf. Sci.: Int. J. 15(4), 487–495 (2021)
Chen, L., Kyng, R., Liu, Y.P., Peng, R., Gutenberg, M.P., Sachdeva, S.: Maximum flow and minimum-cost flow in almost-linear time, arXiv preprint https://arxiv.org/abs/2203.00671 (2022)
Tawanda, T.: A node merging approach to the transshipment problem. Int. J. Syst. Assur. Eng. Manag. 8(1), 370–378 (2015). https://doi.org/10.1007/s13198-015-0396-9
Dong, L., Wang, H., Zhang, X.: Faster approximation algorithm for generalized maximum concurrent flow problem in networks with no flow generating cycles. Int. J. Sci. Oper. Inform. 5(1), 20–35 (2010)
Parpalea, M., Ciurea, E.: Partitioning algorithm for the parametric maximum flow. Appl. Math. 4(10A), 3–10 (2013). https://doi.org/10.4236/am.2013.410A1002
Wang, Z., Wei, D.: Solving the maximum flow problem by a modified adaptive amoeba algorithm. IAENG Int. J. Comput. Sci. 45(1), 1–5 (2018)
Hu, Y., Zhao, X., Liu, J., Liang, B., Ma, C.: An efficient algorithm for minimum cost flow problem with complementary slack conditions. Math. Probl. Eng. 2020, 1–5 (2020)
Parpalea, M.: A parametric approach to the bi-criteria minimum cost dynamic flow problem. Open J. Discrete Math. 1(3), 116–126 (2011). https://doi.org/10.4236/ojdm.2011.13015
Sinha, P., Sharma, R.: Dual based procedures for un-capacitated minimum cost flow problem. Am. J. Oper. Res. 6, 468–479 (2016). https://doi.org/10.4236/ajor.2016.66043
Jahan, S., Islam, M., Amin, M.: Performance analysis of multi-hop wireless link under maximum flow algorithm. J. Comput. Commun. 7, 8–16 (2019). https://doi.org/10.4236/jcc.2019.78002
Islam, M.M., Wang, Y., Hu, P.A.: Maximum flow based approach to prioritize drugs for repurposing of chronic diseases. Life 11, 1–13 (2021)
Asad, M.W.A., Dimitrakopoulos, R.: Implementing a parametric maximum algorithm for optimal open pit mine design under uncertain supply and demand. J. Oper. Res. Soc. 64(2), 185–197 (2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Munapo, E., Tawanda, T., Nyamugure, P., Kumar, S. (2023). Maximum Flow by Network Reconstruction Method. In: Vasant, P., Weber, GW., Marmolejo-Saucedo, J.A., Munapo, E., Thomas, J.J. (eds) Intelligent Computing & Optimization. ICO 2022. Lecture Notes in Networks and Systems, vol 569. Springer, Cham. https://doi.org/10.1007/978-3-031-19958-5_87
Download citation
DOI: https://doi.org/10.1007/978-3-031-19958-5_87
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-19957-8
Online ISBN: 978-3-031-19958-5
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)