Académique Documents
Professionnel Documents
Culture Documents
The Objective:
To find the amount to be shipped from each source to each destination such
that the total transportation cost is minimized
Terms:
n sources
k destinations
s(i) – the amount of supply at source I
d(j) – the demand at destination j
cost(i,j) – the unit transportation cost between source i and destination j
Xji – the amount transported from i to j
The Transportation Problem is given as:
∑ ∑ ∫ ( Xij )
n k
min i =1 j =1 ij
∑
k
j =1
Xij <= s (i ), i =1,2,....., n
∑
n
i =1
Xij >= d ( j ), j = 1,2,......., k
∑
k
j =1
Xij = s (i ), i =1,2,....., n
∑
n
i =1
Xij = d ( j ), j = 1,2,....., k
Integer solution:
If all s(i) and d(j) are integers
all X(ij) are integers
The number of positive integers among the X(ij) is at most n + k -1
Example:
3 sources
s(1) = 15, s(2) = 25, s(3) = 5
4 destinations
d(1) = 5, d(2) = 15, d(3) = 15, d(4) = 10
Total supply and demand equal 45
The transportation cost:
10 0 20 11
12 7 9 20
0 14 16 18
5 15 15 10
15 0 5 0 10
25 0 10 15 0
5 5 0 0 0
Problem: How many tons of wheat to transport from each grain elevator to each mill on a
monthly basis in order to minimize the total cost of transportation?