QUESTION 1 (24 MARKS) Food Bear delivery service is sending a delivery man to UUM for food delivery. There are FIVE (5) destinations that he needs to deliver the food which starts at the UUM entrance. The delivery man needs to make sure that he delivers the food to all destinations. The distance in kilometres (km) between destinations is shown in TABLE 1. TABLE 1 Destination UUM entrance A B D E UUM entrance 0 3.5 2.8 1.9 1.5 0.5 A 1.2 0 1.2 B 3.6 2.7 0 2.9 4.3 1.1 0 1.5 3.1 D 1.5 1.6 0.7 3.2 0 2.4 E 2.3 0.9 3.2 2.4 1.9 0.7 0.6 1.2 1.7 1.7 2.3 0 111. a) Suggest a routing to the delivery man which can minimize total travel distance using Cheapest are greedy method. (5 marks) b) The delivery man has delivered the food using the route from UUM Entrance - A-B-C -D-E-UUM Entrance with the total distance of 11 km. Improve the route used by the delivery man using Simulated Annealing technique for one temperature level if To = 10, T;=0.97., N= 2, set of random numbers = {40, 65,90,37 ---} [neighbour: 3-opt). i. n=1 (5 marks) ii. n=2 (5 marks) What is the next temperature level if the search continues to the next iteration? (1 mark) iv. Based on and (11), please state what is the current best solution so far. (1 mark) c) Suggest ONE (1) metaheuristic techniques (other than Simulated Annealing. Tabu Search and Genetic Algorithm) to improve the solution in (b). (1 mark) d) Cooling schedule in Simulated Annealing is very important for temperature settings which can affect the solution search. What is the effect if i. the starting temperature is too high? (2 marks) ii. the starting temperature too low? (2 marks) iii. the temperature decrement is to fast? (2 marks) QUESTION 1 (24 MARKS) Food Bear delivery service is sending a delivery man to UUM for food delivery. There are FIVE (5) destinations that he needs to deliver the food which starts at the UUM entrance. The delivery man needs to make sure that he delivers the food to all destinations. The distance in kilometres (km) between destinations is shown in TABLE 1. TABLE 1 Destination UUM entrance A B D E UUM entrance 0 3.5 2.8 1.9 1.5 0.5 A 1.2 0 1.2 B 3.6 2.7 0 2.9 4.3 1.1 0 1.5 3.1 D 1.5 1.6 0.7 3.2 0 2.4 E 2.3 0.9 3.2 2.4 1.9 0.7 0.6 1.2 1.7 1.7 2.3 0 111. a) Suggest a routing to the delivery man which can minimize total travel distance using Cheapest are greedy method. (5 marks) b) The delivery man has delivered the food using the route from UUM Entrance - A-B-C -D-E-UUM Entrance with the total distance of 11 km. Improve the route used by the delivery man using Simulated Annealing technique for one temperature level if To = 10, T;=0.97., N= 2, set of random numbers = {40, 65,90,37 ---} [neighbour: 3-opt). i. n=1 (5 marks) ii. n=2 (5 marks) What is the next temperature level if the search continues to the next iteration? (1 mark) iv. Based on and (11), please state what is the current best solution so far. (1 mark) c) Suggest ONE (1) metaheuristic techniques (other than Simulated Annealing. Tabu Search and Genetic Algorithm) to improve the solution in (b). (1 mark) d) Cooling schedule in Simulated Annealing is very important for temperature settings which can affect the solution search. What is the effect if i. the starting temperature is too high? (2 marks) ii. the starting temperature too low? (2 marks) iii. the temperature decrement is to fast? (2 marks)