0% found this document useful (0 votes)
166 views4 pages

Transshipment Problem

This document summarizes a transshipment problem involving Widgetco, which manufactures widgets at factories in Memphis and Denver. The Memphis factory can produce up to 150 widgets per day and the Denver factory up to 200 widgets. Widgetco must ship the required 130 widgets per day to customers in Los Angeles and Boston, in order to minimize total shipping costs. The problem can be formulated as a linear program with decision variables for shipments between nodes and constraints for total supply and demand.

Uploaded by

Ghani Rizky
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
166 views4 pages

Transshipment Problem

This document summarizes a transshipment problem involving Widgetco, which manufactures widgets at factories in Memphis and Denver. The Memphis factory can produce up to 150 widgets per day and the Denver factory up to 200 widgets. Widgetco must ship the required 130 widgets per day to customers in Los Angeles and Boston, in order to minimize total shipping costs. The problem can be formulated as a linear program with decision variables for shipments between nodes and constraints for total supply and demand.

Uploaded by

Ghani Rizky
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

18/11/2019

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

Industrial Engineering Department


Institut Teknologi Sepuluh Nopember
Surabaya

Quantitative Modeling & Industrial Policy Analysis (Q-Lab)

68 69

Thomas Industries and Washburn Corporation supply three


firms (Zrox, Hewes, Rockwright) with customized shelving for
its offices. They both order shelving from the same two
manufacturers, Arnold Manufacturers and Supershelf, Inc.

Currently weekly demands by the users are 50 for Zrox, 60


for Hewes, and 40 for Rockwright. Both Arnold and
Supershelf can supply at most 75 units to its customers.

Additional data is shown on the next slide.

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

The cost to install the shelving at the various locations are: 7


3 4
Super Wash-
Zrox Hewes Rockwright 75 Shelf Burn
4 4
Thomas 1 5 8 Rock-
Washburn 3 4 4 Wright 40

72 73

 Linear Programming Formulation  Objective Function Defined


◦ Decision Variables Defined
xij = amount shipped from manufacturer i to supplier j ◦ Minimize Overall Shipping Costs:
xjk = amount shipped from supplier j to customer k Min 5x13 + 8x14 +
where i = 1 (Arnold), 2 (Supershelf) 7x23 + 4x24 +
j = 3 (Thomas), 4 (Washburn) 1x35 + 5x36 + 8x37 +
k = 5 (Zrox), 6 (Hewes), 7 (Rockwright) 3x45 + 4x46 + 4x47

 Note: A common mistake in Formulation is to define the


decision variable as Xijk -- implying that you have 2x2x3 =
12 decisions, when in fact, you only have
(2x2) + (2x3) = 10 decisions.

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

 Formulate This Problem D1 800

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

Widgetco manufactures widgets


at two factories, one in Memphis
and one in Denver. The Memphis
factory can produce as many as
150 widgets per day, and the
Denver factory can produce as
many as 200 widgets per day.
Widgets are shipped by air to
customers in Los Angeles and
Boston. The customers in each city
require 130 widgets per day.
Widgetco wants to minimize the
total cost of shipping the
required widgets to its customers.

Buffer Amount = Total Supply

81 82

You might also like