Scribd
Upload
3K views4 pages

Transportation Problem: Soumendra Roy Mobile No.: 9339327912

The document describes five transportation problems: 1. A cement factory distributing to five depots with production from three centers. 2. An ABC Ltd distributing products from three shops to five warehouses with varying costs and capacities. 3. A company distributing gravel from three pits to three construction projects with varying delivery costs. 4. A manufacturing company distributing from three plants to five distributors with varying unit transportation costs. 5. An transportation company distributing trucks from four sites to three customers with varying variable costs.

Uploaded by

Soumendra Roy
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
3K views4 pages

Transportation Problem: Soumendra Roy Mobile No.: 9339327912

The document describes five transportation problems: 1. A cement factory distributing to five depots with production from three centers. 2. An ABC Ltd distributing products from three shops to five warehouses with varying costs and capacities. 3. A company distributing gravel from three pits to three construction projects with varying delivery costs. 4. A manufacturing company distributing from three plants to five distributors with varying unit transportation costs. 5. An transportation company distributing trucks from four sites to three customers with varying variable costs.

Uploaded by

Soumendra Roy
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

TRANSPORTATION PROBLEM

1. A cement factory manager is considering the best way to transport cement from his three
manufacturing centres P, Q, R to depots A, B, C, D and E. the weekly production and
demands along with transportation costs per tonne are given below:

Depot Supply
(Tonnes)
A B C D E
Manufacturing P 4 1 3 4 4 60
Centre Q 2 3 2 2 3 35
R 3 5 2 4 4 40
Demand (Tonnes) 22 45 20 18 30 135
What should be the distribution programme?
2. ABC Ltd. has three production shops supplying a product to five warehouses. The cost of
production varies from shop to shop and cost of transportation from one shop to a warehouse
also varies. Each shop has a specific production capacity and each warehouse has certain
amount of requirement. The costs of transportation are as given below:

Shop Warehouse Supply


I II III IV V
A 6 4 4 7 5 100
B 5 6 7 4 8 125
C 3 4 6 3 4 175
Requiremen 60 80 85 105 70 400
t
The cost manufacture of the product at different production shops is:

Shop Variable cost Fixed Cost


A 14 70,000
B 16 40,000
C 15 50,000
Find the optimal quantity to be supplied from each shop to different warehouses at minimum
total cost.
3. A company has received a contract to supply gravel for three new construction projects
located in towns A, B and C. construction engineers have estimated the required amounts of
gravel which will be needed at these construction projects.

Project Weekly requirement


Location (Truck loads)
A 144
B 204
C 82

Soumendra Roy
B.Com (H), A.C.M.A. (AICWA), L.I.I.I., PhD (Management) (Pursuing)
Mobile No.: 9339327912
The company has three gravel pits located in towns W, X and Y respectively. The gravel
required by the construction projects can be supplied by these three plants. The amount of
gravel which can be supplied by each pit is as follows:

Pit W X Y
Amount available (Truck loads) 152 164 154
The company has computed the deliver cost from each pit to each project site. These costs (in
rupees) are shown in the adjoining table:

Pit A B C
W 8 16 16
X 32 48 32
Y 16 32 48
Schedule the shipment from each plant to each project in such a manner so as to minimize
the total transportation cost within the constraints imposed by plant capacities and project
requirements. Find the minimum cost.
4. A manufacturing company has three plants X, Y and Z, which supply to the distributors
located at A, B, C, D and E, monthly plant capacities are 80, 50 and 90 units respectively.
Monthly requirements of distributors are 40, 40, 50, 40 and 80 units respectively. Unit
transportation costs are given below in rupees:

From To
A B C D E
X 5 8 6 6 3
Y 4 7 7 6 6
Z 8 4 6 6 3
Determine an optimal distribution for the company in order to minimize the total
transportation cost.
5. Ashoka Transportation Company has trucks available at four different sites in the following
number:
Site A – 5 trucks, Site B – 10 trucks, Site C – 7 trucks, Site D – 3 trucks
Customers W, X and Y require trucks as shown:
Customer W – 5 trucks, Customer X – 8 trucks, Customer Y – 10 trucks
Variable costs getting trucks to the customers are:
From A to W – Rs 7, to X – Rs 3, to Y – Rs 6
From B to W – Rs 4, to X – Rs 6, to Y – Rs 8
From C to W – Rs 5, to X – Rs 8, to Y – Rs 4
From D to W – Rs 8, to X – Rs 4, to Y – Rs 3
Solve the above transportation problem.

Soumendra Roy
B.Com (H), A.C.M.A. (AICWA), L.I.I.I., PhD (Management) (Pursuing)
Mobile No.: 9339327912
Illustration
Consider the transportation Table

Factory Warehouse Capacity


(Supply)
W1 W2 W3 W4
F1 21 16 25 13 11
F2 17 18 14 23 13
F3 32 27 18 41 19
Requirement 6 10 12 15
(Demand)

Initial Feasible Solution


North West Corner Method

Factory Warehouse Capacity


(Supply)
W1 W2 W3 W4
F1 21 16 25 13 11(5)(0)
6 5

F2 17 18 14 23 13(8)(0)
5 8

F3 32 27 4 18 15 41 19(15)(0)

Requiremen 6 (0) 10(5)(0) 12(4)(0) 15(0) 43


t (Demand)
We will see that whether the allocations are equal to m + n – 1 = 3 + 4 – 1 = 6. As the no. of
allocations is equal to 6, basic initial feasible solution is obtained. The transportation cost is
= 6 x 21 + 5 x 16 + 5 x 18 + 8 x 14 + 4 x 18 + 15 x 41 = ₹ 126 + ₹ 80 + ₹ 90 + ₹ 112 + ₹ 72 +
₹ 615 = ₹ 1,095

Soumendra Roy
B.Com (H), A.C.M.A. (AICWA), L.I.I.I., PhD (Management) (Pursuing)
Mobile No.: 9339327912
Least Cost Method

Factory Warehouse Capacity


(Supply)
W1 W2 W3 W4
F1 21 16 25 13 11(0)
11

F2 17 18 14 23 13(1)(0)
1 12

F3 32 27 18 41 19(9)(4)(0)
5 10 4

Requirement 6(5)(0) 10(0) 12(0) 15(4)(0) 43


(Demand)
We will see that whether the allocations are equal to m + n – 1 = 3 + 4 – 1 = 6. As the no. of
allocations is equal to 6, basic initial feasible solution is obtained. The transportation cost is
= 11 x 13 + 1 x 17 + 12 x 14 + 5 x 32 + 10 x 27 + 4 x 41 = ₹ 143 + ₹ 17 + ₹ 168 + ₹ 160 + ₹
270 + ₹ 164 = ₹ 922

Soumendra Roy
B.Com (H), A.C.M.A. (AICWA), L.I.I.I., PhD (Management) (Pursuing)
Mobile No.: 9339327912

You might also like