Dynamic Multiple Neighborhood Structures for the Static Frequency Assignment Problem

34d06289-5f56-4e9a-8609-f822f6eccd8d20231102075235729wseas:wseasmdt@crossref.orgMDT DepositInternational Journal of Applied Mathematics, Computational Science and Systems Engineering2766-982310.37394/232026https://wseas.com/journals/amcse/452023452023510.37394/232026.2023.5https://wseas.com/journals/amcse/2023.phpDynamic Multiple Neighborhood Structures for the Static Frequency Assignment ProblemKhaledAlrajhiKing Khaled Military Academy, Riyadh, Saudi ArabiaThis study proposes a dynamic multiple neighborhood structures to solve a variant of the frequency assignment problem known as the minimum order frequency assignment problem. This problem involves assigning frequencies to a set of requests while minimizing interference and the number of used frequencies. Several novel and existing techniques are used to improve the efficiency of this algorithm and make it different from other applications of multiple neighborhood structures in the literature. This includes solving 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 using multiple neighborhood structures. Moreover, applying technique that aims to determine a lower bound on the number of frequencies required from each domain for a feasible solution to exist for each sub-problem, based on the underlying graph coloring model. These lower bounds ensure that the search focuses on parts of the solution space that are likely to contain feasible solutions. This study considers real and randomly generated benchmark datasets of the static problem and our approach achieved competitive results.1122023112202318519317https://wseas.com/journals/amcse/2023/a34amcse-014(2023).pdf10.37394/232026.2023.5.17https://wseas.com/journals/amcse/2023/a34amcse-014(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 NP-Completeness, Freeman W.H. and Company, San Francisco, California. 10.1007/3-540-60469-3_30Kapsalis, A., Chardaire, P., RaywardSmith, 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.1007/978-1-4615-6089-0_8Glover, F. and Laguna, M. (1997), Tabu Search Applications, In Tabu Search, pp. 267-303. Mladenovic, N. and Hansen, P. (1997), Variable Neighborhood Search, 10.1109/wicom.2009.5301719Yu-Bin, Z., Yu-Cai, Z., Hui, X. (2009), A Tabu Search Algorithm for Frequency Assignment Prob-lem in Wireless Communication Networks, WiCO-M'09 Proceedings of the 5th International Confer-ence on Wireless Communications, Networking and Mobile Computing, pp. 2848-2851. Hao, J. and Perrier, L. (1996), Tabu Search for the Frequency Assignment Problem in Cellular Radio Networks, Technical Report LG12P, EMA-EERIE, Parc Scientifique Georges Besse, Names France. 10.1109/proc.1980.11899Hale, W. (1980), Frequency Assignment: Theory and Applications, Proc. IEEE Vol. 68, pp. 1497-1514. 10.1007/3-540-61723-x_1043Dorne, R. and Hao, J. (1996), Constraint Handling in Evolutionary Search: A Case Study on Frequen-cy Assignment, 4th International Conference on Parallel Problem solving from Nature, Lecture Note in Computer Science 1141, pp. 801-810, Springer-Verlag. 10.1016/j.dam.2007.03.025Dowsland, K., Thompson, J. (2008), An Improved Ant Colony Optimisation Heuristic for Graph Coloring, Discrete Applied Mathematics, Vol. 156, No. 3, pp. 313-324. 10.1007/bf02239976Hertz, A. and de Werra, D. (1987), Using Tabu Search Techniques for Graph Coloring, Computing Vol. 39, pp. 345-351.