Miser University for Sciences & Technology

Faculty of Information Technology

Course: Operation Research (IS 231)
Instructor: Prof. Dr. G. M. Abdelhamid
Sheet (5)
Transportation problem Techniques

In Exercises 1- 3 find an initial basic feasible solution using

(a) North-West Corner method,
(b) The Least-Cost rule,
(c) Vogel's method.
 60 
5 2 3 6 100   60 
   
1. C= 2 7 7 4 , s=  80  , d=  80 

1 2 6 9
 140 
   
120 
100 
6 6 3 9 2  90   

8 7 5 7 5
   40 
 70 
2. C= 3 4 8 2

7
, s= 110  , d= 100
     60 
6
 0 0 2 9 150
 120 
 
4 6 7 5 100  40 
   70 
4 4 7 8 60 
3. C= 5 3 6

5
, s=  50  , d= 120
     
6
 5 3 4  70 
  50 

In Exercises 4- 9 solve the given transportation problem

 70 
2 5 6 3 100  50 
 
4. C= 9 6 2 1 , s=  90  , d= 130

7 7 2 4
 130
   
 20 
3 2 5 4  60  70
  80  70
6 5 7 8
5. C= 2 1 4

3 , s=  50  , d= 70
     
4
 3 5 2 100  80 

 60 
4 3 2 5 6  70   50 
  80 
8 3 4 5 7  
6. C= 6 8 6 7

5
, s=  60  , d=  50 
     70 
4
 3 5 2 4 120 
100
 
4 2 9 7 1
 1
7 8 5 6
7. C= 3 3 4

1
, s= d= 1
   
7
 5 2 6 1 
 45
5 6 7 4 75 50 
   
8. C= 2 9 7 5 , s= 50 , d= 25
8
 5 8 7
  
60   
50 
60 
6 4 3 5 100 80 
 
9. C= 7 4 8 6 , s=  60  , d= 70

8 3 2 5
 
 50   
 40
In Exercises 10, 11 formulate the problem as a transportation model and find its optimum
solution

10. Three refineries with maximum daily capacities of 6,

5 and 8 million gallons of 1 0 2 4 gasoline supply three
distribution areas with 3 5 4 6 daily demands of 4, 8 and 7
million gallons. Gasoline is 1 2 3 10 transported to the three
distribution areas through a 3 5 12 network of pipelines. The
transportation cost is estimated based on the length of the pipeline at about 1 cent per
100 gallons per mile. The mileage table summarized below shows that refinery 1 is
not connected to distribution area
3. Distribution Area
1 2 3
1 120 180 -
Refinery 2 300 100 80
3 200 250 120

11. Cars are shipped by truck from three distribution centers to five dealers. The shipping
cost is based on the mileage between sources and destinations. The cost is
independent of whether the truck makes the trip with partial or a full load. The table
below summarizes the mileage between the distribution centers and the dealers as well
as the monthly supply and demand figures estimated in number of cars. Each truck
can carry a maximum of 18 cars. Given that the transportation cost per truck mile is
$10.

12. Solve the problem below by the transportation technique and the simplex method and
show that there is a one-to-one correspondence between the iterations of the two
methods. Find the starting solution by the northwest-corner method.

Dealers
1 2 3 4 5 supply
1 100 150 200 140 35 400
13. Distribution
2 50 70 60 65 80 200
Centers
3 40 90 100 150 130 150
demand 100 200 150 160 140
Solve each of the following transportation models by using the northwest- corner
method, least-cost method, and Vogel's approximation method to obtain the starting
solution. Compare the computations.

2
 (a) (b)
5 1 8 12
2 4 0 14
3 6 7 4
9 10 11

14. Find the starting solution in the following transportation problem by the
(a) Northwest-corner method,
(b) The least-cost method,
(c) Vogel's approximation method.
Obtain the optimal solution by using the best starting method

10 20 5 7 10
13 9 12 8 20
4 15 7 9 30
14 7 1 0 40
3 12 5 19 50
60 60 20 10

15. Solve the following unbalanced transportation problem using VAM to find the
starting solution. The demand at destination 1 must be shipped from source 4.

5 1 0 20

3 2 4 10

7 5 2 15

9 6 0 15

5 10 15