Transportation Problem Solver for Drug Delivery in Pharmaceutical Companies using Steppingstone Method
Keywords:
Transportation Problem, Drug Delivery, Stepping Stone Method, Vogel’s Method, Degeneracy, Cost MinimizationAbstract
In this paper, several solutions such as initial basic feasible solution (IBFS), optimal solution and degeneracy solution of the transportation problem are given, regarding the drug delivery from drug factories to different warehouses for minimizing the delivery time as well as cost of transportation according to the destination’s requirement. In this Pandemic, it is the most essential part of the pharmaceutical marketing to focus in this cost minimization. The cost of production varies from company to company, and the transportation cost from one company drug factory to multiple warehouses also varies. Each drug factory has some specific production capacity and each warehouse has some certain amount of requirement. To verify the efficiency of this problem, we use Vogel’s method to find IBFS and compare it with the Stepping stone method for optimization of the cost. In this work, we proposed a case study related to the above problem in which the drug items to be shipped from the drug factories to the warehouses, so that the cost of the transportation is minimized. It also explains the degeneracy in the transportation techniques. From the case study, it is found that the minimum transportation cost is Rs. 212 for both techniques. However, it is observed that the Stepping stone method reduces the degeneracy better than the Vogel’s method. For scalability, we have also simulated the methods in MATLAB to observe the results in two cases. From the two cases, it is seen that Stepping stone method shows minimum cost of transportation.
Downloads
References
Ahmed MM, Tanvir AS, Sultana S, Mahmud S, Uddin MS. An effective modification to solve transportation problems: a cost minimization approach. Annals of Pure and Applied Mathematics. 2014 Aug;6(2):199-206.
Anam S, Khan AR, Haque MM, Hadi RS. The impact of transportation cost on potato price: a case study of potato distribution in Bangladesh. The International Journal of Management. 2012;1(3):1-2.
Babu MA, Das UK, Khan AR, Uddin MS. A simple experimental analysis on transportation problem: a new approach to allocate zero supply or demand for all transportation algorithm. International Journal of Engineering Research & Applications (IJERA). 2014;4(1):418-22.
Babu MA, Helal MA, Hasan MS, Das UK. Lowest allocation method (LAM): a new approach to obtain feasible solution of transportation model. International Journal of Scientific and Engineering Research. 2013;4(11):1344-8.
Bierman Jr H, Bonini CP, Hausman WH. Quantitative Analysis for Business Decisions. Homewood, Illinois: Richard D. Irwin. Inc., 19&1. 1973.
Churchman CW, Ackoff RL, Arnoff EL. Introduction to operations research.
Das UK, Babu MA, Khan AR, Helal MA, Uddin MS. Logical development of Vogel’s approximation method (LD-VAM): an approach to find basic feasible solution of transportation problem. International Journal of Scientific & Technology Research (IJSTR). 2014 Feb;3(2):42-8.
Dykstra DP. Mathematical programming for natural resource management. McGraw-Hill Book Company; 1984.
Ford Jr LR, Fulkerson DR. Solving the transportation problem. Management Science. 1956 Oct;3(1):24-32.
Fulkerson DR. Hitchcock transportation problem. RAND CORP SANTA MONICA CA; 1956 Jul 9.
Garfinkel RS, Rao MR. The bottleneck transportation problem. Naval Research Logistics Quarterly. 1971 Dec;18(4):465-72.
Hammer PL. Time‐minimizing transportation problems. Naval Research Logistics Quarterly. 1969 Sep;16(3):345-57.
Hussein HA, Shiker MA, Zabiba MS. A new revised efficient of VAM to find the initial solution for the transportation problem. InJournal of Physics: Conference Series 2020 Jul 1 (Vol. 1591, No. 1, p. 012032). IOP Publishing.
Hussein HA, Shiker MA. A modification to Vogel’s approximation method to Solve transportation problems. InJournal of Physics: Conference Series 2020 Jul 1 (Vol. 1591, No. 1, p. 012029). IOP Publishing.
Islam MA, Khan AR, Uddin MS, Malek MA. Determination of basic feasible solution of transportation problem: a new approach. Jahangirnagar University Journal of Science. 2012;35(1):101-8.
Juman ZA, Hoque MA. An efficient heuristic to obtain a better initial feasible solution to the transportation problem. Applied Soft Computing. 2015 Sep 1;34:813-26.
Karagul K, Sahin Y. A novel approximation method to obtain IBFS of transportation problem. Journal of King Saud University-Engineering Sciences. 2020 Mar 1;32(3):211-8.
Khan AR, Banerjee A, Sultana N, Islam MN. Solution analysis of a transportation problem: a comparative study of different algorithms. Bulletin of the Polytechnic Institute of Iasi, Romania, Section Textile. Leathership. 2015.
Khan AR, Vilcu A, Sultana N, Ahmed SS. Determination of IBFS of a transportation problem: a TOCM-SUM approach. Buletinul Institutului Politehnic Din Iasi, Romania, Secţia Automatica si Calculatoare. 2015;61(1):39-49.
Nikolić I. Total time minimizing transportation problem. Yugoslav Journal of Operations Research. 2007;17(1):125-33.
Pratihar J, Kumar R, Edalatpanah SA, Dey A. Modified Vogel’s approximation method for transportation problem under uncertain environment. Complex & intelligent systems. 2021 Feb;7(1):29-40.
Ravindran A, Phillips DT, Solberg JJ. Operations research: principles and practice.
Sharif Uddin M. Transportation time minimization: An algorithmic approach, 2012.
Sharma JK, Swarup K. Time minimizing transportation problems. InProceedings of the Indian Academy of Sciences-Section A 1977 Dec 1 (Vol. 86, No. 6, pp. 513-518). Springer India.
Szwarc W. Some remarks on the time transportation problem. Naval Research Logistics Quarterly. 1971 Dec;18(4):473-85.
Uddin MM, Khan AR, Roy SK, Uddin MS. A new approach for solving unbalanced transportation problem due to additional supply. Bulletin of the Polytechnic Institute of Iasi, Romania, Section Textile, Leathership. 2015.
Uddin MS, Anam S, Rashid A, Khan AR. Minimization of transportation cost by developing an efficient network model. Jahangirnagar Journal of Mathematics & Mathematical Sciences. 2011;26:123-30.
Mallick, C., Bhoi, SK, et al. APS-CR: Assignment Problem Solver for Cost Minimization of Crew Routes. Turkish Online Journal of Qualitative Enquiry (TOJQI). 2021; 12(5): 3237-3250.
Verma, S., Kaur, S., Rawat, D. B., Xi, C., Alex, L. T., & Jhanjhi, N. Z. (2021). Intelligent framework using IoT-based WSNs for wildfire detection. IEEE Access, 9, 48185-48196.
Hussain, K., Hussain, S. J., Jhanjhi, N. Z., & Humayun, M. (2019, April). SYN flood attack detection based on bayes estimator (SFADBE) for MANET. In 2019 International Conference on Computer and Information Sciences (ICCIS) (pp. 1-4). IEEE.
Khalil, M. I., Jhanjhi, N. Z., Humayun, M., Sivanesan, S., Masud, M., & Hossain, M. S. (2021). Hybrid smart grid with sustainable energy efficient resources for smart cities. sustainable energy technologies and assessments, 46, 101211.
Almusaylim, Z. A., Zaman, N., & Jung, L. T. (2018, August). Proposing a data privacy aware protocol for roadside accident video reporting service using 5G in Vehicular Cloud Networks Environment. In 2018 4th International conference on computer and information sciences (ICCOINS) (pp. 1-5). IEEE.
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
All papers should be submitted electronically. All submitted manuscripts must be original work that is not under submission at another journal or under consideration for publication in another form, such as a monograph or chapter of a book. Authors of submitted papers are obligated not to submit their paper for publication elsewhere until an editorial decision is rendered on their submission. Further, authors of accepted papers are prohibited from publishing the results in other publications that appear before the paper is published in the Journal unless they receive approval for doing so from the Editor-In-Chief.
IJISAE open access articles are licensed under a Creative Commons Attribution-ShareAlike 4.0 International License. This license lets the audience to give appropriate credit, provide a link to the license, and indicate if changes were made and if they remix, transform, or build upon the material, they must distribute contributions under the same license as the original.