الملخص

This research studied ant colony optimization with optimization problem as an assignment model problem by Hungarian method. The proposed heuristic algorithm simulate ant colony optimization algorithm with  Hungarian method for Assignment   problem. The ant colony optimization algorithm simulates  the behavior of  real ant colony, to find the shortest path between many paths for solving the problem. It dependent on the path from the nest (problem of research) to food (optimal solution) by deposited pheromone on the path they take between the nest and food, so that other ants can smell it.The experiment in this research  shows that the algorithm provides optimal solution. It  has outperforms with computation and it is an effective approach  and the algorithm performs significantly better than the classical method, to  reduce the region of the space considered and computation as compared to the classical methods.