devised to compare search strategies: completeness, optimality, time complexity, and space complexity. Choose one of the following criteria to explain why iterative deepening search may be better than hill climbing (not random restart

Simulation of bank calling system [Problem Description] Using linear list to simulate the bank's queuing business model [Basic Requirements] Suppose that the working hours of the bank are from 9 a.m. to 5 p.m The time when customers arrive at the bank is generated randomly, and the customers are queued in the order of arrival. The time required for each customer to handle business can also be generated randomly, no more than 30 minutes. If the randomly generated time length is 0, it indicates that the customer leaves early and does not handle business. When the program is running, input the number of bank windows, and then output the basic information of each customer's business in the bank according to the randomly generated customer data (arrival time, time required for business), including: customer arrival time, customer waiting time, what time the customer handled business in which window, and how long the business lasted. From this, we can observe the average waiting time of…

Marco Dorigo developed Ant Colony Optimization (ACO) algorithm and this algorithm is used to solve many case studies. Let's say, you are using ACO to solve Travelling Repairman Problem (TRP). Describe the process on how ACO implemented in TRP case study. State if there are any improvisation you would like to make in ACO to improve the implementation in TRP case study. Following Figure 2 shows the definition of the case study. Also, include which algorithm, PSO or ACO, is better used for solving TRP case study. You may use any illustration/description to describe your solution. Travelling repairman problem (TRP) is a scheduling problem whereby a repairman must visit the scheduled locations to conduct the job needed. Each location has a period/time in which the repairman is allowed to arrive. This is to allow maximum number of repair jobs are successfully performed.

Four criteria were defined for comparing search strategies: completeness, optimality, time complexity, and space complexity. Choose ONE of these criteria to explain why Iterative deepening search might be preferred over hill climbing (plain hill climbing, not random restart).