Models and solution techniques for frequency assignment problems

4OR

Volumn 1, Issue 4, 2003, Pages 261-317

  Aardal, Karen I ^a   van Hoesel, Stan P M ^b   Koster, Arie M C A ^c   Mannino, Carlo ^d   Sassano, Antonio ^d  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^b MAASTRICHT UNIVERSITY   (Netherlands)

^c ZUSE INSTITUTE BERLIN   (Germany)

^d SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Channel assignment; Exact methods; Frequency assignment; Heuristics; Models

Indexed keywords

EID: 84891657209     PISSN: 16194500     EISSN: 16142411     Source Type: Journal    
DOI: 10.1007/s10288-003-0022-6     Document Type: Article

References (125)

1. Aardal KI, Hipolito A, van Hoesel CPM, Jansen B (1996) A branch-and-cut algorithm for the frequency assignment problem. Research Memorandum 96/011, Maastricht University.
2. Aardal KI, Hurkens CAJ, Lenstra JK, Tiourine SR (2002) Algorithms for radio link frequency assignment: The CALMA project. Operations Research 50(6): 968-980.
3. Abril J, Comellas F, Cortés A, Ozón J, VaquerM (2000) A multi-agent system for frequency assignment in cellular radio networks. IEEE Transactions on Vehicular Technology 49(5): 1558-1565.
4. Adjakplé PM, Jaumard B (1997) Greedy and tabu search heuristics for channel block assignment in cellular systems. Technical Report G-97-45, École Polytechnique de Montréal.
5. Al-Khaled FS (1998) Optimal radio channel assignment through the new binary dynamic simulated annealing algorithm. International Journal of Communication Systems 11: 327-336.
6. Allen SM, Smith DH, Hurley S (1999) Lower bounding techniques for frequency assignment. Discrete Mathematics 197/198: 41-52.
7. Anderson LG (1973) A simulation study of some dynamic channel assignment algorithms in a high capacity mobile telecommunications system. IEEE Transactions on Communications 21: 1294-1301.
8. AvenaliA, Mannino C, SassanoA (2002) Minimizing the span of d-walks to compute optimum frequency assignments. Mathematical Programming 91(2): 357-374. Previously published as techincal report 04-00, DIS-Universitá di Roma "La Sapienza", Rome, Italy.
9. Baybars I (1982) Optimal assignment of broadcasting frequencies. European Journal of Operations Research 9: 257-263.
10. Beckmann D, Killat U (1999a) Frequency planning with respect to interference minimization in cellular radio networks. Technical Report TD(99) 032, COST 259, Vienna, Austria.
11. Beckmann D, Killat U (1999b) A new strategy for the application of genetic algorithms to the channelassignment problem. IEEE Transactions on Vehicular Technology 48(4): 1261-1269.
12. Bell-Mobility website (1998) Frequency assignment benchmarks Canadian urban areas. URL: http://www. crt. umontreal. ca/-brigitt/telecom/TEST_PROBS/prob1. html.
13. van Benthem HP (1995) GRAPH generating radio link frequency assignment problems heuristically. Master's thesis, Delft University of Technology.
14. Bodlaender HL (1997) Treewidth: Algorithmic techniques and results. Lecture Notes in Computer Science 1295: 29-36. Proceedings 22nd International Symposium on Mathematical Foundations of Computer Science, MFCS'97.
15. Borgne L (1994) Automatic frequency assignment for cellular networks using local search heuristics. Master's thesis, Uppsala University.
16. Borndörfer R, Eisenblätter A, Grötschel M, Martin A (1998a) Frequency assignment in cellular phone networks. Annals of Operations Research 76: 73-93.
17. Borndörfer R, Eisenblätter A, Grötschel M, Martin A (1998b) The orientation model for frequency assignment problems. Technical Report TR 98-01, Konrad-Zuse-Zentrum für Informationstechnik Berlin.
18. Bouju A, Boyce JF, Dimitropoulos CHD, Vom Scheidt G, Taylor JG (1995) Tabu search for the radio links frequency assignment problem. In: Applied Decision Technologies (ADT'95), London.
19. Bouju A, Boyce JF, Dimitropoulos CHD, Vom Scheidt G, Taylor JG, Likas A, Papageorgiou G, StafylopatisA (1995) Intellegent search for the radio links frequency assignment problem. In: Int. Conf. For Digital Signal Processing (DSP'95), Limassol, Cypres.
20. Box F (1978) A heuristic technique for assigning frequencies to mobile radio nets. IEEE Transactions on Vehicular Technology 27: 57-74.
21. BrélazD (1979) Newmethods to color the vertices of a graph. Communications of the ACM22: 251-256.
22. Cabon B, De Givry S, Lobjois L, Schiex T, Warners JP (1999) Benchmarks problems: Radio link frequency assignment. Constraints 4: 79-89.
23. CALMA website (1995) EUCLID CALMA project. Publications and instances available at FTP Site: ftp://ftp. win. tue. nl/pub/techreports/CALMA/.
24. Caminada A (2000) CNET France Telecom frequency assignment benchmark. URL: http://www. cs. cf. ac. uk/User/Steve. Hurley/f_bench. htm.
25. Capone A, Trubian M (1999) Channel assignment problem in cellular systems: a new model and a tabu search algorithm. IEEE Transactions on Vehicular Technology 48(4): 1252-1260.
26. Carlsson M, Grindal M (1993) Automatic frequency assignment for cellular telephones using constraint satisfaction techniques. In: Proceedings of the Tenth International Conference on Logic Programming, pp 648-665.
27. Castelino DJ, Hurley S, StephensNM (1996) A tabu search algorithm for frequency assignment. Annals of Operations Research 63: 301-319.
28. Chang K-N, Kim S (1997) Channel allocation in cellular radio networks. Computers and Operations Research 24(9): 849-860.
29. Christofides N (1975) Graph Theory: An Algorithmic Approach. Academic Press, London.
30. Correia LM (ed) (2001) Wireless Flexible Personalized Communications-COST 259: European Cooperation in Mobile Radio Research. COST Action 259-Final Report. Wiley, NewYork.
31. Costa D (1993) On the use of some known methods for t-colourings of graphs. Annals of Operations Research 41: 343-358.
32. Cozzens MB, Roberts FS (1982) T-colorings of graphs and the channel assignment problem. Congressus Numerantium 35: 191-208.
33. Crisan C, Mühlenbein H (1998) The breeder genetic algorithm for frequency assignment. Lecture Notes in Computer Science 1498: 897-906.
34. Crompton W, Hurley S, Stephens NM (1994) A parallel genetic algorithm for frequency assignment problems. In: Proceedings IMACS/IEEEInt. Symp. on Signal Processing, Robotics and Neural Networks, pp 81-84. Lille, France.
35. Cuppini M (1994) A genetic algorithm for channel assignment problems. European Transactions on telecommunications and related technologies 5: 285-294.
36. Del Re E, Fantacci R, Ronga L (1996) A synamic channel allocaiton technique based on hopfield neural networks. IEEE Transactions on Vehicular Technology 45: 26-32.
37. Dorne R, Hao J-K (1995) An evolutionary approach for frequency assignment in cellular radio networks. In: IEEE Int. Conference on Evolutionary Computing, Perth, Australia.
38. Dorne R, Hao J-K (1996) Constraint handling in evolutionary search: A case study of the frequency assignment. Lecture Notes in Computer Science 1141: 801-810.
39. Dorne R, Hao J-K (1998) A new genetic local search algorithm for graph coloring. Lecture Notes in Computer Science 1498: 745-754.
40. Dunkin N, Allen SM (1997) Frequency assignment problems: Representations and solutions. Technical Report CSD-TR-97-14, Royal Holloway, University of London.
41. Dunkin N, Bater J, Jeavons P, Cohen D (1998) Towards high order constraint representations for the frequency assignment problem. Technical Report CSD-TR-98-05, Royal Holloway University of London.
42. Duque-Antón M, Kunz D, Rüber B (1993) Channel assignment for cellular radio using simulated annealing. IEEE Transactions on Vehicular Technology 42: 14-21.
43. EisenblätterA (2001) Frequency Assignment in GSM Networks: Models, Heuristics, and Lower Bounds. PhD thesis, Technische Universität Berlin, Berlin, Germany.
44. EisenblätterA, Grötschel M, KosterAMCA (2002) Frequency assignment and ramifications of coloring. Discussiones Mathematicae Graph Theory 22: 51-88.
45. Erdo{double acute}s P, Rubin AL, Taylor H (1979) Choosability in graphs. Congressus Numerantium 26: 125-157.
46. FAP web (2000-2003) A website devoted to frequency assignment. URL: http://fap. zib. de. Maintained by A. Eisenblätter and A. M. C. A. Koster.
47. Fischetti M, Lepschy C, Minerva G, Romanin-Jacur G, Toto E (2000) Frequency assignment in mobile radio systems using branch-and-cut techniques. European Journal of Operational Research 123: 241-255. Previously published as technical report of the Universita di Padova.
48. Funabiki N, Takefuji Y (1992) A neural network parallel algorithm for channel assignment problems in cellular radio networks. IEEE Transactions on Vehicular Technology 41: 430-437.
49. GamstA (1986) Some lower bounds for a class of frequency assignment problems. IEEE Transactions on Vehicular Technology 35: 8-14.
50. Gamst A (1991) Application of graph theoretical methods to GSM radio network planning. In: Proceedings of IEEE International Symposium on Circuits and Systems, vol 2, pp 942-945.
51. Gamst A, Rave W (1982) On frequency assignment in mobile automatic telephone systems. In: Proceedings of GLOBECOM'82. IEEE.
52. GiortzisAI, Turner LF (1997) Application of mathematical programming to the fixed channel assignment problem in mobile radio networks. IEE Proceedings-Communications 144: 257-264.
53. Hale WK (1980) Frequency assignment: Theory and applications. Proceedings of the IEEE 68: 1497-1514.
54. Hao J-K, Dorne R (1996) Study of genetic search for the frequency assignment problem. Lecture Notes in Computer Science 1063: 333-344.
55. Hao J-K, Dorne R, Galinier P (1998) Tabu search for frequency assignment in moblie radio networks. Journal of Heuristics 4: 47-62.
56. Hao J-K, Perrier L (1999) Tabu search for the frequency assignment problem in cellular radio networks. Technical Report LGI2P, EMA-EERIE, Parc Scientifique Georges Besse, Nimes, France.
57. Hellebrandt M, Heller H (2000) A new heuristic method for frequency assignment. Technical Report TD(00) 003, COST 259, Valencia, Spain.
58. Hurley S, Smith DH (2002) Meta-heuristics and channel assignment. In: Leese R, Hurley S (eds) Methods and Algorithms for Radio Channel Assignment, chap 3. Oxford University Press.
59. Hurley S, Smith DH, Thiel SU (1997) FASoft: A system for discrete channel frequency assignment. Radio Science 32: 1921-1939.
60. Jaimes-Romero FJ, Munoz-Rodriguez D, Tekinay S (1996) Channel assignment in cellular systems using genetic algorithms. In: Proceedings of the 46th IEEE Vehicular Technology Conference, pp 741-745. Atlanta, USA.
61. Janssen J, Kilakos K (1999) An optimal solution to the "Philadelphia" channel assignment problem. IEEE Transactions on Vehicular Technology 48(3): 1012-1014. Previously published as report CDAM-96-16, London School of Economics.
62. Janssen J, Wentzell T (2000) Lower bounds from tile covers for the channel assignment problem. Technical Report G-2000-09, GERAD, HEC, Montreal, Canada.
63. Jaumard B, Marcotte O, Meyer C (1998) Estimation of the quality of cellular networks using column generation techniques. Technical Report G-98-02, Ecole Polytechnique de Montréal.
64. Jaumard B, Marcotte O, Meyer C (1999) Mathematical models and exact methods for channel assignment in cellular networks. In: Sansáo B, Soriano P (eds) Telecommunications Network Planning, chap 13, pp 239-255. Kluwer Academic Publishers, Boston.
65. Jaumard B, Marcotte O, Meyer C, Vovor T (2002) Comparison of column generation models for channel assignment in cellular networks. Discrete Applied Mathematics 118: 299-322. Previously published as technical report of Ecole Polytechnique de Montréal.
66. Kapsalis A, Chardaire P, Rayward-Smith VJ, Smith GD (1995) The radio link frequency assignment problem: A case study using genetic algorithms. Lecture Notes on Computer Science 993: 117-131.
67. Karmarkar N, Resende MGC, Ramakrishnan KG (1991) An interior point algorithm to solve computationally difficult set covering problems. Mathematical Programming 52: 597-618.
68. Katzela I, Naghshineh M (1996) Channel assignment schemes for cellular mobile telecommunication systems. Personal Communications Magazine 3(3): 10-31.
69. Kazantzakis MG, Demestichas PP, Anagnostou ME (1995) Optimum frequency reuse in mobile telephone systems. International Journal of Communications Systems 8: 185-190.
70. Kim J-S, Park S, Dowd P, Nasrabadi N (1996) Cellular radio channel assignment using a modified hopfield network. IEEE transactions on vehicular technology 46(4): 957-967.
71. Knälmann A, QuellmalzA (1994) Solving the frequency assignment problem with simulated annealing. IEE conference publication 396: 233-240.
72. Kolen AWJ (1999) A genetic algorithm for frequency assignment. Technical report, Maastricht University.
73. KolenAWJ, van Hoesel CPM, van derWal R (1994) A constraint satisfaction approach to the radio link frequency assignment problem. Technical Report 2. 2. 2, EUCLID CALMA project.
74. KosterAMCA (1999) Frequency Assignment-Models and Algorithms. PhD thesis, Maastricht University.
75. KosterAMCA, van Hoesel CPM, KolenAWJ (1998) The partial constraint satisfaction problem: Facets and lifting theorems. Operations Research Letters 23(3-5): 89-97.
76. Koster AMCA, van Hoesel CPM, Kolen AWJ (1999) Solving frequency assignment problems via tree-decomposition. Technical Report RM 99/011, Maastricht University.
77. KosterAMCA, van Hoesel CPM, KolenAWJ (2001) Lower bounds for minimum interference frequency assignment problems. Ricerca Operativa 30(94-95): 101-116. Previously published as Research Memorandum 99/026, Universteit Maastricht; available at http://www. zib. de/koster/http://www. zib. de/koster.
78. Kunz D (1991) Channel assignment for cellular radio using neural networks. IEEE Transactions on Vehicular Technology 40: 188-193.
79. LaiWK, CoghillGG (1996) Channel assignment through evolutionary optimization. IEEE Transactions on Vehicular Technology 45: 91-95.
80. Leese R, Hurley S (eds) (2002) Methods and Algorithms for Radio Channel Assignment. Oxford Lecture Series in Mathematics and its Applications. Oxford University Press, Oxford, United Kingdom.
81. Maniezzo V, Carbonaro A (2000) An ants heuristic for the frequency assignment problem. Future Generation Computer Systems 16: 927-935.
82. Maniezzo V, Montemanni R (2000) An exact algorithm for the min-interference frequency assignment problem. Technical Report WP-CO0003, Scienze dell'Informazione, University of Bologna, Cesena, Italy.
83. Mannino C, Oriolo G, SassanoA (2000)Weighted stable set problem in k-thin graphs. Technical Report 09-00, Universitá di Roma "La Sapienza".
84. Mannino C, SassanoA (2003)An enumerative algorithm for the frequency assignment problem. Discrete Applied Mathematics 129(1): 155-169.
85. Mathar R, Mattfeldt J (1993) Channel assignment in cellular radio networks. IEEE Transactions on Vehicular Technology 42: 647-656.
86. Mehrotra A, Trick MA (1996) A column generation approach for graph coloring. INFORMS Journal on Computing 8: 344-354.
87. Metzger BH (1970) Spectrum management technique. Presentation at 38th National ORSA meeting (Detroit, MI).
88. Montemanni R, Smith DH, Allen SM (2002a) An ANTS algorithm for the minimum-span frequencyassignment problem with multiple interference. IEEE Transactions on Vehicular Technology 15(5): 949-953.
89. Montemanni R, Smith DH, Allen SM (2002b) Lower bounds for fixed spectrum frequency assignment. Annals of Operations Research 107(1-4): 237-250.
90. Murphey RA, Pardalos PM, Resende MGC (1999) Frequency assignment problems. In: Du D-Z, Pardalos PM (eds) Handbook of combinatorial optimization, vol Supplement Volume A. Kluwer Academic Publishers.
91. Nemhauser GL, Wolsey LA (1988) Integer and Combinatorial Optimization. Wiley, NewYork.
92. Ngo CY, Li VOK (1998) Fixed channel assignment in cellular radio networks using a modified genetic algorithm. IEEE Transactions on Vehicular Technology 47: 163-171.
93. Nielsen TT, Wigard J (2000) Performance Enhancements in a Frequency Hopping GSM Network. Kluwers Academic Publishers.
94. Padberg M (1989) The boolean quadric polytope: Some characteristics, facets and relatives. Mathematical Programming 45: 139-172.
95. Papadimitriou CH, Steiglitz K (1982) Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, New Jersey.
96. ParkT, LeeCY (1996) Application of the graph coloring algorithm to the frequency assignment problem. Journal of the Operations Research Society of Japan 39: 258-265.
97. Petford A, Welsh D (1989) A randomised 3-colouring algorithm. Discrete Mathematics 74: 253-261.
98. Quellmalz A, Knälmann A, Müller B (1995) Efficient frequency assignment with simulated annealing. IEE conference publication 407(2): 301-304.
99. RADIO website (1998) Radio-broadcasting frequency assignment instances. URL: ftp://ftp. dis. uniroma1. it/PUB/OR/mannino/freq/inst/radio/.
100. RaychaudhuriA (1994) Further results on t-coloring and frequency assignment problems. SIAM Journal on Discrete Mathematics 7(4): 605-613.
101. ROADEF website (2000) ROADEF Challenge 2001. URL: http://www. prism. uvsq. fr/-vdc/ROADEF/CHALLENGES/2001/.
102. Roberts FS (1991) t-colorings of graphs: Recent results and open problems. Discrete Mathematics 93: 229-245.
103. Rouskas AN, Kazantzakis MG, Anagnostou ME (1995) Optimal channel assignment in cellular networks. International Journal of Communication Systems 8: 359-364.
104. Rushforth CK, Wang W (1997) Local search for channel assignment in cellular mobile networks. In: DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol 35, pp 89-709. American Mathematical Society.
105. Sandalidis HG, Stavroulakis PP, Rodriguez-Tellez J (1999) Borrowing channel assignment strategies based on heuristic techniques for cellular systems. IEEE Transactions on Neural Networks 10: 176-181.
106. KN Sivarajan, McEliece RJ, Ketchum JW (1989) Channel assignment in cellular radio. In: Proceedings of the 39th IEEE Vehicular Technology Conference, pp 846-850.
107. Smith DH, Allen SM, Hurley S (2002) Characteristics of good meta-heuristic algorihtms for the frequency assignment problem. Annals of Operations Research 107(1-4): 285-301.
108. Smith DH, Hurley S, Thiel SU (1998) Improving heuristics for the frequency assignment problem. European Journal of Operational Research 107: 76-86.
109. Smith DH, Taplin RK, Hurley S (2001) Frequency assignment with complex co-site constraints. IEEE Transaction on Electromagnetic Compatibility 43(2): 210-218.
110. Smith KA, PalaniswamiM (1997) Static and dynamic channel assignment using neural networks. IEEE Journal on Selected Areas in Communications 15: 238-249.
111. Sung CW, WongWS (1997) Sequential packing algorithm for channel assignment under cochannel and adjacent channel interference constraint. IEEE Transactions on Vehicular Technology 46: 676-685.
112. Tcha D, ChungY, Choi T (1997) A new lower bound for the frequency assignment problem. IEEE/ACM Transactions on Networking 5: 34-39.
113. Thuve H (1981) Frequency planning as a set partitioning problem. European Journal of Operational Research 6: 29-37.
114. Tiourine SR, Hurkens CAJ, Lenstra JK (1995) An overview of algorithmic approaches to frequency assignment problems. In: Calma Symposium on Combinatorial Algorithms for Military Applications, pp 53-62.
115. Tsang E, Voudouris C (1998) Solving the radio link frequency assignment problem using guided local search. In: NATO Symposium on Radio Length Frequency Assignment. Aalborg, Denmark. http://cswww. essex. ac. uk/CSP/papers. html.
116. Valenzuela C, Hurley S, Smith DH (1998) A permutation based genetic algorithm for minimum span frequency assignment. Lecture Notes in Computer Science 1498: 907-916.
117. Verfaillie G, Lemaître M, Schiex T (1996) Russian doll search for solving constraint optimization problems. In: Proceedings of the 13th National Conference on Artificial Intelligence (AAAI-96), pp 181-187. Portland, OR, USA.
118. Vizing VG (1965) Critical graphs with given chromatic class (russian). Diskret. Analiz 5: 9-17.
119. Walser JP (1996) Feasible cellular frequency assignment using constraint programming abstractions. In: Proceedings of the Workshop on Constraint Programming Applications (CP96), Cambridge, Massachusetts, USA.
120. WangW, Rushforth CK (1996) An adaptive local-search algorithm for the channel-assignment problem (CAP). IEEE Transactions on Vehicular Technology 45: 459-466.
121. Warners JP, Terlaky T, Roos C, Jansen B (1997) A potential reduction approach to the frequency assignment problem. Discrete Applied Mathematics 78: 251-282.
122. Yuan D, Björklund P, Värbrand P (2002) Optimal frequency planning in mobile networks with frequency hopping. Technical Report LiTH-ITN-R-2002-3, Linköping University, Norrköping, Sweden. submitted to Computers and Operations Research.
123. Zerovnik J (1997) Experiments with a randomized algorithm for a frequency assignment problem. Technical Report 97-27, Ecole Normale Supérieure de Lyon.
124. Zhang M, Yum TP (1991) The nonuniform compact pattern allocation algorithm for cellular mobile systems. IEEE Transactions on Vehicular Technology 40: 387-391.
125. Zoellner JA, Beall CL (1977) Abreakthrough in spectrum conserving frequency assignment technology. IEEE Transactions on Electromagnetic Compatiblity 19: 313-319.