A Neighborhood Search-Based Heuristic for the Fixed Spectrum Frequency Assignment Problem
- 9 Downloads
This article proposes a heuristic for the fixed spectrum frequency assignment (FS-FA) problem of telecommunications networks. A network composes of many connections, and each connection needs a frequency from the spectrum. The assignment of frequencies to the transmitters should satisfy a set of constraints. The constraints specify the separation which is necessary between frequencies of different transmitters. Violation of constraints creates interference. The goal of the FS-FA problem is to find an assignment of frequencies for the transmitters, which has minimum interference. The proposed heuristic has two main components: a local search heuristic and a compound move. The local search heuristic employs one-change moves (i.e., a move that changes the frequency of one transmitter at a time). It also employs a lookup table that classifies all possible one-change moves as positive or negative. The local search heuristic chooses positive/negative moves until it traps in a locally minimal solution. The compound-move operation shifts the local search to a new location in the search space. We can repeatedly apply the local search and compound move for many iterations. The proposed heuristic has been evaluated on the same benchmarks as used by others in the recently published literature. We have compared our algorithm with two existing tabu-search-based algorithms: dynamic-list-based tabu search (DTS) (Montemanni et al. in IEEE Trans Veh Technol 52(4):891–901, 2003. https://doi.org/10.1109/TVT.2003.810976) and heuristic manipulation technique-based TS (Montemanni and Smith in Comput Oper Res 37(3):543–551, 2010. https://doi.org/10.1016/j.cor.2008.08.006) (HMT). The solution quality of the proposed algorithm is found to be better than or equal to the HMT and DTS in 88% and 79% of test problems, respectively.
KeywordsFrequency assignment problem Graph coloring problem Heuristics
Unable to display preview. Download preview PDF.
- 3.Garey, M.; Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-completeness. In: Freeman, W.H. (ed.) Books in Mathematical Series (1979). https://books.google.com.sa/books?id=fjxGAQAAIAAJ
- 10.Galinier, P.; Hao, J.K.: A general approach for constraint solving by local search. J. Math. Modell. Algorithms 3(1), 73–88 (2004). https://doi.org/10.1023/B:JMMA.0000026709.24659.da MathSciNetCrossRefzbMATHGoogle Scholar
- 11.Liwei, L.; Rongshuang, F.: Simulated annealing algorithm in solving frequency assignment problem. In: 2010 3rd International Conference on Advanced Computer Theory and Engineering(ICACTE), vol 1, pp V1-361–V1-364 (2010). https://doi.org/10.1109/ICACTE.2010.5579000
- 15.Correia, L.M.: Wireless flexible personalised communications : COST 259, European co-operation in mobile radio research. Wiley, Chichester (2001). http://lib.ugent.be/catalog/rug01:001649471
- 18.Derrac, J.; García, S.; Molina, D.; Herrera, F.: A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evol. Comput. 1(1), 3–18 (2011). https://doi.org/10.1016/j.swevo.2011.02.002 CrossRefGoogle Scholar