استخدام خوارزمية مستعمرة النمل لإيجاد التخصيص الأمثل

Abstract EN

The study examined the use of an ant colony algorithm to find the optimal assignment for a (3 × 3) application and compare its results with the results of the Hungarian method.

The application requires six possible assignments because the number of possible assignments is calculated according to the following formula: (3! = 3 × 2 × 1 = 6).

Since the objective function in the assignment problem is a function of minimization for the fact that the target function represents the cost function whether it represents (time or effort or money).

Therefore, the purpose of the research was to use the ant colony algorithm and compare its results in the traditional method (the Hungarian method) in terms of execution time, number of repetitions and accuracy of results.

It has been concluded that the lowest allocation among the six assignments is the allocation in which the value of the target function is equal to 27 and using two replicates in the ants colony, as confirmed by the results of the Hungarian method.

The application used in this research includes the distribution of three tasks by the father for the boys in exchange for a sum of money so that each one of them one task and each task performed by only one of the children.

It is possible to make use of the optimal allocation of assignment if the right person is assigned to perform a specific task in various areas of economic and social life.

Thus, this person does not perform any other task and does not perform this task other than the person in charge and thus ensure that all (individuals) to perform certain tasks as well as the performance of all tasks by all individuals using the allocation with the least time and effort as well as the lowest possible cost.