A Tabu Search Algorithm for Frequency Assignment Problem in Wireless Communication Networks

Fixed spectrum frequency assignment problem, known as a NP-hard problem, is frequencies available are fixed and the goal is to minimize the interference due to the reuse of frequencies. The problem is still very important in wireless communication networks. An improved heuristic method, tabu search with a special data structure named
single-frequency violation
and an initialization strategy along with other new features, are presented. Experimentations tested on standard benchmark problems confirm that the algorithm could improve the solution speed without the solution quality declined.