Ant colony algorithm for task allocation problem in distributed system

Ant colony algorithm(ACA) is an intelligence-optimized algorithm coming from the illumination of food-seeking behavior by ants based on the shortest route of pheromone.Preliminary study indicates that it has superiority in solving complicated optimization problem.Task allocation problem is a typical combinatorial optimization problem.Ant colony algorithm is proposed for solving the task allocation problem with capacity constraint and fixed cost associated with each processor in distributed system,which each task can be assigned to only one processor,but each processor can execute a number of tasks.The simulation results show that ant colony algorithm can solve it more efficiently than tabu search and random method.