The Transshipment Model


[Page 230 ( continued )]

The Transshipment Model

The transshipment model is an extension of the transportation model in which intermediate transshipment points are added between the sources and destinations. An example of a transshipment point is a distribution center or warehouse located between plants and stores. In a transshipment problem, items may be transported from sources through transshipment points on to destinations, from one source to another, from one transshipment point to another, from one destination to another, or directly from sources to destinations, or some combination of these alternatives.


[Page 231]

The transshipment model includes intermediate points between sources and destinations .


We will expand our wheat shipping example to demonstrate the formulation of a transshipment model. Wheat is harvested at farms in Nebraska and Colorado before being shipped to the three grain elevators in Kansas City, Omaha, and Des Moines, which are now transshipment points. The amount of wheat harvested at each farm is 300 tons. The wheat is then shipped to the mills in Chicago, St. Louis, and Cincinnati. The shipping costs from the grain elevators to the mills remain the same, and the shipping costs from the farms to the grain elevators are as follows :

 

Grain Elevator

Farm

3. K ANSAS C ITY

4. O MAHA

5. D ES M OINES

1. Nebraska

$16

$10

$12

2. Colorado

15

14

17


The basic structure of this model is shown in the graphical network in Figure 6.3.

Figure 6.3. Network of transshipment routes


As with the transportation problem, a linear programming model is developed with supply and demand constraints. The available supply constraints for the farms in Nebraska and Colorado are

x 13 + x 14 + x 15 = 300

x 23 + x 24 + x 25 = 300

The demand constraints at the Chicago, St. Louis, and Cincinnati mills are

x 36 + x 46 + x 56 = 200

x 37 + x 47 + x 57 = 100

x 38 + x 48 + x 58 = 300

Next we must develop constraints for the grain elevators (i.e., transshipment points) at Kansas City, Omaha, and Des Moines. To develop these constraints we follow the principle that at each transshipment point, the amount of grain shipped in must also be shipped out . For example, the amount of grain shipped into Kansas City is


[Page 232]

x 13 + x 23

and the amount shipped out is

x 36 + x 37 + x 38

Thus, because whatever is shipped in must also be shipped out, these two amounts must equal each other:

x 13 + x 23 = x 36 + x 37 + x 38

or

x 13 + x 23 x 36 x 37 x 38 = 0

The transshipment constraints for Omaha and Des Moines are constructed similarly:

x 14 + x 24 x 46 x 47 x 48 = 0

x 15 + x 25 x 56 x 57 x 58 = 0

The complete linear programming model, including the objective function, is summarized as follows:

minimize Z

=

$16 x 13 + 10 x 14 + 12 x 15 + 15 x 23 + 14 x 24 + 17 x 25 + 6 x 36 + 8 x 37 + 10 x 38

   

+ 7 x 46 + 11 x 47 + 11x 48 + 4x 56 + 5 x 57 + 12 x 58

subject to

   
   


Computer Solution with Excel

Because the transshipment model is formulated as a linear programming model, it can be solved with either Excel or QM for Windows. Here we will demonstrate its solution with Excel.

Exhibit 6.10 shows the spreadsheet solution and Exhibit 6.11 the solver for our wheat shipping transshipment example. A network diagram of the optimal solution is shown in Figure 6.4. The spreadsheet is similar to the original spreadsheet for the regular transportation problem in Exhibit 6.1 except that there are two tables of variablesone for shipping from the farms to the grain elevators and one for shipping grain from the elevators to the mills. Thus, the decision variables (i.e., the amounts shipped from sources to destinations) are in cells B6:D7 and C13:E15 . The constraint for the amount of grain shipped from the farm in Nebraska to the three grain elevators (i.e., the supply constraint for Nebraska) in cell F6 is =SUM(B6:D6) , which sums cells B6+C6+D6 . The amount of grain shipped to Kansas City from the farms in cell B8 is =SUM(B6:B7) . Similar constraints are developed for the shipments from the grain elevators to the mills.


[Page 233]
Exhibit 6.10.

Exhibit 6.11.

Two cost arrays have been developed for the shipping costs in cells I6:K7 and cells J13:L15 , which are then multiplied by the variables in cells B6:D7 and C13:E15 and added together. The objective function, =SUMPRODUCT(B6:D7,I6:K7)+SUMPRODUCT(C13:E15,J13:L15) , is shown on the toolbar at the top of Exhibit 6.10. Constructing the objective function with cost arrays like this is a little easier than typing in all the variables and costs in a single objective function when there are a lot of variables and costs.


[Page 234]
Figure 6.4. Transshipment network solution for wheat shipping example