Transshipment Problem
Transshipment Problem
Transshipment
Problem A generalization of the transportation problem which allows shipments from
any source to any destination to first go through intermediate (transient)
transfer points.
Network Representation
68 69
70 71
1
18/11/2019
Network Representation
Because of long standing contracts based on past orders, unit
Zrox 50
costs from the manufacturers to the suppliers are:
Thomas Washburn 5 1
75 Arnold Thomas 5
Arnold 5 8
8 8
Supershelf 7 4
Hewes 60
72 73
74 75
2
18/11/2019
each node of the network with both input and output arcs
Constraints Defined
(T1,T2,D1,D2) acts as both a source and a destination
and is referred to as a transshipment node
Amount Out of Arnold: x13 + x14 < 75
The remaining nodes are either pure supply nodes (P1,
Amount Out of Supershelf: x23 + x24 < 75
P2) or pure demand nodes (D3)
Amount Through Thomas: x13 + x23 - x35 - x36 - x37 = 0
Amount Through Washburn: x14 + x24 - x45 - x46 - x47 = 0
Amount Into Zrox: x35 + x45 = 50
There are:
Amount Into Hewes: x36 + x46 = 60 - 6 sources
Amount Into Rockwright: x37 + x47 = 40 (P1,P2,T1,T2,D1,D2)
- 5 destinations
(T1,T2,D1,D2,D3)
Non-negativity of Variables: xij > 0, for all i and j.
76 77
3 8
1000 P1 T1 5
4 6
7 D2 900
4
2 3
1200 P2 T2
5 9
D3 500
78 79
3
18/11/2019
81 82