Tabu Search for Frequency Assignment in Mobile Radio Networks

  • Authors:
  • Jin-Kao Hao;Raphaël Dorne;Philippe Galinier

  • Affiliations:
  • LGI2P, EMA-EERIE, Parc Scientifique Georges Besse, F-30000 Nîmes, France. E-mail: ha@eerie.fr, dorne@eerie.fr, galinier@eerie.fr;LGI2P, EMA-EERIE, Parc Scientifique Georges Besse, F-30000 Nîmes, France. E-mail: ha@eerie.fr, dorne@eerie.fr, galinier@eerie.fr;LGI2P, EMA-EERIE, Parc Scientifique Georges Besse, F-30000 Nîmes, France. E-mail: ha@eerie.fr, dorne@eerie.fr, galinier@eerie.fr

  • Venue:
  • Journal of Heuristics
  • Year:
  • 1998

Quantified Score

Hi-index 0.00

Visualization

Abstract

The main goal of the Frequency Assignment Problem in mobile radionetworks consists of assigning a limited number of frequencies to eachradio cell in a cellular network while minimizing electromagneticinterference due to the reuse of frequencies. This problem, known to beNP-hard, is of great importance in practice since better solutions willallow a telecommunications operator to manage larger cellular networks.This paper presents a new Tabu Search algorithm for this application. Thealgorithm is tested on realistic and large problem instances and comparedwith other methods based on simulated annealing, constraint programmingand graph coloring algorithms. Empirical evidence shows that the Tabualgorithm is very competitive by giving the best solutions to the tested instances.