Skip to main content

An Efficient Procedure to Determine the Initial Basic Feasible Solution of Time Minimization Transportation Problem

  • Conference paper
  • First Online:
  • 2372 Accesses

Part of the book series: Lecture Notes in Business Information Processing ((LNBIP,volume 247))

Abstract

To meet the challenge of delivering products to the customers in a minimum time, Time Minimization Transportation Problem (TMTP) provides a powerful framework to determine the better ways to deliver products to the customer. In this paper, we present a new procedure for determining an initial basic feasible solution of TMTP. Comparative study is accomplished between the presented procedure and the other existing procedures in virtue of sample examples which demonstrate that the presented procedure requires less number of iterations to reach the optimal transportation time.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Hitchcock, F.L.: The distribution of a product from several sources to numerous localities. J. Math. Phy. 20, 224–230 (1941)

    Article  MathSciNet  MATH  Google Scholar 

  2. Dantzig, G.B.: Application of the simplex method to a transportation problem. In: Koopmans, T.C. (ed.) Activity Analysis of Production and Allocation, pp. 359–373. Wiley, New York (1951)

    Google Scholar 

  3. Charnes, A., Cooper, W.W., Henderson, A.: An Introduction to Linear Programming. Wiley, New York (1953)

    MATH  Google Scholar 

  4. Rashid, A., Ahmed, S.S., Uddin, Md.S.: Development of a new heuristic for improvement of initial basic feasible solution of a balanced transportation problem. Jahangirnagar Univ. J. Math. Math. Sci. 28, 105–112 (2013)

    Google Scholar 

  5. Khan, A.R.: A re-solution of the transportation problem: an algorithmic approach. Jahangirnagar Univ. J. Sci. 34(2), 49–62 (2011)

    Google Scholar 

  6. Khan, A.R.: Analysis and re-solution of the transportation problem: a linear programming approach. M. Phil. thesis, Department of Mathematics, Jahangirnagar University (2012)

    Google Scholar 

  7. Khan, A.R., Vilcu, A., Sultana, N., Ahmed, S.S.: Determination of initial basic feasible solution of a transportation problem: a TOCM-SUM approach. Bul. Ins. Pol. Din Iasi, Romania, Secţia Automatica si Calculatoare LXI(LXV), 1, 39–49 (2015)

    Google Scholar 

  8. Khan, A.R., Banerjee, A., Sultana, N., Islam, M.N.: Solution analysis of a transportation problem: a comparative study of different algorithms. Accepted for publication in the Bul. Ins. Pol. Din Iasi, Romania, Section Textile. Leathership (2015)

    Google Scholar 

  9. Khan, A.R., Vilcu, A., Uddin, Md.S., Ungureanu, F.: A competent algorithm to find the initial basic feasible solution of cost minimization transportation problem. Bul. Ins. Pol. Din Iasi, Romania, Secţia Automatica si Calculatoare LXI(LXV), 2, 71–83 (2015)

    Google Scholar 

  10. Russell, E.J.: Extension of Dantzig’s algorithm to finding an initial near-optimal basis for the transportation problem. Ope. Res. 17(1), 187–191 (1969)

    Article  MATH  Google Scholar 

  11. Hamdy, A.T.: Operations Research: An Introduction, 8th edn, pp. 193–220. Prentice Hall, Upper Saddle River (2007)

    Google Scholar 

  12. Kasana, H.S., Kumar, K.D.: Introductory Operations Research: Theory and Applications, pp. 221–243. Springer, Heidelberg (2004)

    Book  MATH  Google Scholar 

  13. Uddin, Md.S., Anam, S., Rashid, A., Khan, A.R.: Minimization of transportation cost by developing an efficient network model. Jahangirnagar J. Math. Math. Sci. 26, 123–130 (2011)

    Google Scholar 

  14. Islam, Md.A., Khan, A.R., Uddin, Md.S., Malek, M.A.: Determination of basic feasible solution of transportation problem: a new approach. Jahangirnagar Univ. J. Sci. 35(1), 101–108 (2012)

    Google Scholar 

  15. Babu, Md.A, Das, U.K., Khan, A.R., Uddin, Md.S.: A simple experimental analysis on transportation problem: a new approach to allocate zero supply or demand for all transportation algorithm. Int. J. Eng. Res. App. (IJERA) 4(1), 418–422 (2014)

    Google Scholar 

  16. Uddin, Md.M., Khan, A.R., Roy, S.K., Uddin, Md.S.: A new approach for solving unbalanced transportation problem due to additional supply. Accepted for publication in the Bul. Ins. Pol. Din Iasi, Romania, Section Textile. Leathership (2015)

    Google Scholar 

  17. Ahmed, M.M.: Algorithmic approach to solve transportation problems: minimization of cost and time. M. Phil. thesis, Department of Mathematics, Jahangirnagar University (2014)

    Google Scholar 

  18. Ahmed, M.M., Tanvir, A.S.M., Sultana, S., Mahmud, S., Uddin, Md.S.: An effective modification to solve transportation problems: a cost minimization approach. Ann. Pure Appl. Math. 6(2), 199–206 (2014)

    Google Scholar 

  19. Ahmed, M.M., Khan, A.R., Uddin, Md.S., Ahmed, F.: A new approach to solve transportation problems. Open J. Opt. 5(1), 22–30 (2016)

    Article  Google Scholar 

  20. Ahmed, N.U., Khan, A.R., Uddin, Md.S.: Solution of mixed type transportation problem: a fuzzy approach. Bul. Ins. Pol. Din Iasi, Romania, Secţia Automatica si Calculatoare, LXI(LXV), 2, 19–31 (2015)

    Google Scholar 

  21. Kirca, O., Satir, A.: A heuristic for obtaining an initial solution for the transportation problem. J. Oper. Res. Soc. 41, 865–871 (1990)

    MATH  Google Scholar 

  22. Reinfeld, N.V., Vogel, W.R.: Mathematical Programming. Prentice-Hall, Englewood Cliffs (1958)

    MATH  Google Scholar 

  23. Anam, S., Khan, A.R., Haque, Md.M, Hadi, R.S.: The impact of transportation cost on potato price: a case study of potato distribution in Bangladesh. Int. J. Manag. 1(3), 1–12 (2012)

    Google Scholar 

  24. Shenoy, G.V., Srivastava, U.K., Sharma, S.C.: Operations Research for Management, 2nd edn. New Age International (P) Limited Publishers, New Delhi (1991)

    Google Scholar 

  25. Das, U.K., Babu, Md.A., Khan, A.R., Helal, Md.A, Uddin, Md.S.: Logical Development of Vogel’s Approximation Method (LD-VAM): an approach to find basic feasible solution of transportation problem. Int. J. Sci. Tech. Res. (IJSTR) 3(2), 42–48 (2014)

    Google Scholar 

  26. Das, U.K., Babu, Md.A., Khan, A.R., Uddin, Md.S.: Advanced Vogel’s Approximation Method (AVAM): a new approach to determine penalty cost for better feasible solution of transportation problem. Int. J. Eng. Res. Tech. (IJERT) 3(1), 182–187 (2014)

    Article  Google Scholar 

  27. Hammer, P.L.: Time minimizing transportation problems. N. Res. Log. Q. 16(3), 345–357 (1969)

    Article  MathSciNet  MATH  Google Scholar 

  28. Sharma, A., Verma, V., Kaur, P., Dahiya, K.: An iterative algorithm for two level hierarchical time minimization transportation problem. Eur. J. Oper. Res. 246, 700–707 (2015)

    Article  MathSciNet  Google Scholar 

  29. Garfinkel, R.S., Rao, M.R.: The bottleneck transportation problem. N. Res. Log. Q. 18, 465–472 (1971)

    Article  MathSciNet  MATH  Google Scholar 

  30. Nikolic, I.: Total time minimizing transportation problem. Yugosl. J. Oper. Res. 17, 125–133 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  31. Uddin, Md.S.: Transportation time minimization: an algorithmic approach. J. Phys. Sci. 16, 59–64 (2012)

    MathSciNet  Google Scholar 

  32. Uddin, Md.M., Rahaman, Md.A., Ahmed, F., Uddin, Md.S., Kabir, Md.R.: Minimization of transportation cost on the basis of time allocation: an algorithmic approach. Jahangirnagar J. Math Math. Sci. 28, 47–53 (2013)

    Google Scholar 

  33. Ahmed, M.M., Islam, Md.A., Katun, M., Yesmin, S., Uddin, Md.S.: New procedure of finding an initial basic feasible solution of the time minimizing transportation problems. Open J. Appl. Sci. 5, 634–640 (2015)

    Article  Google Scholar 

  34. Szwarc, W.: Some remarks on the transportation problem. N. Res. Log. Q. 18, 473–485 (1971)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgement

The first author acknowledges the financial support provided by the EU Erasmus Mundus Project-cLINK, Grant Agreement No: 212-2645/001-001-EM, Action 2.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Aminur Rahman Khan .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Khan, A.R., Vilcu, A., Uddin, M.S., Istrate, C. (2016). An Efficient Procedure to Determine the Initial Basic Feasible Solution of Time Minimization Transportation Problem. In: Borangiu, T., Dragoicea, M., Nóvoa, H. (eds) Exploring Services Science. IESS 2016. Lecture Notes in Business Information Processing, vol 247. Springer, Cham. https://doi.org/10.1007/978-3-319-32689-4_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-32689-4_15

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-32688-7

  • Online ISBN: 978-3-319-32689-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics