A tabu search algorithm for frequency assignment

This paper presents the application of a tabu search algorithm for solving the frequency assignment problem. This problem, known to be NP-hard, is to find an assignment of frequencies for a number of communication links, which satisfy various constraints. We report on our computational experiments in terms of computational efficiency and quality of the solutions obtained for realistic, computer-generated problem instances. The method is efficient, robust and stable and gives solutions which compare more favourably than ones obtained using a genetic algorithm.

[1]  Rudolf Mathar,et al.  Channel assignment in cellular radio networks , 1993 .

[2]  D. Skorin-Kapov,et al.  On tabu search for the location of interacting hub facilities , 1994 .

[3]  Tong Sun,et al.  Algorithms for the vehicle routing problems with time deadlines , 1993 .

[4]  Jadranka Skorin-Kapov,et al.  Tabu Search Applied to the Quadratic Assignment Problem , 1990, INFORMS J. Comput..

[5]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[6]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[7]  Fred W. Glover,et al.  A user's guide to tabu search , 1993, Ann. Oper. Res..

[8]  Nicos Christofides,et al.  Capacitated clustering problems by hybrid simulated annealing and tabu search , 1994 .

[9]  Joseph B. Mazzola,et al.  A tabu-search heuristic for the flexible-resource flow shop scheduling problem , 1993, Ann. Oper. Res..

[10]  Arundhati Raychaudhuri.  Optimal Multiple Interval Assignments in Frequency Assignment and Traffic Phasing , 1992, Discret. Appl. Math..

[11]  W. K. Hale.  Frequency assignment: Theory and applications , 1980, Proceedings of the IEEE.

[12]  Ibrahim H. Osman,et al.  Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem , 1993, Ann. Oper. Res..

[13]  Fred W. Glover,et al.  Least-cost network topology design for a new service , 1991, Ann. Oper. Res..

[14]  Daniel Costa,et al.  On the use of some known methods forT-colorings of graphs , 1993, Ann. Oper. Res..

[15]  Fred Glover,et al.  Tabu search methods for a single machine scheduling problem , 1991, J. Intell. Manuf..

[16]  Dietmar Kunz,et al.  Channel assignment for cellular radio using simulated annealing , 1993 .

[17]  Michel Gendreau,et al.  Diversification strategies in tabu search algorithms for the maximum clique problem , 1996, Ann. Oper. Res..

[18]  Éric D. Taillard,et al.  Robust taboo search for the quadratic assignment problem , 1991, Parallel Comput..

[19]  Jadranka Skorin-Kapov,et al.  Massively parallel tabu search for the quadratic assignment problem , 1993, Ann. Oper. Res..

[20]  Ronald L. Rardin,et al.  Tabu search for a class of scheduling problems , 1993, Ann. Oper. Res..

[21]  Éric D. Taillard,et al.  Solving real-life vehicle routing problems efficiently using tabu search , 1993, Ann. Oper. Res..

[22]  Darko Skorin-Kapov,et al.  On minimum cost isolated failure immune networks , 1994, Telecommun. Syst..

[23]  Dominique de Werra,et al.  Chromatic Scheduling and Frequency Assignment , 1994, Discret. Appl. Math..

[24]  F. Glover.  HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS , 1977 .

[25]  Ibrahim H. Osman,et al.  Heuristics for the generalised assignment problem: simulated annealing and tabu search approaches , 1995 .

[26]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[27]  Fred W. Glover,et al.  The general employee scheduling problem. An integration of MS and AI , 1986, Comput. Oper. Res..