Docsity
Docsity

Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity


Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan


Guidelines and tips
Guidelines and tips

assignment for supply chain inventory/transportation, Assignments of Supply Management

assignments provided for supply chain management

Typology: Assignments

2023/2024

Uploaded on 10/04/2024

kartikeya-bakshi
kartikeya-bakshi 🇮🇳

1 document

1 / 3

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Transportation and Distribution Network Assignment
Q1. A company makes a product in three factories and distributes them to four warehouses. The
transportation cost (dollar per unit), and supply and demand (in units per week) are shown in
Table 1. Note that total supply = total demand. If this was not the case, an extra (“dummy”)
origin or destination with zero unit transportation costs should be added to the table. If a route
(cell) is not possible, a large unit transportation cost, e.g., $999, can be used for it. Formulate the
given transportation problem and find out the optimal sol ution.
Q2. Consider the transportation problem with the following data: The unit cost of transportation
costs are given in table:
S1 S2 S3 Supply
D1 4 6 10 100
D2 8 5 4 80
D3 7 8 4 60
Demand 90 70 80
The fixed charge are F11=100,F12=120, F13=110, F21=80, F22=120, F23=60,F31=120, F32=80,
F33=60.solve the fixed charge transportation problem using the heuristic.
Q3. Consider Q=30. Three types of trucks are available with capacities 12, 9, and 7 respectively
and cost 12,8, and 5 per truck respectively. Solve a truck problem to find the minimum cost
solution. (Knap-sack problem).
Q4. Consider a transhipment problem where the origins are plants and destinations are depots.
The unit transportation costs, capacity at the plants, and the requirements at the depots are
indicated below:
pf3

Partial preview of the text

Download assignment for supply chain inventory/transportation and more Assignments Supply Management in PDF only on Docsity!

Transportation and Distribution Network Assignment Q1. A company makes a product in three factories and distributes them to four warehouses. The transportation cost (dollar per unit), and supply and demand (in units per week) are shown in Table 1. Note that total supply = total demand. If this was not the case, an extra (“dummy”) origin or destination with zero unit transportation costs should be added to the table. If a route (cell) is not possible, a large unit transportation cost, e.g., $999, can be used for it. Formulate the given transportation problem and find out the optimal sol ution. Q2. Consider the transportation problem with the following data: The unit cost of transportation costs are given in table: S1 S2 S3 Supply D1 4 6 10 100 D2 8 5 4 80 D3 7 8 4 60 Demand 90 70 80 The fixed charge are F 11 =100,F 12 =120, F 13 =110, F 21 =80, F 22 =120, F 23 =60,F 31 =120, F 32 =80, F 33 =60.solve the fixed charge transportation problem using the heuristic. Q3. Consider Q=30. Three types of trucks are available with capacities 12, 9, and 7 respectively and cost 12,8, and 5 per truck respectively. Solve a truck problem to find the minimum cost solution. (Knap-sack problem). Q4. Consider a transhipment problem where the origins are plants and destinations are depots. The unit transportation costs, capacity at the plants, and the requirements at the depots are indicated below:

When each plant is also considered a destination and each depot is also considered an origin, there are altogether five origins and five destinations. Some additional cost data are also necessary. These are presented in the following Tables. Q5. A salesman wants to visit cities A,B,C,D and E. He does not want to visit any city twice before completing his tour of all the cities and wishes to return to the point of starting journey. Cost of going from one city to another (in rupees) is shown in table. Find the least cost route. (Travelling Salesman problem). A b c D e a 0 2 5 7 1 b 6 0 3 8 2 c 8 7 0 4 7 d 12 4 6 0 5 e 1 3 2 8 0