Transportation Algorithm

Nova Sepadyati,M.Sc
 Basic Steps

Determine the entering Determine the leaving

Determine a starting variable from among all the nonbasic variable from among all the
basic feasible variables (same as simplex) current basic variables (same as
If the optimality condition is simplex), and find the new basic
solution satisfied, stop. Otherwise, go to step 3. solution. Return to step 2.
Outline

1. Determination of Starting Solution

2. Iterative Computations using Method of Multipliers
3. Iterative Computations using Method of Stepping Stone
Determination of
Starting Solution (it.0)
Transportation Model Starting Solution

 General transportation model with m sources and n destinations

 Number of Basic Variables : m +n -1
 Three methods to make iteration 0:

3.Vogel
1.Northwest- 2.Least-cost
approximation
corner method method
method
 1. Northwest-corner method

 Step 1. Allocate as much as possible to the selected cell, and adjust the associated amounts of supply and
demand by subtracting the allocated amount.
 Step 2. Cross out the row or column with zero supply or demand to indicate that no further assignments
can be made in that row or column. If both a row and a column net to zero simultaneously, cross out
one only, and leave a zero supply (demand) in the uncrossed-out row (column).
 Step 3. If exactly one row or column is left uncrossed out, stop. Otherwise, move to the cell to the right
if a column has just been crossed out or below if a row has been crossed out. Go to step 1.
An example

Total Supply
10 0 20 11 15
start!
12 7 9 20 25

0 14 16 18 5

Total 5 15 15 10
Demand
 Basic Variables :
  X11 = 5
X12 = 10
X23 = 15
X24 = 5
X34 = 5

All empty boxes are non-

basic variables!

Z= =
(5x10)+(10x0)+(5x7)+(15x9)
+(5x20)+5x18)
=$410
2.Least-cost Method

 The least-cost method finds a better starting solution by targeting the cheapest routes. It assigns as
much as possible to the cell with the smallest unit cost (ties are broken arbitrarily).
 the satisfied row or column is crossed out and the amounts of supply and demand are adjusted
accordingly. If both a row and a column are satisfied simultaneously, only one is crossed out,
the same as in the northwest-corner method.
 select the uncrossed-out cell with the smallest unit cost and repeat the process until exactly one row
or column is left uncrossed out.
Contoh soal Total Supply
10 0 20 11 15
start!
12 7 9 20 25

0 14 16 18 5
start!
Total 5 15 15 10
Demand
2. Vogel approximation method (VaM)

 VAM is an improved version of the least-cost method that generally, but not always, produces better
starting solutions.
 Step 1. For each row (column), determine a penalty measure by subtracting the smallest unit cost in
the row (column) from the next smallest unit cost in the same row (column). This penalty is actually
a measure of lost opportunity one forgoes if the smallest unit cost cell is not chosen.
 Step 2. Identify the row or column with the largest penalty, breaking ties arbitrarily. Allocate as
much as possible to the variable with the least unit cost in the selected row or column. Adjust the
supply and demand, and cross out the satisfied row or column. If a row and a column are satisfied
simultaneously, only one of the two is crossed out, and the remaining row (column) is assigned zero
supply (demand).
2. Vogel approximation method (VaM)

 Step 3.

(a) If exactly one row or column with zero supply or demand remains uncrossed out, stop.

(b) If one row (column) with positive supply (demand) remains uncrossed out, determine the basic
variables in the row (column) by the least-cost method. Stop.

(c) If all the uncrossed-out rows and columns have (remaining) zero supply and demand, determine
the zero basic variables by the least-cost method. Stop.

(d) Otherwise, go to step 1.

 Total Supply Penalty
10 0 20 11 15 10

12 7 9 20 25 2

The lowest
cost in row
0 14 16 18 5 14
chosen

Total 5 15 15 10
Row with
Demand the
Penalty 10 7 7 7 highest
penalty
Exercise

Total Supply
0 2 1 6

2 1 5 9

2 4 3 5

Total Demand 5 5 10

Compute Starting Solution from the case using 3 methods –and compare the Z value!
Multipliers
Computations
 Remember Basic Steps

Determine the entering Determine the leaving

Determine a starting variable from among all the nonbasic variable from among all the
basic feasible variables (same as simplex) current basic variables (same as
If the optimality condition is simplex), and find the new basic
solution satisfied, stop. Otherwise, go to step 3. solution. Return to step 2.
Method of Multipliers

 we associate the multipliers ui and vj with row i and column j of the

transportation tableau.
 For each current basic variable xij, satisfy the following equations:
ui + vj = cij, for each basic xij
 Next, we use ui and vj to evaluate the nonbasic variables by computing
ui + vj - cij, for each nonbasic xij
 Determine Entering Variable

ui + vj - cij,
for each
Initial Z: 520 nonbasic xij

ui + vj = cij, for each basic xij

Number of equations : 6, number of

variables= i + j = 3+4 =7  need to
assume 1 variable, usually u1 =0

Z min entering is the most + value of nonbasic variable!

Exercise

Total Supply
0 2 1 6

2 1 5 9

2 4 3 5

Total Demand 5 5 10

From the previous NW result , determine the entering variable!

Determine leaving variable

 First, construct a closed loop that starts and ends at the entering variable cell.
 The loop consists of connected horizontal and vertical segments only (no
diagonals are allowed) whose corner elements (excluding the entering
variable cell) must coincide with a current basic variable.
 subtracting and adding the amount Ѳ at the successive corners of the loop in
turn, stating + Ѳ in the beginning of the loop
 Do this looping until all non-basic variables are negative
 No need to visit every Basic Variable
Determine the leaving variable !

  determine
To
 Remember that
all basic variables
needs to be ≥0

Entering
variable   =?
Leaving variable: between x11 or x22! If x11 chosed
If we pick leaving variable :x11

10 2 20 11
15
12 7 9 20
0 15 10
4 14 16 18
5 5

Iteration 1 : Z = 475
Already optimum /not? Recalculate ui & vj !
 Entering
variable!

leaving :x24
leaving :x24;

Iterasi 3 : Z = 435

Already optimum /not? Recalculate ui & vj !

 Exercise

Total Supply
0 2 1 6

2 1 5 9

2 4 3 5

Total Demand 5 5 10
From the previous NW result , continue determine the entering
variable! Continue until 2 iteration!
Stepping Stone
Computations
 2. Method of
Stepping Stone

Step 1.
Create loop for every Non Basic Variable, then decide + Ѳ and – Ѳ in turn
Step 2.
Calculate the sum of Cpq from each loop (using +/- according to Ѳ ) ---The most
negative value is the entering variable
Step 3.
Determine the minimum Ѳ to decide the leaving variable
Repeat the steps until all Cpq are +
 Total Supply
-1 8 +1 5 +1 6 120
-1 Draw a loop for each non basic
120
15 10 +1 12 80 variable, and calculate the Cpq!
+1-1
-1
30-1+1+1 50 -1 C12 = 5 – 10 + 15 – 8 = +2
3 9 10 80 C13 = 6 – 10 + 9 – 10 + 15 - 8 = +2
+1 -1
+1 20 -1+1 60 -1 C23 = 12 – 10 + 9 – 10 = +1
Total Demand 150 70 60 C31 = 3 – 15 + 10 – 9 = -11

Choose entering variable from the most negative Cpq! C31 chosen

Leaving? X31 minimum = (X21, X32) = min (30, 20) = 20

Entering variable:X31 ; Leaving X32

X31 minimum = (X21, X32) = min (30, 20) = 20

Iteration 2. Entering variable :X23, leaving X21
Iteration 3- Entering variable :X13, leaving X33
Last exercise --Solve the problem using Stepping stone!

Total
Supply
0 2 1 6
5 1
2 1 5 9
4 5
2 4 3 5
5
Total
5 5 10
Demand