{
  "id": "transshipment-problem-291829-e27dbc34ea8bf582",
  "slug": "transshipment-problem",
  "title": "Transshipment problem",
  "qid": "Q2478461",
  "lead": "Transshipment problems form a subgroup of transportation problems, where transshipment is allowed. In transshipment, transportation may or must go through intermediate nodes, possibly changing modes of transport. The Transshipment problem has its origins in medieval times when trading started to become a mass phenomenon. Obtaining the minimum-cost route had been the main priority. However, technological development slowly gave priority to minimum-duration transportation problems.",
  "body": "Transshipment problems form a subgroup of transportation problems, where transshipment is allowed. In transshipment, transportation may or must go through intermediate nodes, possibly changing modes of transport. The Transshipment problem has its origins in medieval times when trading started to become a mass phenomenon. Obtaining the minimum-cost route had been the main priority. However, technological development slowly gave priority to minimum-duration transportation problems. The system consists of m origins and n destinations, with the following indexing respectively: i=1,\\ldots, m , j=1,\\ldots, n One uniform good exists which needs to be shipped The required amount of good at the destinations equals the produced quantity available at the origins Transportation simultaneously starts at the origins and is possible from any node to any other (also to an origin and from a destination) Transportation costs are independent of the shipped amount The transshipment problem is a unique Linear Programming Problem (LLP) in that it considers the assumption that all sources and sinks can both receive and distribute shipments at the same time (function in both directions) The goal is to minimize \\sum\\limits_{i=1}^m \\sum\\limits_{j=1}^n t_{i,j} x_{i,j} subject to: x_{r,s}\\geq 0 ; \\forall r=1\\ldots m , s=1\\ldots n \\sum_{s=1}^{m+n}{x_{i,s}}-\\sum_{r=1}^{m+n}{x_{r,i}}=a_i ; \\forall i=1\\ldots m \\sum_{r=1}^{m+n}{x_{r,m+j}}-\\sum_{s=1}^{m+n}{x_{m+j,s}}=b_{m+j} ; \\forall j=1\\ldots n \\sum_{i=1}^{m}{a_i}=\\sum_{j=1}^{n}{b_{m+j}} Since costs are independent from the shipped amount, in each individual problem one can normalize the shipped quantity to 1. The problem now is simplified to an assignment problem from i to m+j. Let x'_{r,s}=1 be 1 if the edge between nodes r and s is used during the optimization, and 0 otherwise. Now the goal is to determine all x'_{r,s} which minimize the objective function: T_{i,m+j}=\\sum_{r=1}^{m+n}\\sum_{s=1}^{m+n}{t_{r,s}\\cdot x'_{r,s}} , such that \\sum_{s=1}^{m+n}{x'_{r,s}}=1 \\sum_{r=1}^{m+n}{x'_{r,s}}=1 x'_{m+j,i}=1 x'_{r,s}=0,1 . x'_{r,r}=1 and x'_{m+j,i}=1 need to be excluded from the model; on the other hand, without the x'_{m+j,i}=1 constraint the optimal path would consist only of x'_{r,r} -type loops which obviously can not be a feasible solution. Instead of x'_{m+j,i}=1 , t_{m+j,i}=-M can be written, where M is an arbitrarily large positive number. With that modification the formulation above is reduced to the form of a standard assignment problem, possible to solve with the Hungarian method. z=max\\left\\{t'_{i,m+j}: x_{i,m+j}>0\\;\\; (i=1\\ldots m,\\; j=1\\ldots n)\\right\\} , such that \\sum_{i=1}^{m}{x_{i,m+j}}=a_i \\sum_{j=1}^{n}{x_{i,m+j}}=b_{m+j} \\sum_{i=1}^{m}{a_i}=\\sum_{j=1}^{n}{b_{m+j}} This problem is easy to be solved with the method developed by Prakash. The set \\left\\{t'_{i,m+j}, i=1\\ldots m,\\; j=1\\ldots n\\right\\} needs to be partitioned into subgroups L_k, k=1\\ldots q , where each L_k contain the t'_{i,m+j} -s with the same value. The sequence L_k is organized as L_1 contains the largest valued t'_{i,m+j} 's L_2 the second largest and so on. Furthermore, M_k positive priority factors are assigned to the subgroups \\sum_{L_k}{x_{i,m+j}} , with the following rule: \\alpha M_k-\\beta M_{k+1}=\\left\\{\\begin{array}{cc}-ve, & if\\; \\alpha 0 \\end{array}\\right. for all \\beta . With this notation the goal is to find all x_{i,m+j} which minimize the goal function z_1=\\sum_{k=1}^{q}{M_k}\\sum_{L_k}{x_{i,m+j}} such that \\sum_{i=1}^{m}{x_{i,m+j}}=a_i \\sum_{j=1}^{n}{x_{i,m+j}}=b_{m+j} \\sum_{i=1}^{m}{a_i}=\\sum_{j=1}^{n}{b_{m+j}} \\alpha M_k-\\beta M_{k+1}=\\left\\{\\begin{array}{cc}-ve, & if\\; \\alpha 0 \\end{array}\\right.",
  "categories": [
    "20156905",
    "20186392",
    "20332070",
    "20476822",
    "22904253",
    "23055629",
    "24043274",
    "24745113"
  ],
  "license": "CC BY-SA 4.0",
  "source_uri": "https://en.wikipedia.org/w/index.php?oldid=1286744185",
  "content_hash": "e27dbc34ea8bf58293097647ebc970c4a99dc8303af7131d6b92e7e868ba620e",
  "created_at": 1792310165.5866876,
  "updated_at": 1745253386.0,
  "claims": [],
  "contradictions": [],
  "confidence": 0.6,
  "csl": {
    "id": "transshipment-problem-291829-e27dbc34ea8bf582",
    "type": "webpage",
    "title": "Transshipment problem",
    "author": [
      {
        "family": "Anticloud FZ LLE",
        "literal": "Anticloud FZ LLE"
      }
    ],
    "container-title": "encyclopegia.org",
    "publisher": "Anticloud FZ LLE",
    "publisher-place": "Dubai, United Arab Emirates",
    "URL": "https://encyclopegia.org/a/transshipment-problem",
    "issued": {
      "date-parts": [
        [
          2026,
          10,
          18
        ]
      ]
    },
    "accessed": {
      "date-parts": [
        [
          2026,
          11,
          17
        ]
      ]
    },
    "license": "CC BY-SA 4.0",
    "DOI": "eo1:transshipment-problem-291829-e27dbc34ea8bf582",
    "isBasedOn": "https://en.wikipedia.org/w/index.php?oldid=1286744185",
    "note": "Immutable snapshot transshipment-problem-291829-e27dbc34ea8bf582, content root e27dbc34ea8bf582…"
  }
}