0% found this document useful (0 votes)
28 views5 pages

Maths Modeling.

Uploaded by

Anu Anujan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
28 views5 pages

Maths Modeling.

Uploaded by

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

Problem overview

PrintXcel Pvt Ltd distributed company has 4 distributed points in Eastern province. They wanted to
assign 4 sales representative to their distributed points in a way that will minimized the total
distance travel by the sales representative in one day from their home, to reduce the total cost for
the fuel.
Sales The average
1 2daily travel
3 distance
4 in kilometers is given below.
Distributed points A B C D
reps no
Name Laksan Kumar Ahamad Kishan Names Kalmunai Akkaraipatt Batticaloa Kaaraithee
u vu

Sales Reps\ Distributed A B C D


Points
1 60 45 40 55
2 40 50 55 60
3 65 55 70 50
4 55 70 65 65

Problem: Find the best way of assigning a Sales rep for each distributed points based on minimize
distance.

Solving method: Here 4 Sales reps should be assign to 4 Distributed points with total cost
minimizing. This is an assignment model problem. Solve it using Hungarian method.
Procedure
 Step 1: Perform row reduction.
 Step 2: Perform column reduction.
 Step 3: Cross out all zeros using minimum no. of lines.
 Step 4: If Crossing lines < n
 Subtract minimum uncrossed values from other uncrossed
values.
 Replace two lines intersect values by adding minimum
uncrossed value.
 Step 5: If Crossing lines = n, it is optimum solution. If it is not,
SOLUTION
STEP1 : ROW REDUCTION Step2 : Column reduction
Distribute Distribute
d A B C D d
A B C D
Sales reps Sales reps
points points
1 20 5 0 15 1 20 0 0 15
2 0 10 15 20 2 0 5 15 20
3 15 5 20 0 3 15 0 20 0
4 0 15 10 10 4 0 10 10 10

STEP3 : CROSS OUT ALL ZEROS


Distribute Step4
Distribute :
d
A B C D d
A B
B C
C D
D
Sales reps Sales reps
points points
1 20 0 0 15 1 25
20 0
0 00 15
15
2 0 5 15 20 2 0 0
0
5 10
10
15 15
15
20
3 15 0 20 0 3 20
15 0
0 20
20 00
4 0 10 10 10 4 0 55
10 55
10 55
10
Crossing lines<no of columns or
rows
SOLUTION
STEP4 : Again Step3 :
Distribute Distribute
d A B C D d
A B C D
Sales reps Sales reps
points points
1 25 0 0 15 1 25 0 0 15
2 0 0 10 15 2 0 0 10 15
3 20 0 20 0 3 20 0 20 0
4 0 5 5 5 4 0 5 5 5

STEP5 : SOLUTION MATRIX Crossing lines = no of


Distribute A B C D
d
Sales reps
columns
Sales or rows
Distributed Km
points reps point
1 25 0 0 15
1 C 40
2 0 0 10 15
2 B 50
3 20 0 20 0
3 D 50
4 0 5 5 5
4 A minimum
Optimal 55
Km/day
They had provided Rs 360.00 for 30 Km 195
Optimal minimum fuel cost/day = Rs
Total cost of fuel in one day = 2340.00
Thank you!

You might also like