Skip to main content
SpringerLink
Log in

An experimental study of newly proposed initial basic feasible solution methods for a transportation problem

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

Abstract

This study presents an extensive experimental study of heuristic methods or initial basic feasible solution (IBFS) methods, which is one of the main steps to achieve an optimal or accepted (near-optimal) solution, for a transportation problem (TP). In this study, we proposed 23 new IBFS methods (18 new IBFS methods, and 5 variants of existing IBFS methods) for a TP. We conducted a series of experimental analyses with 640 randomly generated problem instances to study the performance efficiency of the 23 newly proposed IBFS methods in comparison with (a) solutions obtained from 11 latest IBFS methods published in the literature, and (b) optimal solution obtained from linear programming approach. Our multiple performance analyses revealed that the first six ranking positions (with respect to the total transportation cost obtained from each of the 34 IBFS methods over 640 problem instances) are related to the newly proposed IBFS methods and the 7th to 10th ranking positions are related to the existing IBFS methods. Furthermore, the first two best performing newly proposed IBFS methods are yielding near to optimal solution (with 0% to 2% loss of optimality). So, these can be easily integrated as the sub-module to solve any complex decision-making problems such as Logistics/Supply Chain Management.

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. Amaliah, B., Fatichah, C., Suryani, E.: Total opportunity cost matrix—minimal total: a new approach to determine initial basic feasible solution of a transportation problem. Egypt. Inf. J. 20, 131–141 (2019)

    Google Scholar 

  2. Babu, M.A., Hoque, M.A., Uddin, M.S.: A heuristic for obtaining better initial feasible solution to the transportation problem. Opsearch 57, 221–245 (2020)

    Article  Google Scholar 

  3. Babu, M.A., Das, U.K., Khan, A.R., Uddin, M.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. Appl. 4(1), 418–422 (2014)

    Google Scholar 

  4. Can, T., Kocak, H.: Tuncay can’s approximation method to obtain initial basic feasible solution to transportation problem. Appl. Comput. Math. 5(2), 78–82 (2016)

    Article  Google Scholar 

  5. Cano, A.A., Correa-Espinal, A.A., Gómez-Montoya, R.A.: Mathematical programming modeling for joint order batching, sequencing and picker routing problems in manual order picking systems. J. King Saud Univ. Eng. Sci. 32, 219–228 (2020)

    Google Scholar 

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

    Google Scholar 

  7. Charnes, A., Cooper, W.W.: The stepping-stone method for explaining linear programming calculations in transportation problems. Manag. Sci. 1(1), 49–69 (1954)

    Article  Google Scholar 

  8. Dantzig, G.B.: Liner Programming Extension. Princeton University Press, Princeton (1963)

    Book  Google Scholar 

  9. Dantzig, G.B.: Application of the simplex method to a transportation problem. In: Koopmans, T.C. (ed.) Activity Analysis of Production and Allocation. Wiley, Hoboken (1951)

    Google Scholar 

  10. Geetha, T., Anandhi, N.: Method for solving unbalanced transportation problems using standard deviation. Int. J. Pure Appl. Math. 119(16), 4971–4989 (2018)

    Google Scholar 

  11. Hillier, F.S., Lieberman, G.J.: Introduction to Operations Research, 9th edn. McGraw-Hill, New York (2010)

    Google Scholar 

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

    Article  Google Scholar 

  13. Hosseini, E.: Three new methods to find initial basic feasible solution of transportation problems. Appl. Math. Sci. 11(37), 1803–1814 (2017)

    Google Scholar 

  14. Juman, Z.A.M.S., Hoque, M.A.: An efficient heuristic to obtain a better initial feasible solution to the transportation problem. Appl. Soft Comput. 34, 813–826 (2015)

    Article  Google Scholar 

  15. Karagul, K., Sahin, Y.: A novel approximation method to obtain initial basic feasible solution of transportation problem. J. King Saud Univ. Eng. Sci. 32, 211–218 (2020)

    Google Scholar 

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

    Article  Google Scholar 

  17. Koopmans, T.C.: Optimum utilization of the transportation system. Econometrica 17, 136–146 (1947)

    Article  Google Scholar 

  18. Kumar, R.R., Radha, G., Karthiyayini, O.: A new approach to find the initial basic feasible solution of a transportation problem. Int. J. Res. Granthaalayah 6(5), 321–325 (2018)

    Article  Google Scholar 

  19. Mathirajan, M., Meenakshi, B.: Experimental analysis of some variants of Vogel’s approximation method. Asia-Pac. J. Oper. Res. 21(4), 447–462 (2004)

    Article  Google Scholar 

  20. Mathirajan, M., Hariharakrishnan, C.V., Ramachandran, V.: An experimental evaluation of heuristic algorithms for bus-depot matching problem of urban road transport systems. Opsearch 47(2), 143–157 (2010)

    Article  Google Scholar 

  21. Mathirajan, M., Suba, P., Ramanathan, R.: Location of depots and allocation of buses to depots in urban road transport organizations: a mathematical model and greedy heuristic algorithm. Accepted in Int. J. Oper. Res. (Inderscience). https://www.inderscience.com/info/ingeneral/forthcoming.php?jcode=ijor (2020)

  22. Parkhai, S., Jagadeesh, D., Arun Kumar, R.: A study on transport cost optimization in retail distribution. J. Supply Chain Manag. Syst. 3(4), 31–38 (2014)

    Google Scholar 

  23. Pargar, F., Javadian, N., Ganji, A.P.: A heuristic for obtaining an initial solution for the transportation problem with experimental analysis. In: The 6th International Industrial Engineering Conference. Sharif University of Technology, Tehran (2009)

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

    Google Scholar 

  25. Reza, A.K.M.S., Jamali, A.R.M.J.U., Biswas, B.: A modified algorithm for solving unbalanced transportation problems. J. Eng. Sci. 10(1), 93–101 (2019)

    Google Scholar 

  26. Korukoglu, S., Balli, S.: An improved Vogel’s approximation method for the transportation problem. Math. Comput. Appl. 16(2), 370–381 (2011)

    Google Scholar 

  27. Shih, M.: Modified stepping-stone method as a teaching aid for capacitated transportation problems. Decis. Sci. 18(4), 662–676 (1987)

    Article  Google Scholar 

  28. Storozhyshina, N., Pargar, F., Vasko, F.J.: A comprehensive empirical analysis of 16 heuristics for the transportation problem. OR Insight 24(1), 63–76 (2011)

    Article  Google Scholar 

  29. Sudhakar, V.J., Arunsankar, N., Karpagam, T.: A new approach for finding an optimal solution for transportation problems. Eur. J. Sci. Res. 68(2), 254–257 (2012)

    Google Scholar 

  30. Tayyeh, S.O., Hussien, S.J.A.: Using transportation model for aggregate planning: a case study in soft drinks industry. J. Log. Manag. 7(1), 11–46 (2018)

    Google Scholar 

  31. Ullah, M.W., Uddin, M.A., Kawser, R.: A modified Vogel’s approximation method for obtaining a good primal solution of transportation problems. Ann. Pure Appl. Math. 11(1), 63–71 (2016)

    Google Scholar 

  32. Winston, W.L.: Operations Research: Applications and Algorithms. Thomson, Belmont (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Management Studies, Indian Institute of Science, Bangalore, Karnataka, 560012, India

    M. Mathirajan

  2. Department of Information Technology, National Institute of Technology Suratkal, Mangalore, Karnataka, 575025, India

    Sujan Reddy

  3. Vinod Gupta School of Management, Indian Institute of Technology-Kharagpur, Kharagpur, 721302, India

    M. Vimala Rani

Authors
  1. M. Mathirajan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sujan Reddy
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. M. Vimala Rani
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M. Mathirajan.

Additional information

Publisher's Note

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

Supplementary Information

Below is the link to the electronic supplementary material.

Supplementary file1 (DOCX 275 KB)

Appendix 1

Appendix 1

figure a

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Mathirajan, M., Reddy, S. & Rani, M.V. An experimental study of newly proposed initial basic feasible solution methods for a transportation problem. OPSEARCH 59, 102–145 (2022). https://doi.org/10.1007/s12597-021-00533-5

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12597-021-00533-5

Keywords

Search

Navigation