There are n tasks assigned to n workers, and each worker can be assigned only one task. Each worker can complete any one of the tasks, but the time spent varies. Use the ant colony algorithm to find...

4

Extracted text: There are n tasks assigned to n workers, and each worker can be assigned only one task. Each worker can complete any one of the tasks, but the time spent varies. Use the ant colony algorithm to find the best allocation scheme that minimizes the total time spent. a) Build a mathematical model to describe the problem; b) Formulate state transition probability and pheromone update strategy;