GP is a package delivery company. GP has to visit 8 different customer locations. Based on past experience, GP forecasts the demand values. The depot is the starting point and has zero demand. The demand data is given in Table 1 and the distance matrix in Table 2. In one vehicle, GP can carry at most 30 units. What is the total route distance based on the nearest neighbor heuristic?

 

Table 1: The demand units Customer 1 2 3 4 5 6 7 8 Demand 4 3 5 3 4 5 2 4 Table 2: The distance and saving matrices (in kilometers) a) Distances D 1 2 3 4 5 6 7 8 D 0 33 42 22 50 45 32 57 30 1 33 0 21 62 50 91 3 2 42 21 0 41 61 71 20 71 67 22 62 41 0 28 5 45 91 71 30 72 4 50 50 61 280 72 287 30 41 78 51 7 57 76 71 78 106 10 297 32 76 82 7 72 318 O 6 32 32 20 41 67 71 0 51 50 357 67 106 76 71 10 64 8 30 82 67 51 76 64 50 41 0 51 0 41 [.