Round 2A

ABC Ltd has a warehouse WH which supplies finished products (in 1000 units) to 10
different retail stores located in the vicinity of the warehouse.

Retail Store Qty to be supplied (‘000 units)

A 10
B 10
C 20
D 10
E 10
F 20
G 10
H 20
I 10
J 10

There is an unlimited supply of trucks which will carry the finished products to the retail
stores. The trucks, however, cannot carry more than 55000 units at the same time. The
below table gives the distances between the every retail store and the warehouse:

WH A B C D E F G H I J
WH 0 10 13 13 14 7 15 11 18 19 5
A 10 0 14 12 16 11 16 20 9 9 10
B 13 14 0 15 19 19 11 10 20 15 11
C 13 12 15 0 13 6 11 7 14 16 9
D 14 16 19 13 0 17 9 16 18 13 13
E 7 11 19 6 17 0 11 14 12 15 7
F 15 16 11 11 9 11 0 8 5 15 8
G 11 20 10 7 16 14 8 0 12 17 12
H 18 9 20 14 18 12 5 12 0 8 13
I 19 9 15 16 13 15 15 17 8 0 19
J 5 10 11 9 13 7 8 12 13 19 0

Find the all the most optimal routes for the trucks that minimise the total distance
travelled.
(Hint: Define a saving metric for every pair of retail stores and the central depot. Saving for A to B can
be computed as 2*(AO+BO)-(AO+AB+OB) )

Naive solution: 2 x (AO + BO) Optimal solution: (AO + AB + OB) (Naming: OAB)