# Transportation, Assignment and Transshipment Problems

1
.

Description
A transportation problem basically deals with the problem, which aims to find the best way to fulfill the demand of n demand points using the capacities of m supply points. While trying to find the best way, generally a variable cost of shipping the product from one supply point to a demand point or a similar constraint should be taken into consideration.

2
.

Formulating Transportation Problems
Example 1: Powerco has three electric power plants that supply the electric needs of four cities. The associated supply of each plant and demand of each city is given in the table 1. The cost of sending 1 million kwh of electricity from a plant to a city depends on the distance the electricity must travel.
.

Transportation table
A transportation problem is specified by the supply, the demand, and the shipping costs. So the relevant data can be summarized in a transportation tableau. The transportation tableau implicitly expresses the supply and demand constraints and the shipping cost between each demand and supply point.

4
.

Shipping costs, Supply, and Demand for Power co Example
From City 1 City 2 Plant 1 Plant 2 Plant 3 Demand (Million kwh)
5
.

To City 3 City 4 \$10 \$13 \$16 30 \$9 \$7 \$5 30 Supply (Million kwh) 35 50 40

\$8 \$9 \$14 45

\$6 \$12 \$9 20

Transportation Table

Solution
1.

Decision Variable:

Since we have to determine how much electricity is sent from each plant to each city; Xij = Amount of electricity produced at plant i and sent to city j X14 = Amount of electricity produced at plant 1 and sent to city 4
6
.

Objective function
Since we want to minimize the total cost of shipping from plants to cities; Minimize Z = 8X11+6X12+10X13+9X14 +9X21+12X22+13X23+7X24 +14X31+9X32+16X33+5X34

7
.

Supply Constraints
Since each supply point has a limited production capacity; X11+X12+X13+X14 <= 35 X21+X22+X23+X24 <= 50 X31+X32+X33+X34 <= 40

8
.

. Demand Constraints
Since each supply point has a limited production capacity; X11+X21+X31 >= 45 X12+X22+X32 >= 20 X13+X23+X33 >= 30 X14+X24+X34 >= 30

9
.

5. Sign Constraints
Since a negative amount of electricity can not be shipped all Xij·s must be non negative; Xij >= 0 (i= 1,2,3; j= 1,2,3,4)

10
.

LP Formulation of Powerco·s Problem
Min Z = 8X11+6X12+10X13+9X14+9X21+12X22+13X23+7X24 +14X31+9X32+16X33+5X34 S.T.: X11+X12+X13+X14 <= 35 X21+X22+X23+X24 <= 50 X31+X32+X33+X34 <= 40 X11+X21+X31 >= 45 Constraints) X12+X22+X32 >= 20 X13+X23+X33 >= 30 X14+X24+X34 >= 30 Xij >= 0 (i= 1,2,3; j= 1,2,3,4)
.

(Supply Constraints)

(Demand

11

General Description of a Transportation Problem
1.

2.

3.

A set of m supply points from which a good is shipped. Supply point i can supply at most si units. A set of n demand points to which the good is shipped. Demand point j must receive at least di units of the shipped good. Each unit produced at supply point i and shipped to demand point j incurs a variable cost of cij.
.

12

Xij = number of units shipped from supply point i to demand point j
i!m j !n

min §§ cijXij
i !1 j !1 j !n

s.t.§ Xij e si (i ! 1,2,..., m)
j !1 i !m

§X
i !1

ij

u dj ( j ! 1,2,..., n)

Xij u 0(i ! 1,2,..., m; j ! 1,2,..., n)

13
.

Balanced Transportation Problem
If Total supply equals to total demand, the problem is said to be a balanced transportation problem:

i! i i !1

j !n j

§s ! §d
j !1
14
.

Balancing a TP if total supply exceeds total demand
If total supply exceeds total demand, we can balance the problem by adding dummy demand point. Since shipments to the dummy demand point are not real, they are assigned a cost of zero.

15
.

Balancing a transportation problem if total supply is less than total demand
If a transportation problem has a total supply that is strictly less than total demand the problem has no feasible solution.There is no doubt that in such a case one or more of the demand will be left unmet. Generally in such situations a penalty cost is often associated with unmet demand and as one can guess this time the total penalty cost is desired to be minimum
16
.

Finding Basic Feasible Solution for TP
Unlike other Linear Programming problems, a balanced TP with m supply points and n demand points is easier to solve, although it has m + n equality constraints.The reason for that is, if a set of decision variables (xij·s) satisfy all but one constraint, the values for xij·s will satisfy that remaining constraint automatically.
17
.

Methods to find the bfs for a balanced TP
There are three basic methods:
1.

Northwest Corner Method Minimum Cost Method Vogel·s Method

2.

3.

18
.

Northwest Corner Method
To find the bfs by the NWC method: Begin in the upper left (northwest) corner of the transportation tableau and set x11 as large as possible (here the limitations for setting x11 to a larger number, will be the demand of demand point 1 and the supply of supply point 1.Your x11 value can not be greater than minimum of this 2 values).

19
.

According to the explanations in the previous slide we can set x11=3 (meaning demand of demand point 1 is satisfied by supply point 1).
5

6

2 3 3 5 2 3 2

6

2 X 5
.

2

3

20

After we check the east and south cells, we saw that we can go east (meaning supply point 1 still has capacity to fulfill some demand).
3 2 X

6

2 X 3 3 2 2 3 X

3

3

2 X X
.

2

3

21

After applying the same procedure, we saw that we can go south this time (meaning demand point 2 needs more supply by supply point 2).
3 2 X

3

2

1

2 X 3 X 2 X 3 X

3

2

1

X

2

22

X
.

X

X

2

Finally, we will have the following bfs, which is: x11=3, x12=2, x22=3, x23=2, x24=1, x34=2

3

2

3

2

1

2

23
.

Minimum Cost Method
The Northwest Corner Method dos not utilize shipping costs. It can yield an initial bfs easily but the total shipping cost may be very high. The minimum cost method uses shipping costs in order come up with a bfs that has a lower cost. To begin the minimum cost method, first we find the decision variable with the smallest shipping cost (Xij). Then assign Xij its largest possible value, which is the minimum of si and dj

24
.

After that, as in the Northwest Corner Method we should cross out row i and column j and reduce the supply or demand of the noncrossed-out row or column by the value of Xij. Then we will choose the cell with the minimum cost of shipping from the cells that do not lie in a crossed-out row or column and we will repeat the procedure.

25
.

An example for Minimum Cost Method Step 1: Select the cell with minimum cost.

2

3

5

6 5

2

1

3

5 10

3

8

4

6 15

12

8

4

6

26
.

Step 2: Cross-out column 2 Cross-

2

3

5

6 5

2 8 3

1

3

5 2

8

4

6 15

12
27

X

4

6

.

Step 3: Find the new cell with minimum shipping cost and cross-out row 2 cross-

2

3

5

6 5

2 2 3 8

1

3

5

8

4

6 15

10
28

X

4

6

.

Step 4: Find the new cell with minimum shipping cost and cross-out row 1 cross-

2 5 2 2 3 8

3

5

6 X

1

3

5 X

8

4

6 15

5
29

X

4

6

.

Step 5: Find the new cell with minimum shipping cost and cross-out column 1 cross-

2 5 2 2 3 5 X
30

3

5

6 X

1 8 8

3

5 X

4

6 10

X

4

6

.

Step 6: Find the new cell with minimum shipping cost and cross-out column 3 cross-

2 5 2 2 3 5 X
31

3

5

6 X

1 8 8 4 X X

3

5 X

4

6 6

6

.

Step 7: Finally assign 6 to last cell. The bfs is found as: X11=5, X21=2, X22=8, X31=5, X33=4 and X34=6

2 5 2 2 3 5 X
32

3

5

6 X

1 8 8 4 X X

3

5 X

4 6 X

6 X

.

Vogel·s Method
Begin with computing each row and column a penalty.The penalty will be equal to the difference between the two smallest shipping costs in the row or column. Identify the row or column with the largest penalty. Find the first basic variable which has the smallest shipping cost in that row or column. Then assign the highest possible value to that variable, and cross-out the row or column as in the previous methods. Compute new penalties and use the same procedure.
33
.

An example for Vogel·s Method Step 1: Compute the penalties.

Supply 6 7 8 10 15 80 78 15 Demand Column Penalty 15 15-6=9 5 80-7=73 5 78-8=70

Row Penalty 7-6=1

78-15=63

34
.

Step 2: Identify the largest penalty and assign the highest possible value to the variable.

Supply 6 5 15 80 78 15 Demand Column Penalty 15 15-6=9 X _ 5 78-8=70 7 8 5

Row Penalty 8-6=2

78-15=63

35
.

Step 3: Identify the largest penalty and assign the highest possible value to the variable.

Supply 6 5 15 80 7 5 78 15 Demand Column Penalty 15 15-6=9 X _ X _ 8 0

Row Penalty _

_

36
.

Step 4: Identify the largest penalty and assign the highest possible value to the variable.

Supply 6 0 15 5 80 7 5 78 15 Demand Column Penalty 15 _ X _ X _ 8 X

Row Penalty _

_

37
.

Step 5: Finally the bfs is found as X11=0, X12=5, X13=5, and X21=15

Supply 6 0 15 15 Demand Column Penalty X _ X _ X _ 5 80 7 5 78 X 8 X

Row Penalty _

_

38
.

The Transportation Simplex Method
In this section we will explain how the simplex algorithm is used to solve a transportation problem.

39
.

How to Pivot a Transportation Problem
Based on the transportation tableau, the following steps should be performed. Step 1. Determine (by a criterion to be developed shortly, for example northwest corner method) the variable that should enter the basis. Step 2. Find the loop (it can be shown that there is only one loop) involving the entering variable and some of the basic variables. Step 3. Counting the cells in the loop, label them as even cells or odd cells.
40
.

Step 4. Find the odd cells whose variable assumes the smallest value. Call this value . The variable corresponding to this odd cell will leave the basis. To perform the pivot, decrease the value of each odd cell by and increase the value of each even cell by . The variables that are not in the loop remain unchanged.The pivot is now complete. If =0, the entering variable will equal 0, and an odd variable that has a current value of 0 will leave the basis. In this case a degenerate bfs existed before and will result after the pivot. If more than one odd cell in the loop equals , you may arbitrarily choose one of these odd cells to leave the basis; again a degenerate bfs will result
41
.

Assignment Problems
Example: Machine has four jobs to be completed. Each machine must be assigned to complete one job. The time required to setup each machine for completing each job is shown in the table below. Machine wants to minimize the total setup time needed to complete the four jobs.

42
.

Setup times (Also called the cost matrix)
Time (Hours) Job1 Machine 1 Machine 2 Machine 3 Machine 4 14 2 7 2 Job2 5 12 8 4 Job3 8 6 3 6 Job4 7 5 9 10

43
.

The Model
According to the setup table Machinco·s problem can be formulated as follows (for i,j=1,2,3,4):
min Z ! 14 X 11  5 X 12  8 X 13  7 X 14  2 X 21  12 X 22  6 X 23  5 X 24  7 X 31  8 X 32  3 X 33  9 X 34  2 X 41  X 42  6 X 43  10 X 44 s.t. X 11  X 12  X 13  X 14 ! 1 X 21  X 22  X 23  X 24 ! 1 X 31  X 32  X 33  X 34 ! 1 X 41  X 42  X 43  X 44 ! 1 X 11  X 21  X 31  X 41 ! 1 X 12  X 22  X 32  X 42 ! 1 X 13  X 23  X 33  X 43 ! 1 X 14  X 24  X 34  X 44 ! 1
44

Xij ! 0orXij ! 1
.

For the model on the previous page note that: Xij=1 if machine i is assigned to meet the demands of job j Xij=0 if machine i is not assigned to meet the demands of job j In general an assignment problem is balanced transportation problem in which all supplies and demands are equal to 1.
45
.

The Assignment Problem
In general the LP formulation is given as
n n ij

§§ c Minimize
i !1 j !1 n

xij
Each supply is 1

§x
j !1 n i !1

ij

! 1, i ! 1,K , n

§ xij ! 1, j ! 1,K , n
46

Each demand is 1

xij ! 0 or 1, ij
.

y

The Air Force has used this for assigning thousands of people to jobs. This is a classical problem. Research on the assignment problem predates research on LPs. Very efficient special purpose solution techniques exist.
10 years ago,Yusin Lee and J. Orlin solved a problem with 2 million nodes and 40 million arcs in ½ hour.

y

y

47
.

Although the transportation simplex appears to be very efficient, there is a certain class of transportation problems, called assignment problems, for which the transportation simplex is often very inefficient. For that reason there is an other method called The Hungarian Method.The steps of The Hungarian Method are as listed below: Step1. Find a bfs. Find the minimum element in each row of the mxm cost matrix. Construct a new matrix by subtracting from each cost the minimum cost in its row. For this new matrix, find the minimum cost in each column. Construct a new matrix (reduced cost matrix) by subtracting from each cost the minimum cost in its column.
48
.

Step2. Draw the minimum number of lines (horizontal and/or vertical) that are needed to cover all zeros in the reduced cost matrix. If m lines are required , an optimal solution is available among the covered zeros in the matrix. If fewer than m lines are required, proceed to step 3. Step3. Find the smallest nonzero element (call its value k) in the reduced cost matrix that is uncovered by the lines drawn in step 2. Now subtract k from each uncovered element of the reduced cost matrix and add k to each element that is covered by two lines. Return to step2.
.

49

A transportation problem allows only shipments that go directly from supply points to demand points. In many situations, shipments are allowed between supply points or between demand points. Sometimes there may also be points (called transshipment points) through which goods can be transshipped on their journey from a supply point to a demand point. Fortunately, the optimal solution to a transshipment problem can be found by solving a transportation problem.
50
.

Transshipment Problems

Transshipment Problem
y

An extension of a transportation problem
More general than the transportation problem in that in this problem there are intermediate ´transshipment pointsµ. In addition, shipments may be allowed between supply points and/or between demand points

y

LP Formulation
Supply point: it can send goods to another point but cannot receive goods from any other point Demand point It can receive goods from other points but cannot send goods to any other point Transshipment point: It can both receive goods from other points send goods to other points

51
.

52

The following steps describe how the optimal solution to a transshipment problem can be found by solving a transportation problem. Step1. If necessary, add a dummy demand point (with a supply of 0 and a demand equal to the problem·s excess supply) to balance the problem. Shipments to the dummy and from a point to itself will be zero. Let s= total available supply. Step2. Construct a transportation tableau as follows: A row in the tableau will be needed for each supply point and transshipment point, and a column will be needed for each demand point and transshipment point.
.

Each supply point will have a supply equal to it·s original supply, and each demand point will have a demand to its original demand. Let s= total available supply.Then each transshipment point will have a supply equal to (point·s original supply)+s and a demand equal to (point·s original demand)+s. This ensures that any transshipment point that is a net supplier will have a net outflow equal to point·s original supply and a net demander will have a net inflow equal to point·s original demand. Although we don·t know how much will be shipped through each transshipment point, we can be sure that the total amount will not exceed s.
53
.

Transshipment Example
y

Example 5: Widgetco manufactures widgets at two factories, one in Memphis and one in Denver.The Memphis factory can produce as 150 widgets, and the Denver factory can produce as many as 200 widgets per day. Widgets are shipped by air to customers in LA and Boston. The customers in each city require 130 widgets per day. Because of the deregulation of airfares, Widgetco believes that it may be cheaper first fly some widgets to NY or Chicago and then fly them to their final destinations.The cost of flying a widget are shown next. Widgetco wants to minimize the total cost of shipping the required widgets to customers.

54
.

Transportation Table Associated with the Transshipment Example
y
y y y y y y y y y

NY Chicago LA

Boston Dummy Supply

Memphis \$8 \$13 \$25 \$28 \$0 150 Denver \$15 \$12 \$26 \$25 \$0 200 NY \$0 \$6 \$16 \$17 \$0 350 Chicago \$6 \$0 \$14 \$16 \$0 350 Demand 350 350 130 130 90 Supply points: Memphis, Denver Demand Points: LA Boston Transshipment Points: NY, Chicago The problem can be solved using the transportation simplex method

55
.

Limitations of Transportation Problem
y

One commodity ONLY: any one product supplied and demanded at multiple locations
Merchandise Electricity, water

y

Invalid for multiple commodities: (UNLESS transporting any one of the multiple commodities is completely independent of transporting any other commodity and hence can be treated by itself alone)
Example: transporting product 1 and product 2 from the supply points to the demand points where the total amount (of the two products) transported on a link is subject to a capacity constraint Example: where economy of scale can be achieved by transporting the two products on the same link at a larger total volume and at a lower unit cost of transportation .

56

Limitations of Transportation Problem
Difficult to generalize the technique to accommodate (these are generic difficulty for ´mathematical programming,µ including linear and non-linear programming
x Economy of scale the per-unit cost of transportation on a link decreasing with the volume (nonlinear and concave; there is a trick to convert a ´non-linear program with a piecewise linear but convex objective function to a linear program; no such tricks exists for a piecewise linear but concave objective function) x Fixed-cost: transportation usually involves fixed charges. For example, the cost of truck rental (or cost of trucking in general) consists of a fixed charge that is independent of the mileage and a mileage charge that is proportional to the total mileage driven. Such fixed charges render the objective function NON-LINEAR and CONCAVE and make the problem much more difficult to solve

57
.

Presented by
y Sumit

jha y Future innoversity

58
.