International Journal of Scientific & Technology Research

Home About Us Scope Editorial Board Blog/Latest News Contact Us
10th percentile
Powered by  Scopus
Scopus coverage:
Nov 2018 to May 2020


IJSTR >> Volume 9 - Issue 3, March 2020 Edition

International Journal of Scientific & Technology Research  
International Journal of Scientific & Technology Research

Website: http://www.ijstr.org

ISSN 2277-8616

An Optimal Solution For Time Minimizing Transportation Problems By Using Maximum Range Method

[Full Text]



N.Anandhi T.Geetha



Transportation problem, Transportation Time, Optimal Solution, Range and MRM



This article presents a new method named Maximum Range Method (MRM) for finding an optimal solution for Time Minimizing Transportation Problems (TMTP).The main purpose of this method is to Minimize the maximum time of transportation for all availability to requirement, rather than minimizing transportation cost. The procedure of MRM is developed by Transportation Problem with equality constraints. The proposed method is determine an optimum solution for TMTP and compare with the obtained results of other conventional methods, and found that the proposed method gives the better results from other traditional method. In this dissertation one more method of achieving a minimum time of transportation has been developed which is very different from obtainable method. Finally, a numerical illustration has been presented for better understanding of the algorithm



[1] Hammer, P.L., "Time minimizing transportation problem”, Naval Research Logistics Quarterly, 16, 1969, pp. 345-357.
[2] R. Garfinkel and M. Rao, The bottleneck transportation problem. Naval Research Logistics Quarterly, 18, 1971, 72–465
[3] W. Szware, Some remarks om the transportation problem, Naval Research Logistics, 18, 1971, 473-85.
[4] H. Bhatia, K. Saroop, and M. Puri, A procedure for time minimization transportation problem, Indian Journal of Pure and Applied Mathematics, 8, 1977, 29–920.
[5] Sharma, J.K., and Swarup, K., "Time minimizing transportation problems", in Proceedings of Indian Academy of Sciences- Mathematical Sciences, 86, 1977, pp. 513-518.
[6] C.R. Seshan, C.R and Tikekar, V.G. On Sharma-Swarup algorithm for time minimizing transportation problems, Proc. Indian Acad. Sci., 89 (2), 1980 101−102.
[7] Khan, A.R., Vilcu, A., Uddin, M.S. and Istrate, C. 2016. An efficient procedure to determine the initial basic feasible solution new method for solving bottleneck-cost transportation problems. In Proceedings of International Conference on Exploring Services Science, Springer. 201-212
[8] Agarwal, S. and Sharma, S. 2014. An open loop method for time minimizing transportation problem with mixed constraints. In Proceedings of International Conference on Innovative Approach in Applied Physical, Mathematical/Statistical, Chemical Sciences and Emerging Energy Technology for Sustainable Development. 83-89.
[9] Nikolic, I. 2007. Total time minimizing transportation problem. Yugoslav Journal of Operations Research. 17. 125- 133.
[10] Ahmed, M. M. and Islam, M. A., Katun, M., Yesmin, S. and Uddin M. S. 2015. New Procedure of Finding an Initial Basic Feasible Solution of the Time Minimizing Transportation Problems. Open Journal of Applied Sciences. 5. 634-640.