Scribd
Upload
52 views1 page

CE744 Assign 1 Evaluation

Problem 1 asks to find the shortest path from node 1 to node 6 in a graph with 7 nodes connected by edges of different lengths. Problem 2 involves assigning shipments from 3 warehouses to 4 customers to minimize total shipping cost given warehouse capacities, customer demands, and distances between locations. Problem 3 asks to determine the most economical route for a traveling salesman to visit 5 cities and return home given the distances between the cities.

Uploaded by

Yogesh Kherde
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
52 views1 page

CE744 Assign 1 Evaluation

Problem 1 asks to find the shortest path from node 1 to node 6 in a graph with 7 nodes connected by edges of different lengths. Problem 2 involves assigning shipments from 3 warehouses to 4 customers to minimize total shipping cost given warehouse capacities, customer demands, and distances between locations. Problem 3 asks to determine the most economical route for a traveling salesman to visit 5 cities and return home given the distances between the cities.

Uploaded by

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

Problem 1:

2
3 5
4 3

1
1 2 1 6
6 7

2
2 4

Find the shortest path from nodes 1 to 6.

Problem 2: The warehouses of a company are located in three cities A, B and C. There are four
customers 1, 2, 3 and 4. The capacities of warehouses, demands of the customers and the
distances between the warehouses and customers are given in the Table given below. Determine
a suitable plan for assigning the shipments to the various customer-warehouse combinations that
would minimize the total shipping cost.

Customer
Warehouse Capacity
1 2 3 4
A 270 230 310 690 100
B 100 450 400 320 80
C 300 540 350 570 80
Demand 60 120 50 40

Problem 3: A travelling salesman has to cover a set of 5 cities (his own included) and return
home. The distance between the cities is shown in the map below. Determine the most
economical route.

1
18
17 15 2
14
23
5 16 11
12
15

4 3

You might also like