An extension of the transportation problem where a shipment may pass through an intermediate node before reaching its final destination.
A transshipment problem is solved by converting it into an equivalent transportation problem with a buffer supply and demand added at every node.
Transshipment Point
A node that a shipment may pass through on its way to a final destination.
May be a source or destination handling passthrough shipments, or a dedicated warehouse.
Conversion
Let be the number of pure sources with supply , be the number of pure destinations with demand , be the number of dedicated warehouses with no supply or demand of their own, and be the shipping cost between any 2 nodes. The problem must be balanced, .
Buffer Quantity
Sum of all pure source supplies. .
is added to both supply and demand of each node to calculate the buffer supply and demand.
Adding both buffer supply and buffer demand to the same node lets it hold up to units in transit without a net shipment, which is what makes it act as a transshipment point.
Solution
Build an augmented transportation table over all nodes, treating every node as both a supply row and a demand column.
- Each pure source gets supply (its own supply plus buffer supply) and demand (buffer demand only).
- Each pure destination gets supply (buffer supply only) and demand (its own demand plus buffer demand).
- Each dedicated warehouse gets supply and demand (buffer supply and buffer demand only, no supply or demand of its own).
Let be the quantity shipped from node to node , over all nodes on both sides.
Subject to:
- for every node
- for every node
- for every node , since a node shipping to itself carries no real transfer
Solving the augmented table gives on the diagonal. Discard the diagonal values. The remaining , , are the actual shipment quantities in the original network.