An Exact Algorithm for the Min-Interference Frequency Assignment Problem

In this paper we consider the Frequency Assignment Problem, where the objective is to minimize the cost due to interference arising in a solution. We use a quadratic 0-1 integer programming formulation of the problem as a basis to derive new lower bounds and problem reduction rules. A tree search algorithm, that uses the lower bounds and dominance criteria is also presented. Computational results are shown on standard benchmark instances from the literature.

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

[2]  John R. Beaumont,et al.  Studies on Graphs and Discrete Programming , 1982 .

[3]  Panagiotis Demestichas,et al.  Optimum frequency reuse in mobile telephony systems , 1995 .

[4]  B. Jansen,et al.  A branch-and-cut algorithm for the frequency assignment problem , 1996 .

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

[6]  Nicos Christofides,et al.  A Graph Theoretic Analysis of Bounds for the Quadratic Assignment Problem , 1981 .

[7]  Matteo Fischetti,et al.  Frequency assignment in mobile radio systems using branch-and-cut techniques , 2000, Eur. J. Oper. Res..

[8]  Edward P. K. Tsang,et al.  Foundations of constraint satisfaction , 1993, Computation in cognitive science.

[9]  Brigitte Jaumard,et al.  Mathematical Models and Exact Methods For Channel Assignment in Cellular Networks , 1999 .

[10]  Derek H. Smith,et al.  Improving heuristics for the frequency assignment problem , 1998, Eur. J. Oper. Res..

[11]  Arie M. C. A. Koster,et al.  The partial constraint satisfaction problem: Facets and lifting theorems , 1998, Oper. Res. Lett..

[12]  Tamás Terlaky,et al.  A Potential Reduction Approach to the Frequency Assignment Problem , 1997, Discret. Appl. Math..

[13]  Derek H. Smith,et al.  A new lower bound for the channel assignment problem , 2000, IEEE Trans. Veh. Technol..

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

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

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

[17]  Martin Grötschel,et al.  Frequency assignment in cellular phone networks , 1998, Ann. Oper. Res..

[18]  P. Gilmore.  Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem , 1962 .

[19]  Brigitte Jaumard,et al.  Greedy and Tabu Search Heuristics for Channel Block Assignment in Cellular Systems , 1997 .

[20]  Euclid Calma Radio Link Frequency Assignment Project , 1995 .

[21]  Dong-wan Tcha,et al.  A new lower bound for the frequency assignment problem , 1997, TNET.

[22]  L. F. Turner,et al.  A mathematical programming approach to the channel assignment problem in radio networks , 1996, Proceedings of Vehicular Technology Conference - VTC.

[23]  Caj Cor Hurkens,et al.  Upper and lower bounding techniques for frequency assignment problems , 1995 .