Skip to main content
SpringerLink
Log in

An intelligent node labelling maximum flow algorithm

  • ORIGINAL ARTICLE
  • Published:
International Journal of System Assurance Engineering and Management Aims and scope Submit manuscript

Abstract

A network based intelligent node labelling (INL) algorithm for solving the maximal flow problem in directed networks is presented. The INL algorithm is intelligent in that it does not make use of augmenting path methodology to compute the maximal flow value. The principle of the INL algorithm is to design an optimal network by balancing the total inflow value with the total outflow value at all intermediate nodes, thus eliminating the excess or stagnant flow and reduction of underutilized outflow arcs. The INL algorithm makes use of at most two iterations to transform the initial maximal flow network with N-nodes into an optimal network with O(VE) worst- case time complexity. Two numerical illustrations were used to demonstrate how the INL algorithm determines the maximal flow value. Computational experiments were considered on three well studied, small instances in the literature. The proposed INL algorithm was compared to other seven existing algorithms in terms of optimal solution and number of iterations.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11

Similar content being viewed by others

References

  • Ahmad M (2018) Techniques for solving maximal flow problem. Int J Stat Appl Math 3(1):132–135

    Google Scholar 

  • Ahmed N, Das S, Purusotham S (2013) The problem of maximum flow with minimum attainable cost in a network. Opsearch 50:197–214. https://doi.org/10.1007/s12597-012-0106-1

    Article  MathSciNet  MATH  Google Scholar 

  • Ahmed F, Khan MdA, Khan AR, Ahmed SS, Uddin MdS (2014) An efficient algorithm for finding maximum flow in a network-flow. J Phys Sci 19:41–50

    Google Scholar 

  • Akter D, Uddin MS, Shami FA (2021) Modification of EDMONDS –KARP algorithm for solving maximum flow problem. Int J Innov Appl Stud 31(4):703–711

    Google Scholar 

  • Aman M, Ramezanzadeh M (2019) A novel algorithm for solving fuzzy maximal flow problems. Natl Sem Control Optim, November 13–14, Sabzevar, IRAN

  • Baycik ON (2021) Machine learning based approaches to solve the maximum network interdiction problem. Comput Ind Eng. https://doi.org/10.1016/j.cie.2021.107873

    Article  Google Scholar 

  • Bhandari PP, Khadka SR (2021) Maximum flow evacuation planning problem with non-conservation flow constraint. Int Ann Sci 10(1):25–32

    Article  Google Scholar 

  • Brenda D, Chu X, Sun S, Quek TQS, Buckley A (2018) Modeling and optimization of renewable energy sharing among base stations as a minimum-cost maximum flow problem. In: IEEE 87th vehicular technology conference, pp 1–5

  • Caliskan C (2011) A specialized network simplex algorithm for constrained maximum flow problem. Eur J Oper Res 210(2):137–147

    Article  MathSciNet  MATH  Google Scholar 

  • Chaerani D, Agustini RA, Rusyaman E (2021) Adjustable robust maximum flow problem with parametric ellipsoidal and polyhedral uncertainty set. IAENG Int J Appl Math 51(1):82–91

    Google Scholar 

  • Chagwiza G, Jones BC, Hove-Musekwa SD (2017) Optimisation of total water coverage in a network with priority using max-min ant system algorithm. Urban Water J 14(3):315–324

    Article  Google Scholar 

  • Dash P, Rahman MdM (2019) Developing algorithm to obtain the maximum flow in a network flow problem. J Adv Res Dyn Control Syst 11(2):455–459

    Google Scholar 

  • Edmonds J, Karp RM (1972) Theoretical improvements in algorithmic efficiency for network flow problems. J ACM 19(2):248–264. https://doi.org/10.1145/321694.321699

    Article  MATH  Google Scholar 

  • Ford Jr. LR, Fulkerson DR (1956) Maximal flow through a network. Can J Math 8:399–404. https://doi.org/10.4153/CJM-1956-045-5

    Article  MathSciNet  MATH  Google Scholar 

  • Goldfarb D, Hao J (1993) On the maximum capacity augmentation algorithm for maximum flow problem. Discret Appl Math 47(1):9–16

    Article  MathSciNet  MATH  Google Scholar 

  • Hafezalkotob A, Makui A (2015) Cooperative Maximum flow problem under uncertainty in logistic networks. Appl Math Comput 250:593–604

    MathSciNet  MATH  Google Scholar 

  • Han S, Peng Z, Wang S (2014) The maximum flow problem of uncertain network. Inf Sci 265:167–175

    Article  MathSciNet  MATH  Google Scholar 

  • Jain C, Garg D (2012) Improved edmond karps algorithm for network flow problem. Int J Comput Appl 37(1):48–53

    Google Scholar 

  • Khan MdA, Rashid A, Khan AR, Uddin MdS (2013) An innovative approach for solving maximal-flow problems. J Phys Sci 17:143–154

    MathSciNet  Google Scholar 

  • Kinsley AA, Maheswari BU (2016) Design of algorithms to maximum flow problems in the flow networks. Int J Sci Eng Technol Res 5(4):1015–1018

    Google Scholar 

  • Kyi M, Naing L (2018) Application of ford-fulkerson algorithm to maximum flow in water distribution pipeline network. Int J Sci Res Publ 8(12):306–310

    Google Scholar 

  • Li H, Zhang T, Zhang Y, Wang K, Li J (2017) A maximum flow algorithm based on storage time aggregated graph for delay tolerant networks. Ad Hoc Netw 59:63–70

    Article  Google Scholar 

  • Majumder S, Saha B, Anand P, Kar S, Pal T (2017) Uncertainty based genetic algorithm with varying population for random fuzzy maximum flow problem. Expert Syst 35(4):1–29

    Google Scholar 

  • Mallick KK, Khan AR, Ahmed MM, Arefin MdS, Uddin MdS (2016) Modified EDMONDSKARP algorithm to solve maximum flow problems. Open J Appl Sci 6:131–140

    Google Scholar 

  • Munapo E, Kumar S, Mpeta K (2021) A New direction to the maximal flow problem: a route merging approach. Appl Math Inf Sci Int J 15(4):487–495

    Article  MathSciNet  Google Scholar 

  • Munapo E, Tawanda T, Nyamugure P, Kumar S (2023) Maximum flow by network reconstruction method. In: Vasant P, Weber GW, Marmolejo-Saucedo JA, Munapo E, Thomas JJ (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

    Chapter  Google Scholar 

  • Nazemi A, Omidi F (2012) A capable neural network model for solving the maximum flow problem. J Comput Appl Math 236(14):3498–3513

    Article  MathSciNet  MATH  Google Scholar 

  • Paithankar A, Chatterjee S (2019) Open pit mine production schedule optimization using a hybrid of maximum flow and genetic algorithms. Appl Soft Comput 81:105507

    Article  Google Scholar 

  • Rahmah AA, Diah C, Elis H (2020) Adjustable robust counterpart optimization model for maximum flow problem with box uncertainty. World Sci News Int J 141:91–102

    Google Scholar 

  • Raja M, Ahmad S, Azzam S (2017) Grey wolf optimization applied to the maximum flow problem. Int J Adv Appl Sci 4(7):95–100

    Article  Google Scholar 

  • Sallam G, Gupta GR, Li B, Ji B (2018) Shortest path and maximum flow problems under service function chaining constraints. In: IEEE infocom 2018-IEEE conference on computer communications. IEEE, pp 2132–2140

    Chapter  Google Scholar 

  • Shi G, Sheng Y, Ralescu DA (2017) The maximum flow problem of uncertain random network. J Ambient Intell Human Comput 8:667–675

    Article  Google Scholar 

  • Tayyebi J, Mohammad A, Mohammad S, Kazemi R (2018) Reverse maximum flow problem under the weighted chebyshev distance. RAIRO Oper Res 52(4–5):1107–1121

    Article  MathSciNet  MATH  Google Scholar 

  • Wang Y, Ling J, Zhou S, Liu Y, Liao W, Zhang B (2018) A study on rapid incremental maximum flow algorithm in dynamic network. In: 1st international cognitive cities conference, pp 7–11

  • Zeynep S, Kuban A, Necati A (2020) Exact solution algorithm for the maximum flow problem with additional conflict constraints. Eur J Oper Res 287(2):410–437

    Article  MathSciNet  MATH  Google Scholar 

  • Zhang T, Deng S, Li H, Hou R, Zhang H (2017) A maximum flow algorithm for buffer limited delay tolerant networks. J Commun Inf Netw 2:52–60

    Article  Google Scholar 

  • Zhao P, Han X, Wan D (2021) Evaluation of the airport ferry vehicle scheduling based on network maximum flow model. Omega 99:102178

    Article  Google Scholar 

Download references

Acknowledgements

The authors are grateful to the anonymous reviewers for their helpful comments and suggestions during the development of this paper. The authors would like also to thank the Associate Editor Dr. Adarsh Anand for the role he played.

Funding

The authors did not receive any financial support from any organisation for the submitted work.

Author information

Authors and Affiliations

  1. Department of Statistics and Operations Research, National University of Science and Technology, Bulawayo, Zimbabwe

    Trust Tawanda & Philimon Nyamugure

  2. Department of Mathematical and Geospatial Sciences, School of Sciences, RMIT University, Melbourne, Australia

    Santosh Kumar

  3. School of Economics and Decision Sciences, North West University, Mafikeng Campus, Mafikeng, South Africa

    Elias Munapo

Authors
  1. Trust Tawanda
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Philimon Nyamugure
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Santosh Kumar
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Elias Munapo
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Trust Tawanda.

Ethics declarations

Conflict of interest

All authors certify that they have no affiliation with or involvement in any organisation or entity with any financial interest or non-financial interest in the subject matter or materials discussed in this manuscript.

Human and animal rights

The authors certify that this research does not involve animal or human participants.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Tawanda, T., Nyamugure, P., Kumar, S. et al. An intelligent node labelling maximum flow algorithm. Int J Syst Assur Eng Manag 14, 1276–1284 (2023). https://doi.org/10.1007/s13198-023-01930-3

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13198-023-01930-3

Keywords

Search

Navigation