Scribd
Upload
191 views3 pages

Transportation and Distribution Network Assignment

This document contains 6 transportation and distribution network assignment questions. The questions involve formulating and solving transportation problems, knapsack problems, traveling salesman problems, and routing problems using various algorithms and heuristics. Tables of transportation costs, supply/demand amounts, fixed charges, city distances, and customer locations and requirements are provided as data to solve each problem. The optimal solutions or minimum cost routes are to be determined.

Uploaded by

Madhurima Bhandari
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
191 views3 pages

Transportation and Distribution Network Assignment

This document contains 6 transportation and distribution network assignment questions. The questions involve formulating and solving transportation problems, knapsack problems, traveling salesman problems, and routing problems using various algorithms and heuristics. Tables of transportation costs, supply/demand amounts, fixed charges, city distances, and customer locations and requirements are provided as data to solve each problem. The optimal solutions or minimum cost routes are to be determined.

Uploaded by

Madhurima Bhandari
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/ 3

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:
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
Q6. Acme is planning delivery routes to its customers from its District Warehouse (DW) located
at (0, 0). The locations and requirements for these customers are given :
Customer Location Requirements
coordinates
Red (5, 12) 500
Green (9. 20) 200
Blue (4,10) 600
Orange (12, 30) 250
Indigo (7,10) 350

The truck capacity is 1000 units. Using Savings’ method, devise an appropriate route schedule.

You might also like