Article Sidebar

Submitted
June 30, 2022
Published
February 7, 2022
Download
PDF
Statistic
Read Counter : 89 Download : 232

Downloads

Download data is not yet available.

Main Article Content

Abstract

Purpose of the study: Transportation problem plays an important role in logistics. The present paper introduces the transportation problem along with some of its variants and their mathematical modeling.


Methodology: The mathematical modeling is done for restricted path transportation problem. We have dealt with the transportation problems with specified number of blocked arcs or arcs with limited allowance through them. We have applied the same on some test problems chosen arbitrarily. The application is also extended on the transportation problems with some additional source-destination related restrictions.


Main Findings: The optimal cost of constrained transportation problems under the study is obtained.


Applications of this study: The process could be integrated on a larger scale in logistics.


Novelty/Originality of this study: The study is done for special types of transportation problems having specific number of blocked arcs or arcs with limited allowance through them. Some more source-destination related constrained are also dealt in this paper.

Keywords

Transportation Problem Transshipment Problem Constrained Transportation Constrained Optimization Linear Programming

Article Details

License

Authors retain the copyright without restrictions for their published content in this journal. IJSRTM is a SHERPA ROMEO Journal. 

Publishing License

This is an open-access article distributed under the terms of  Creative Commons License

 

How to Cite
Prajapati, R., Pal, J., & Dubey, O. P. (2022). Transportation problem with restriction on arcs and their Solution by mathematical modeling. International Journal of Students’ Research in Technology & Management, 10(1), 67–75. https://doi.org/10.18510/ijsrtm.2022.1015
Download Citation
Endnote/Zotero/Mendeley (RIS)
BibTeX
Crossref
Scopus
Google Scholar
Europe PMC

References

  1. Adlakha, V., Kowalski, K. (2003). A simple heuristic for solving small fixed-charge transportation problems. Omega, 31(3), 205-211. https://doi.org/10.1016/S0305-0483(03)00025-2 DOI: https://doi.org/10.1016/S0305-0483(03)00025-2
  2. Arya, N.V. (2016). Lexicographic Approach For Quadratic Transportation Problem With Additional Restriction.
  3. Arya, N.V., Singh, P. (2018). An algorithm for solving cost time trade-off pair in quadratic fractional transportation problem with impurity restriction. International Research Journal of Engineering and Technology (IRJET), 5(4), 4274-4280.
  4. Barr, R., Elam, J., Glover, F. and Klingman, D. (1980). A network augmenting path basis algorithm for transshipment problems. In Extremal methods and systems analysis pp. 250-274. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-46414-0_12 DOI: https://doi.org/10.1007/978-3-642-46414-0_12
  5. Brouer, B.D., Desaulniers, G., Karsten, C.V. and Pisinger, D. (2015). A matheuristic for the liner shipping network design problem with transit time restrictions. In International Conference on Computational Logistics pp. 195-208. Springer, Cham. https://doi.org/10.1007/978-3-319-24264-4_14 DOI: https://doi.org/10.1007/978-3-319-24264-4_14
  6. Dantzig, G. (2016). Linear programming and extensions. Princeton university press.
  7. Deep, K., Dubey, O.P. and Nagar, A. (2012). Incorporating genetic algorithms in transport management, Proceedings of the International Conference on Soft Computing for Problem Solving (SocProS-2011), Advances in Intelligent and Soft Computing (AISC), Springer, India, (Vol.130 & 131), pp. 177-192. https://doi.org/10.1007/978-81-322-0487-9_18 DOI: https://doi.org/10.1007/978-81-322-0487-9_18
  8. Dubey, O.P., Deep, K. and Nagar, A., (2014). Goal programming approach to trans-shipment problem, B. V. Babu et.al. (Eds.): Proceedings of the Second International Conference on Soft Computing for Problem Solving (SocProS-2012), Advances in Intelligent and Soft Computing (AISC), Springer, India, Vol. (236), pp. 337-343. https://doi.org/10.1007/978-81-322-1602-5_37 DOI: https://doi.org/10.1007/978-81-322-1602-5_37
  9. Dubey, O.P., Singh, M. K., Dwivedi, R. K. and Singh, S. N. (2011). Interactive decisions for transport management: applications in the coal transportation sector, IUP Journal of Operations Management, Hyderabad, India, 10(2), 7-21.
  10. Dwivedi, R. K., Mehta, N. N. and Dubey, O. P. (2009). Interactive decision making in prioritized unbalance transportation problems, IUP Journal of Operations Management, Hyderabad, India, 8( 1), 67-76.
  11. Ficker, A.M., Spieksma, F.C. and Woeginger, G.J. (2018). The transportation problem with conflicts. Annals of Operations Research, 1-21. https://doi.org/10.2139/ssrn.3082778 DOI: https://doi.org/10.2139/ssrn.3082778
  12. Gupta, K. and Arora, S.R. (2012). An algorithm to find optimum cost time trade off pairs in a fractional capacitated transportation problem with restricted flow. International Journal of Research in Social Sciences, 2(2), 418-436.
  13. Gupta, K. and Arora, S.R. (2013). Linear plus linear fractional capacitated transportation problem with restricted flow. American Journal of Operations Research, 3(6), 581. https://doi.org/10.4236/ajor.2013.36055 DOI: https://doi.org/10.4236/ajor.2013.36055
  14. Iri, M. (1960). A new method of solving transportation-network problems. Journal of the Operations Research Society of Japan, 3(1), 2.
  15. Joo, C.M. and Kim, B.S. (2014). Block transportation scheduling under delivery restriction in shipyard using meta-heuristic algorithms. Expert systems with applications, 41(6), 2851-2858. https://doi.org/10.1016/j. eswa.2013.10.020 DOI: https://doi.org/10.1016/j.eswa.2013.10.020
  16. Kaur, P., Verma, V. and Dahiya, K. (2017). Capacitated two-stage time minimization transportation problem with restricted flow. RAIRO-Operations Research, 51(2), 447-467. https://doi.org/10.1051/ro/2016033 DOI: https://doi.org/10.1051/ro/2016033
  17. Khurana, A. (2015). Variants of transshipment problem. European Transport Research Review, 7(2), 1-19. https://doi.org/10.1007/s12544-015-0154-8 DOI: https://doi.org/10.1007/s12544-015-0154-8
  18. Lee, S.M. and Moore, L.J. (1973). Optimizing transportation problems with multiple objectives. AIIE transactions, 5(4), 333-338. https://doi.org/10.1080/05695557308974920 DOI: https://doi.org/10.1080/05695557308974920
  19. Long, J., Gao, Z., Zhang, H. and Szeto, W.Y. (2010). A turning restriction design problem in urban road networks. European Journal of Operational Research, 206(3), 569-578. https://doi.org/10.1016/j.ejor .2010.03.013 DOI: https://doi.org/10.1016/j.ejor.2010.03.013
  20. Misra, S., Das, C. (1981). Three-dimensional transportation problem with capacity restriction.
  21. Moon, I.K. and Cha, B.C. (2006). The joint replenishment problem with resource restriction. European Journal of Operational Research, 173(1), 190-198. https://doi.org/10.1016/j.ejor.2004.11.020 DOI: https://doi.org/10.1016/j.ejor.2004.11.020
  22. Mu, H.B., Yu, J.N. and Liu, L.Z. (2009). December. Shortest path algorithm for road network with traffic restriction. In 2009 2nd International Conference on Power Electronics and Intelligent Transportation System (PEITS) (Vol. 2,) pp. 381-384. IEEE. https://doi.org/10.1109/PEITS.2009.5406759 DOI: https://doi.org/10.1109/PEITS.2009.5406759
  23. Prajapati, R., Dubey, O.P., & Pradhan, R. (2020). Transshipment problem using a minimum spanning tree approach. International Journal of Students’ Research in Technology & Management, 8(3), 09-13. https://doi.org/10.18510/ijsrtm.2020.832 DOI: https://doi.org/10.18510/ijsrtm.2020.832
  24. Proll, L.G., (1973). A note on the transportation problem and its variants. Operational Research Quarterly, 24(4), 633-635. https://doi.org/10.1057/jors.1973.117 DOI: https://doi.org/10.1057/jors.1973.117
  25. Rachev, S.T., Rüschendorf, L. (1998). Mass Transportation Problems: Volume I: Theory (Vol. 1). Springer Science & Business Media.
  26. Rachev, S.T., Rüschendorf, L. (2006). Mass Transportation Problems: Applications. Springer Science & Business Media.
  27. Rais, A., Alvelos, F. and Carvalho, M.S. (2014). New mixed integer-programming model for the pickup-and-delivery problem with transshipment. European Journal of Operational Research, 235(3), 530-539. https://doi.org/10.1016/j.ejor.2013.10.038 DOI: https://doi.org/10.1016/j.ejor.2013.10.038
  28. Singh, P. and Saxena, P.K. (1998). Total shipping cost/completion-date trade-off in transportation problem with additional restriction. Journal of Interdisciplinary Mathematics, 1(2-3), 161-174. https://doi.org/10.1080/0972050 2.1998.10700251 DOI: https://doi.org/10.1080/09720502.1998.10700251
  29. Staniec, C.J. (1987). Solving the multicommodity transshipment problem. Naval postgraduate school monterey CA. https://doi.org/10.21236/ADA199164 DOI: https://doi.org/10.21236/ADA199164
  30. Vancroonenburg, W., Della Croce, F., Goossens, D. and Spieksma, F.C. (2014). The red–blue transportation problem. European Journal of Operational Research, 237(3), 814-823. https://doi.org/10.1016/j.ejor.2014.02.055 DOI: https://doi.org/10.1016/j.ejor.2014.02.055

Most read articles by the same author(s)

1 2 > >>