Ant Metaheuristic Algorithm for the Frequency Assignment Problem

Abstract

This study proposes the ant metaheuristic algorithm to solve the frequency assignment problem. In this approach, the descent method constructed as three ants which each of which appling a metaheuristics algorithm. Several novel and existing techniques are used to improve the performance of this algorithm. One of these techniques is applying the concept of a well-known graph colouring algorithm, namely recursive largest first. Furthermore, this study compares this algorithm using two visibility definitions. The first definition is based on the number of feasible frequencies and the second one is based on the degree. Additionally, we compare this algorithm using two trail definitions. The first one is between requests and frequencies. The second is between requests and requests. This study considers real and randomly generated benchmark datasets of the static problem and our algorithm achieved competitive results comparing with other ant colony optimization algorithms in the literature.