Skip to main content
SpringerLink
Log in

Multi-index fixed charge bi-criterion transshipment problem

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

Abstract

The multi index fixed charge transshipment problem is an extension of the classical transshipment problem in which a fixed cost is incurred for every origin. In the transshipment problem all the sources and destinations can function in any direction, thus it is very useful to reduce the transportation cost. In this paper we present an algorithm to find out the efficient cost-time trade-off pairs for the three-dimensional fixed charge bi-criterion transshipment problem having the same priority to cost as well as time. To find out the efficient cost-time trade off pairs for the given problem, we form a related fixed charge bi-criterion three dimensional transportation problem and the efficient cost-time trade-off pairs for the given problem are derivable from this related problem. Also, we find out an optimum trade-off pair among all the efficient cost-time trade-off pairs, which has the minimum distance from the ideal pair. The algorithm involves finite number of iterations and is easy to understand and apply. It can serve the managers by providing the solution to a variety of production distribution problem where heterogeneous amount of commodities are to be transshipped. Numerical examples are also included to support the theory.

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

Similar content being viewed by others

References

  1. Adlakha, V., Kowalski, K., Lev, B.: Solving transportation problems with mixed constraints. Int. J. Manag. Sci. Eng. Manag. 1(1), 47–52 (2006)

    Google Scholar 

  2. Adlakha, V., Kowalski, K., Lev, B.: A branching method for fixed charge transportation problem. Omega 38(5), 393–397 (2010)

    Article  Google Scholar 

  3. Ahuja, A., Arora, S.R.: Multi index fixed charge bi-criterion transportation problem. Indian J. Pure Appl. Math. 32(5), 739–746 (2001)

    Google Scholar 

  4. Arora, S.R., Khurana, A.: A paradox in an indefinite quadratic transportation problem. Int. J. Manag. Sci. 7(2), 13–30 (2001)

    Google Scholar 

  5. Arora, S.R., Khurana, A.: Three dimensional fixed charge bi-criterion indefinite quadratic transportation problem. Yugoslavia J. Oper. Res. 14(1), 83–97 (2004)

    Article  Google Scholar 

  6. Basu, M., Pal, B.B., Kundu, A.: An algorithm for optimum time- cost trade-off in fixed charge bi-criterion transportation problem. Optimization 30, 53–68 (1994)

    Article  Google Scholar 

  7. Brigden, M.E.B.: A variant of transportation problem in which the constraints are of mixed type. Oper. Res. Q. 25(3), 437–445 (1974)

    Article  Google Scholar 

  8. Garg, R., Prakash, S.: Time minimizing transshipment problem. Indian J. Pure Appl. Math. 16(5), 449–460 (1985)

    Google Scholar 

  9. Goldberg, A.V.: An efficient implementation of a scaling minimum-cost flow algorithm. J. Algorithm. 2, 1–29 (1997)

    Article  Google Scholar 

  10. Haley, K.B.: The solid transportation problem. Oper. Res. 10, 448–463 (1962)

    Article  Google Scholar 

  11. Haley, K.B.: The multi-index transportation problem. Oper. Res. 11, 368–379 (1963)

    Article  Google Scholar 

  12. Hirsch, W.M., Dantzig, G.B.: Notes on linear programming: Part XIX, the fixed charge problem, rand research mamorandum, Santa Monica, California No.1383 (1954)

  13. Hurt, V.G., Tramel, T.E.: Alternative formulations of the transshipment problem. J. Farm Econ. 47(3), 763–773 (1965)

    Article  Google Scholar 

  14. Judge, G.G., Havlicek, J., Rizek, R.L.: An interregional model: its formulation and application to the livestock industry. Agr. Econ. Rev. 17, 1–9 (1965)

    Google Scholar 

  15. King, G.A., Logan, S.H.: Optimum location, number, and size of processing plants with raw product and final product shipments. J. Farm Econ. 46, 94–108 (1964)

    Article  Google Scholar 

  16. Khurana, A., Verma, T., Arora, S.R.: An algorithm for solving time minimizing capacitated transshipment problem. Int. J. Manag. Sci. Eng. Manag. 7(3), 192–199 (2012)

    Google Scholar 

  17. Khurana, A., Arora, S.R.: An algorithm for solving three-dimensional transshipment problem. Int. J. Math. Oper. Res. 4(2), 97–113 (2011)

    Article  Google Scholar 

  18. Khurana, A., Arora, S.R.: Cost-time constrained indefinite quadratic transportation problem. Int. J. Optim.: Theory Meth. Appl. 2(3), 239–251 (2010)

    Google Scholar 

  19. Khurana, A., Thirwani, D., Arora, S.R.: An algorithm for solving fixed charge bi-criterion indefinite quadratic transportation problem with restricted flow. Int. J. Optim.: Theory Meth. Appl. 1(4), 367–380 (2009)

    Google Scholar 

  20. Khurana, A., Arora, S.R.: The sum of a linear and a linear fractional transportation problem with restricted and enhanced flow. Int. J. Interdiscip. Math. 9(2), 373–383 (2006)

    Google Scholar 

  21. Klingman, D., Russel, R.: Solving constrained transportation problems. Oper. Res. 23(1), 91–105 (1975)

    Article  Google Scholar 

  22. Murty, K.G.: Solving the fixed-charge problem by ranking the extreme points. Oper. Res. 16, 268–279 (1968)

    Article  Google Scholar 

  23. Pandian, P., Anuradha, D.: A new approach for solving solid transportation problems. Appl. Math. Sci. 4(72), 3603–3610 (2010)

    Google Scholar 

  24. Rhody, D.H.: Interregional competitive position of the hog-pork industry in the southeast united States, unpublished Ph.D. thesis, Iowa State University (1963)

  25. Orden, A.: Transshipment problem. Manag. Sci. 3, 276–285 (1956)

    Article  Google Scholar 

  26. Orlin, J.B.: Genuinely polynomial simplex and non-simplex algorithms for the minimum cost flow problem, Technical Report No. 1615-84, Sloan School of Management, MIT, Cambridge, MA (1984)

Download references

Acknowledgements

The author is thankful to University Grant Commission, New Delhi for financial support and is also grateful to her father Sh. B.D. Khurana who has been the inspiration for writing this paper. The author would also like to thank Ms. Tripti Verma, project fellow, Guru Gobind Singh Indraprastha University, Delhi, for her suggestions which were helpful in revising the paper.

Author information

Authors and Affiliations

  1. School of Basic and Applied Sciences, Guru Gobind Singh Indraprastha University, Dwarka Sector-16C, Delhi, 110075, India

    Archana Khurana

Authors
  1. Archana Khurana
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Archana Khurana.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Khurana, A. Multi-index fixed charge bi-criterion transshipment problem. OPSEARCH 50, 229–249 (2013). https://doi.org/10.1007/s12597-012-0108-z

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12597-012-0108-z

Keywords

Search

Navigation