Improving heuristics for the frequency assignment problem

Abstract Lower bounds for the frequency assignment problem can be found from maximal cliques and subgraphs related to cliques. In this paper we show that for many types of problem optimal assignments can be found by a process of assigning these subgraphs first, fixing the assignment and then extending the assignment to the full problem. We demonstrate the advantages of the method for some typical examples. In particular we give the first optimal assignments of several variants of the “Philadelphia” problems. These problems have been used by several authors to assess assignment methods and lower bounds.

[1]  P. Pardalos,et al.  An exact algorithm for the maximum clique problem , 1990 .

[2]  James L. Drewniak,et al.  IEEE International Symposium on Electromagnetic Compatibility , 1994 .

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

[4]  James F. Boyce,et al.  Tabu Search for the Radio Links Frequency Assignment Problem , 1995 .

[5]  Patrick Prosser,et al.  HYBRID ALGORITHMS FOR THE CONSTRAINT SATISFACTION PROBLEM , 1993, Comput. Intell..

[6]  Stephen Hurley,et al.  A Parallel Genetic Algorithm for Frequency Assignment Problems , 1994 .

[7]  R. Prim.  Shortest connection networks and some generalizations , 1957 .

[8]  A. Gamst,et al.  Some lower bounds for a class of frequency assignment problems , 1986, IEEE Transactions on Vehicular Technology.

[9]  R.J. McEliece,et al.  Channel assignment in cellular radio , 1989, IEEE 39th Vehicular Technology Conference.

[10]  Stephen Hurley,et al.  A tabu search algorithm for frequency assignment , 1996, Ann. Oper. Res..

[11]  Wei Wang,et al.  An adaptive local-search algorithm for the channel-assignment problem (CAP) , 1996 .

[12]  D. H. Smith,et al.  Bounds for the frequency assignment problem , 1997, Discret. Math..

[13]  S. U. Thiel,et al.  FASoft: A system for discrete channel frequency assignment , 1997 .

[14]  A. Gamst,et al.  Homogeneous distribution of frequencies in a regular hexagonal cell system , 1982, IEEE Transactions on Vehicular Technology.

[15]  L. G. Anderson.  A Simulation Study of Some Dynamic Channel Assignment Algorithms in a High Capacity Mobile Telecommunications System , 1973, IEEE Trans. Commun..

[16]  Jan Mycielski.  Sur le coloriage des graphs , 1955 .

[17]  William K. Hale.  New Spectrum Management Tools , 1981, 1981 IEEE International Symposium on Electromagnetic Compatibility.

[18]  Michel Gendreau,et al.  Solving the maximum clique problem using a tabu search approach , 1993, Ann. Oper. Res..

[19]  R. Jonker,et al.  A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation , 1982 .

[20]  J. Zoeliner,et al.  A Breakthrough in Spectrum Conserving Frequency Assignment Technology , 1977, IEEE Transactions on Electromagnetic Compatibility.

[21]  Fred S. Roberts,et al.  T-colorings of graphs: recent results and open problems , 1991, Discret. Math..

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

[23]  R. A. Leese.  A unified approach to the assignment of radio channels on a regular hexagonal grid , 1997 .