Transportation Model

The wide applicability of linear programming has been greatly emphasized. We will
continue broaden our horizons in this lab report by discussing two particularly
important (and related) types of linear programming problems. One type, called the
Transportation problem, received this name because many of its applications
involve determining how to optimally transport goods. However, some of its important
applications (e.g., production scheduling, employment scheduling, personnel
assignment) actually have nothing to do with transportation.
The second type, called the Assignment problem, involves such applications
as assigning people to tasks. Although its applications appear to be quite different
from those for the transportation problem, we shall see that the assignment problem
can be viewed as a special type of transportation problem.
In the next lab report we will introduce additional special types of linear
programming problems involving networks, including the Minimum cost flow
problem. There we shall see that both the transportation and assignment problems
actually are special cases of the minimum cost flow problem.
Applications of the transportation and assignment problems tend to require a
very large number of constraints and variables, so a straightforward computer
application of the simplex method may require an exorbitant computational effort.
Fortunately, a key characteristic of these problems is that most of the aij coefficients
in the constraints are zeros, and the relatively few nonzero coefficients appear in a
distinctive pattern. As a result, it has been possible to develop special streamlined
algorithms that achieve dramatic computational savings by exploiting this special
structure of the problem. Therefore, it is important to become sufficiently familiar with
these special types of problems that we can recognize them when they arise and
apply the proper computational procedure.

DEFINATION OF TRANSPORTATION MODEL

The general transportation problem is concerned (literally or figuratively) with

distributing any commodity from any group of supply centers, called sources, to any
group of receiving centers, called destinations, in such a way as to minimize the
total distribution cost. The specific nodes represent the sources and the destinations
in the network of the model. There are three methods by which we can solve any
transportation problems;
1. North West Corner Method
2. Least Cost Method
3. Vogel’s Approximation Method (VAM)

THE TRANSPORTATION ALGORITHM MODEL

The model for a transportation problem makes the following assumption about these
supplies and demands.
 ● The requirements assumption: Each source has a fixed supply of units,
where this entire supply must be distributed to the destinations. (We let si
denote the number of units being supplied by source i, for i = 1, 2 ... m.)
Similarly, each destination has a fixed demand for units, where this entire
demand must be received from the sources. (We let dj denote the number of
units being received by destination j, for j= 1, 2 ... n.)
This assumption that there is no leeway in the amounts to be sent or received
means that there needs to be a balance between the total supply from all
sources and the total demand at all destinations.
● The feasible solutions property: A transportation problem will have feasible
solutions if and only if the total demand equals the total supply. If the model is
unbalanced, we can always add a dummy source or a dummy destination to
restore balance.
● The cost assumption: The cost of distributing units from any particular
source to any particular destination is directly proportional to the number of
units distributed. Therefore, this cost is just the unit cost of distribution times
the number of units distributed. (We let cij denote this unit cost for source i and
destination j.)The only data needed for a transportation problem model are the
supplies, demands, and unit costs. These are the parameters of the model. All
these parameters can be summarized conveniently in a single parameter
table as shown below
● The model: Any problem (whether involving transportation or not) fits the
model for a transportation problem if it can be described completely in terms
of a parameter table shown below and it satisfies both the requirements
assumption and the cost assumption. The objective is to minimize the total
cost of distributing the units. All the parameters of the model are included in
this parameter table.

1- Northwest-Corner Method
The method starts at the northwest-corner cell (route) of the tableau (variable x11).
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 TOW (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.

2- Least Cost Method

The least-cost method finds a better starting solution by concentrating on the
cheapest routes. The method assigns as much as possible to the cell with the
smallest unit cost (ties are broken arbitrarily). Next, 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. Next, look for the uncrossed-out cell with
the smallest unit cost and repeat the process until exactly one row or column is left
uncrossed out.

3- Vogel’s 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 element in the row (column) from the next smallest unit cost
element in the same row (column).
Step 2: Identify the row or column with the largest penalty. Break 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).
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.

Example:

Destinations

Sources 1 2 3 4 supply
 1 10 2 20 11 15

2 12 7 9 20 25

3 4 14 16 18 10

Demands 5 15 15 15 Demands=supply

This Example is solved using all three methods mentioned above

1- Northwest Corner Method

COST PER UNIT DISTRIBUTED

DESTINATION
SOURCE 1 2 3 4 SUPPLY
10 2 20 11
15
5 10
1

12 7 9 20 25
2 5 15 5

4 14 16 18
10
3 10

DEMAND 5 15 15 15 Z=520
Least Cost = 5*10+10*2+5*7+15*9+5*20+10*18=520

Rim Requirements should always be equal to amounts at columns and rows side
(means demand is equal to supply)otherwise it will be degeneracy case.

2- Least Cost Method

COST PER UNIT DISTRIBUTED

DESTINATION
SOURCE 1 2 3 4 SUPPLY
10 start 2 20 11
15
15 0

12 7 9 End 20 25
15 5
2

4 14 16 18
10
3 5 10

DEMAND 5 15 15 15 Z=475

Least Cost= 15*2+5*4+15*9+0*11+10*18+5*20 = 475

3- VAM (Vogel’s Approximation Method)

Advanced Method for all the above 2 transportation problems.
 COST PER UNIT DISTRIBUTED

DESTINATION
SOURCE 1 2 3 4 SUPPLY penalties
10 (b) 2 20 11 10-2=8
15 11-2=9
15
1

12 7 (c) 9 (d) 20 25 9-7=2

9-7=2
2 15 10

(a) 4 14 16 (e) 18 14-4=10

10 16-14=2
3 5 5

DEMAND 5 15 15 15 Z=475
penalties 10-4=6 7-2=5 16-9=7 18-11=7 Rim Requirements
- 7-2=5 16-9=7 20-18=2

Least Cost = 5*4+15*2+15*9+10*20+5*18 = 475

Now checking the optimality/degeneracy of the above problems:

No. of Filled Spaces = No. of Columns + No. of Rows - 1

THE TRANSSHIPMENT MODEL

The transshipment model recognizes that it may be cheaper to ship through

intermediate or transient nodes before reaching the final destination. This concept is
more general than that of the regular transportation model, where direct shipments
only are allowed between a source and a destination.