DMM Case Study…..

Presented by:
Vaibhav Sharma(93057)
Vichikka Singhal(93058)
 PROBLEM
A B C

E
D
 STEP 1:

Identifying the smallest element from each row and subtracting it

from all elements of that row.
 STEP 2:

Identifying the smallest element of each column and subtracting it

from all the elements of the column.
 STEP 3:

Making assignments on zero elements.

A E B A
But this is not the optimal
solution…
 STEP 4:

Identifying the minimum

element above zero and making
assignments on zero and that
element.
Case: 1
Case: 2
Case: 3

A E C D B A
This is the optimal solution..
Thus the total distance covered by the bus while taking
the optimal route to cover all the locations will be:

5+6+6+5+6=28km
THANK YOU…