99cf140c-73cd-431d-8b88-6d698740e6e320231106054503964wseas:wseasmdt@crossref.orgMDT DepositInternational Journal of Computational and Applied Mathematics & Computer Science2769-247710.37394/232028https://wseas.com/journals/camcs/index.php41020234102023310.37394/232028.2023.3https://wseas.com/journals/camcs/2023.phpKhaledAlrajhiKing Khaled Military Academy, Riyadh, SAUDI ARABIAThis 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.116202311620239810311https://wseas.com/journals/camcs/2023/a22camcs-009(2023).pdf10.37394/232028.2023.3.11https://wseas.com/journals/camcs/2023/a22camcs-009(2023).pdfMetzger, B. (1970), Spectrum Management Tech-nique, Presentation at 38th National ORSA meeting (Detroit, MI). Garey, M. and Johnson, D. (1979), Computers and Intractability: A Guide to the Theory of NPCompleteness, Freeman W.H. and Company, San Francisco, California. 10.1007/3-540-60469-3_30Kapsalis, A., Chardaire, P., Rayward-Smith, V. and Smith, G. (1995), The Radio Link Frequency As-signment Problem: A Case Study Using Genetic Al-gorithms, Lecture Notes on Computer Science, pp. 117-131. Crisan, C. and Mühenbein, H. (1998), The Frequen-cy Assignment Problem: A Look at the Perfor-mance of Evolutionary Search, Lecture Notes in Computer Science, Vol. 1363, pp. 263- 274. 10.1007/978-3-642-38703-6_37Parsapoor, M. and Bilstrup, U. (2013), Ant Colony Optimization for Channel Assignment Problem in a Clustered Mobile Ad Hoc Network, International Conference on Swarm Intelligence (ICSI), Vol. 1, pp. 314-322. 10.1023/a:1019100324508Tiourine, S., Hurkens, C. and Lenstra, J. K. (1999), Local Search Algorithm for the Radio Link Fre-quency Assignment Problem, Telecommunication System, Vol. 13, pp. 293- 314. Bouju, A., Boyce, J., Dimitropoulos, C., Vom Scheidt, G. and Taylor, J. (1995), Tabu Search for the Radio Links Frequency Assignment Problem, In Applied Decision Technologies, London, [ADT'95]. UNICOM Conference. Hao, J., Dorne, R. and Galinier, P. (1998), Tabu Search for Frequency Assignment in Mobile Radio Networks, Journal of Heuristics Vol. 4, pp. 47-62. Bouju, A., Boyce, J., Dimitropoulos, C., Vom Scheidt, G. and Taylor, J. (1995), Intelligent Search for the Radio Links Frequency Assignment Prob-lem, Proceedings of the International Conference on Digital Signal Processing. 10.1038/sj.jors.2600357Costa, D. and Hertz, A., 1997. Ants can colour graphs. Journal of the Operational Research Socie-ty, 48(3), pp.295-305. 10.1057/palgrave.jors.2601830Dowsland, K.A. and Thompson, J.M., 2005. Ant col-ony optimization for the examination scheduling problem. Journal of the Operational Research Soci-ety, pp.426-438. 10.1016/j.dam.2007.03.025Dowsland, K.A. and Thompson, J.M., 2008. An im-proved ant colony optimisation heuristic for graph colouring. Discrete Applied Mathematics, 156(3), pp.313-324. 10.1016/s0167-739x(00)00046-7Maniezzo, V. and Carbonaro, A., 2000. An ANTS heuristic for the frequency assignment problem. Fu-ture Generation Computer Systems, 16(8), pp.927-935. 10.1007/978-3-642-38703-6_37Parsapoor, M. and Bilstrup, U., 2013. Ant colony op-timization for channel assignment problem in a clus-tered mobile ad hoc network. In Advances in Swarm Intelligence, pp. 314- 322. Springer Berlin Heidelberg. 10.6028/jres.084.024Leighton, F.T., 1979. A graph coloring algorithm for large scheduling problems. Journal of Research of the National Bureau of Standards, 84(6), pp.489-506.