[email protected] +91 9840521421 Scholarly Open Access, Peer-reviewed, Refereed Journal e-ISSN 2583-5300 Since 2022
  1. Home
  2. Archives
  3. 2026
  4. Vol. 5 Issue 1
  5. Article
Original Article

Solving Transshipment Problems: A Comparative Study of Multiple Approaches

Open Access Peer Reviewed Crossref DOI

Authors

  • Subhadeep Chakrabarti1
  • Raju Prajapati2

1 Amity School of Engineering and Technology, Amity University Jharkhand, Ranchi, Jharkhand, India. 2 Amity Institute of Applied Sciences, Amity University Jharkhand, Ranchi, Jharkhand, India.

Article Information

Published Online
January-April 2026
Pages
506-509
Article Type
Original Article
Check for updates
check update

Abstract

View PDF

Transportation problem could be extended to transshipment problem using the addition of additional transient node(s). This makes the transportation of goods easier between sources to destinations. We study the transshipment problem containing transient nodes between sources and destination nodes. We solve the problem using two existing methods: Vogel’s Approximation Method (VAM) and using a mathematical model. The VAM method is used to find the solution by converting the transshipment problem to a transportation problem. The method is applied in two-steps. While converting the transshipment problem to a transportation problem, we consider some costs as zero or M depending on some goods transport criterion in the specific test example. The problem is then solved using the mathematical model of network flow. The optimal solution found this way is used to compare the solution found using VAM. The paper concludes that VAM, which is applied through multiple stage process is an efficient one on transshipment problem having transient nodes.

APC from ₹1200 + 18% GST

Peer-reviewed open access₹1200 Indian (₹1400 with DOI)$80 USD internationalpaid after acceptance Peer-reviewed open access₹1200 Indian$80 USD international ₹1200 Indian · $80 intl

  • CrossRef DOI
  • ISSN 2583-5300
  • Open Access
  • Peer Reviewed
  • Plagiarism Checked
  • Google Scholar
Contact Us Submit Paper