Minimizing the span of d-walks to compute optimum frequency assignments

Abstract.In this paper we deal with the Minimum Span Frequency Assignment Problem (MSFAP), that is the problem of assigning a limited set of radio frequencies to the base stations of a radio network so as the bandwidth occupancy is minimized and the overall interference is not too large. We present a new integer linear formulation for MSFAP in the multidemand case, which is the basis of an exact algorithm to compute both lower and upper bounds for MSFAP. Frequency assignments are represented as walks (sequence of nodes) in a graph. We look for a walk of minimum span, where the span of a walk is defined as the cost of a maximum cost subwalk (subsequence). The new approach is able to find optimum solutions over a large set of classical benchmarks.

[1]  Arie M. C. A. Koster,et al.  Solving frequency assignment problems via tree-decomposition , 1999 .

[2]  Chi Wan Sung,et al.  Sequential packing algorithm for channel assignment under cochannel and adjacent-channel interference constraint , 1997 .

[3]  Martin Grötschel,et al.  The Orientation Model for Frequency Assignment Problems , 1998 .

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

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

[6]  Yoshiyasu Takefuji,et al.  A neural network parallel algorithm for channel assignment problems in cellular radio networks , 1992 .

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

[8]  R. Leese,et al.  Tiling methods for channel assignment in radio communication networks , 1996 .

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

[10]  Derek H. Smith,et al.  A Permutation Based Genetic Algorithm for Minimum Span Frequency Assignment , 1998, PPSN.

[11]  Derek H. Smith,et al.  Using Lower Bounds in Minimum Span Frequency Assignment , 1999 .

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

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

[14]  D. Kunz,et al.  Channel assignment for cellular radio using neural networks , 1991 .

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

[16]  Carlo Mannino,et al.  An Enumerative Algorithm for the Frequency Assignment Problem , 2003, Discret. Appl. Math..

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

[18]  M. J. Mehler,et al.  Channel assignment using a subspace approach to neural networks , 1995 .

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

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

[21]  Wei Wang,et al.  Local search for channel assignment in cellular mobile networks , 1996, Satisfiability Problem: Theory and Applications.

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

[23]  Arie M. C. A. Koster,et al.  Frequency assignment : models and algorithms , 1999 .

[24]  Derek H. Smith,et al.  A comparison of local search algorithms for radio link frequency assignment problems , 1996, SAC '96.

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

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

[27]  Frank Harary,et al.  Graph Theory , 2016 .

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

[29]  Stuart M. Allen,et al.  Lower bounding techniques for frequency assignment , 1999 .

[30]  Seong-Lyun Kim,et al.  A two-phase algorithm for frequency assignment in cellular mobile systems , 1994 .

[31]  Roberto Montemanni,et al.  An Exact Algorithm for the Min-Interference Frequency Assignment Problem , 1999 .

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

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

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

[35]  Roberto Battiti,et al.  A randomized saturation degree heuristic for channel assignment in cellular radio networks , 2001, IEEE Trans. Veh. Technol..