International Journal of Applied Sciences & Development
E-ISSN: 2945-0454
Volume 2, 2023
A Dynamic Ant Colony Optimization for Solving the Static Frequency Assignment Problem
Author:
Abstract: This study proposes a dynamic ant colony optimization algorithm to solve the static frequency assignment problem. This approach solves the static problem by modeling it as a dynamic problem through dividing this static problem into smaller sub-problems, which are then solved in turn in a dynamic process. 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 for each sub-problem. 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.
Search Articles
Pages: 169-176
DOI: 10.37394/232029.2023.2.18