Skip to main content
SpringerLink
Log in

The problem of maximum flow with minimum attainable cost in a network

  • Application Article
  • Published:
OPSEARCH Aims and scope Submit manuscript

Abstract

The routing problems pertain to the search for a shortest route (minimum cost or minimum distance or maximum flow, etc.) connecting two specified stations or nodes described as ‘source’ and ‘sink’. The paper aims at obtaining an optimal route of a more realistic situation as to scheduling maximum flows at a minimum cost from a source to a destination. The distance (cost) and arc capacity between any two stations are given. The objective is to find the maximum flow with the minimum cost from the source to the destination in a network. The problem has many applications in the field of network flow theories. Several special cases of the problem were intensively studied in the literature and proposed various techniques to solve. Here we solved the present problem by the lexicographic search technique, which gives the exact solution to the problem. The solution procedure is illustrated with a suitable example. The algorithm is also tested in C-language and the computational details are also reported.

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.

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

Similar content being viewed by others

References

  1. Bansal, S.P., Kumar, S.: Shortest-route subject to improvements through dynamic programming. (Privately Circulated) (1970)

  2. Bansal, S.P., Kumar, S.: Optimal tour with multiple job facilities at each station. Indian J. Math. 13(1), 45–49 (1971)

    Google Scholar 

  3. Bellman: On a routing problem. Q Appl Math XVI(1), 87–90 (1958)

  4. Dantzig, G.B.: Discrete variable extremum problems. Oper. Res. 5, 226–277 (1957)

    Article  Google Scholar 

  5. Das, S.: Routing and allied combinatorial programming problems (A lexicographic Search Approach). Ph. D. Thesis, Dibrugarh University (1976)

  6. Das, S., Ahmed, N.: A travelling salesman problem (TSP) with multiple job facilities. OPSEARCH 38(4), 394–406 (2001)

    Google Scholar 

  7. Das, S., Borah, P.C.: A lexicographic search approach to a precedence constrained M-TSP. Paper presented in the 3rd International Conference on Lattices Path Combinatorial & Applications, held at Delhi (1993)

  8. Fathabadi, H.S., Shirdel, G.H.: An O(nm2) time algorithm for solving minimal cost network flow problems. Asia-Pacific J. Oper. Res. (APORS) 20(2) (2002)

  9. Ford Jr., L.R., Fulkerson, D.R.: Maximal flow through a network. Can. J. Math. 8, 399–404 (1956)

    Article  Google Scholar 

  10. Ford jr, L.R., Fulkerson, D.R.: Flows in Network. Princeton University Press, Princeton, NJ (1962)

    Google Scholar 

  11. Fulkerson, D.R.: An out-of-kilter method for minimal cost flow problems. J. Soc. Indust. Appl. Math. 9, 18–27 (1961)

    Article  Google Scholar 

  12. Klein, M.: A primal method for minimal cost flows with application to the assignment and transportation problems. Manag. Sci. 14(3), 205–220 (1967)

    Article  Google Scholar 

  13. Kumar, S.: Minimal cost flow problem in a network. Advancing Frontier in Operational Research (Proceeding of the International Seminar), held at New Delhi, 7–10 August (1967)

  14. Pandit, S.N.N.: Some observations on a routing problem. Oper. Res. 10(5), 726–727 (1962)

    Article  Google Scholar 

  15. Pandit, S.N.N.: The loading problem. Oper. Res. 10(5), 639–646 (1962)

    Article  Google Scholar 

  16. Pandit, S. N. N.: Some Quantitative Combinatorial Search Problem. Ph. D. Thesis, IIT, Kharagpur (1963)

  17. Peart, R.M., et al.: The shortest route problem. Oper. Res. 8, 866–868 (1960)

    Article  Google Scholar 

  18. Pollack, M., Walter, W.: Solutions of the shortest route problem—a review. Oper. Res. 8, 224–230 (1960)

    Article  Google Scholar 

  19. Purusotham, S., Sundara Murthy, M.: An exact algorithm for multi-product bulk transportation problem. Int. J. Comput. Sci. Eng. 3(9), 3222–3236 (2011)

    Google Scholar 

  20. Purusotham, S., Sundara Murthy, M.: A new approach for solving the network problems. OPSEARCH 49(1), 1–21 (2012)

    Article  Google Scholar 

  21. Saksena, J.P., Kumar, S.: The routing problem with k-specified nodes. Oper. Res. 14(5), 909–913 (1966)

    Article  Google Scholar 

  22. Sedeno-Noda, A., Gonzalez-Martin, C.: An alternative method to solve the bi-objective minimum cost flow problem. Asia-Pac J Oper Res (APORS) 20(2) (2003)

Download references

Acknowledgements

We express our thanks to the referees for their fruitful observations and valuable suggestions on the earlier draft of the paper.

Author information

Authors and Affiliations

  1. Department of Statistics, D.H.S.K. College, Dibrugarh, 786001, Assam, India

    Nazimuddin Ahmed

  2. Dibrugarh University, Dibrugarh, 786004, Assam, India

    S. Das

  3. Department of Mathematics, Statistics and Operations Research Division, School of Advanced Sciences, Vellore Institute of Technology University, Vellore, 632014, Tamil Nadu, India

    S. Purusotham

Authors
  1. Nazimuddin Ahmed
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. Das
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. S. Purusotham
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nazimuddin Ahmed.

Rights and permissions

Reprints and permissions

About this article

Cite this article

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

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12597-012-0106-1

Keywords

Search

Navigation