Algorithms for radio link frequency assignment: The CALMA project

Operations Research

Volumn 50, Issue 6, 2002, Pages 968-980

  Aardal, Karen ^a   Hurkens, Cor ^b   Lenstra, Jan Karel ^b   Tiourine, Sergey ^b  

^a UTRECHT UNIVERSITY   (Netherlands)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; CONSTRAINT THEORY; FREQUENCIES; GENETIC ALGORITHMS; NEURAL NETWORKS; RADIO INTERFERENCE;

RADIO LINK FREQUENCY;

RADIO LINKS;

EID: 0036878098     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.50.6.968.353     Document Type: Article

References (50)

1. Aardal, K. I., C. P. M. van Hoesel. 1996. Polyhedral techniques in combinatorial optimization I: Theory. Statistica Neerlandica 50 3-26.
2. _, _. 1999. Polyhedral techniques in combinatorial optimization II: Computations and applications. Statistica Neerlandica 53 129-178.
3. _, _, A. Hipolito, B. Jansen. 1998. Modeling and solving a frequency assignment problem. Manuscript, Department of Computer Science, Utrecht University, Utrecht, The Netherlands.
4. Aarts, E. H. L., J. K. Lenstra, eds. 1997. Local Search in Combinatorial Optimization. Wiley, Chichester, U.K.
5. Allen, S. M., D. H. Smith, S. Hurley. 1999. Lower bounding techniques for frequency assignment. Discrete Math. 197/198 41-52.
6. Bensana, E., T. Schiex. 1995. Partial constraint satisfaction. Technical report CALMA 2.2.3, Centre d'Etudes et de Recherches de Toulouse, Toulouse, France
7. Bouju, A., J. F. Boyce, C. H. D. Dimitropoulos, G. vom Scheidt, J. G. Taylor. 1994. Tabu search and GENET. Technical report CALMA 2.3.4, Centre d'Etudes et de Recherches de Toulouse, Toulouse, France. Also available at 〈http://www.win.tue.nl/̃wscor/calma.html〉.
8. Bourret, P. 1995. Simulated annealing. Technical report CALMA 2.3.1, Centre d'Etudes et de Recherches de Toulouse, France.
9. Cabon, B., S. de Givry, L. Lobjois, T. Schiex, J. P. Warners. 1999. Radio frequency assignment benchmarks. Constraints 4 79-89.
10. Castelino, D. J., S. Hurley, N. M. Stephens. 1996. A tabu search algorithm for frequency assignment. Ann. Oper. Res. 63 301-319.
11. Chardaire, P., A. Kapsalis, J. W. Mann, V. J. Rayward-Smith, G. D. Smith. 1995. Applications of genetic algorithms in telecommunications. J. Alspector, R. Goodman, T. X. Brown, eds. Proceedings of the International Workshop on Applications of Neural Networks to Telecommunication 2. Lawrence Erlbaum, Hillsdale, NJ, 290-299.
12. Crisan, C., H. Mühlenbein. 1998. The frequency assignment problem: A look at the performance of evolutionary search. Lecture Notes in Computer Science 1363. Springer, Berlin, Germany, 263-274.
13. Dimitropoulos, C. H. D. 1998. Private communication 〈hcd@phalcon.ph.kcl.ac.uk〉.
14. Eisenblätter, A. 2000. Frequency assignment in GSM networks: Models, heuristics, and lower bounds. Ph.D. thesis, Technische Universität Berlin, Berlin, Germany.
15. _, A., M. C. A. Koster. 2000. FAP website 〈http://fap.zib.de〉.
16. Fischetti, M., C. Lepschy, G. Minerva, G. Romanin-Jacur, E. Toto. 2000. Frequency assignment in mobile radio systems using branch-and-cut techniques. Eur. J. Oper. Res. 123 241-255.
17. Hajema, W., M. Minoux, C. West. 1993. Statement of the radio link frequency assignment problem. Request for proposals on the CALMA project, technical appendix. Ministry of Defense, The Hague, The Netherlands.
18. Hale, W. K. 1980. Frequency assignment: Theory and applications. Proc. IEEE 68 1497-1514.
19. Hao, J.-K., R. Dorne, P. Galinier. 1998. Tabu search for frequency assignment in mobile radio networks. J. Heuristics 4 47-62.
20. Hurley, S., S. H. Smith, S. U. Thiel. 1997. FASoft: A system for discrete channel frequency assignment. Radio Sci. 32 1921-1939.
21. Kamath, A. P., N. K. Karmarkar, K. G. Ramakrishnan, M. G. C. Resende. 1990. Computational experience with an interior point algorithm on the satisfiability problem. Ann. Oper. Res. 25 43-58.
22. Karmarkar, N., M. G. C. Resende, K. G. Ramakrishnan. 1991. An interior point algorithm to solve computationally difficult set covering problems. Math. Programming 52 597-618.
23. Katzela, I., M. Naghshineh. 1996. Channel assignment schemes for cellular mobile telecommunication systems: A comprehensive survey. IEEE Personal Comm. 3.3 10-31.
24. Kernighan, B. W., S. Lin. 1970. An efficient heuristic procedure for partitioning graphs. Bell System Technical J. 49 291-307.
25. Kolen, A. W. J. 1999. A genetic algorithm for frequency assignment. Technical report, Universiteit Maastricht, Maastricht, The Netherlands. Also available at 〈http://www.unimaas.nl/̃akolen〉.
26. _, C. P. M. van Hoesel. 1995. Constraint satisfaction. Technical report CALMA 2.2.2, Centre d'Etudes et de Recherches de Toulouse, Toulouse, France. Also available at 〈http://www.win.tue.nl/̃wscor/calma.html〉.
27. Koster, A. M. C. A. 1999. Frequency Assignment-Models and Algorithms. Ph.D. thesis, Universiteit Maastricht, Maastricht, The Netherlands.
28. _, C. P. M. van Hoesel, A. W. J. Kolen. 1999. Solving frequency assignment problems via tree-decomposition. Technical report RM 99/011, Universiteit Maastricht, Maastricht, The Netherlands. Also available at 〈http://www.unimaas.nl/̃akoster〉.
29. Lau, T. L., E. P. K. Tsang. 1998. Solving the radio link frequency assignment problem with the guided genetic algorithm. Proc. NATO Res. and Technology Organization Meeting 13: Frequency Assignment, Sharing and Conservation in Systems (Aerospace). Aalborg, Denmark, 14b1-14b27.
30. Lin, S., B. W. Kernighan. 1973. An effective heuristic algorithm for the traveling-salesman problem. Oper. Res. 21 498-516.
31. Mackworth, A. K. 1987. Constraint satisfaction. S. Shapiro, ed. Encyclopedia of Artificial Intelligence. Wiley, New York, 205-211.
32. Maniezzo, V., A. Carbonaro. 2000. An ANTS heuristic for the frequency assignment problem. Future Generation Comput. Systems 16 927-935.
33. _, _, R. Montemanni. 1999. An approach to frequency assignment problem based on an ANTS heuristic. Proc. 3rd Metaheuristic Inter. Conf. MIC'99. Angra dos Reis, Brazil.
34. Murphey, R. A., P. M. Pardalos, M. G. C. Resende. 1999. Frequency assignment problems. D.-Z. Du, P. M. Pardalos, eds. Handbook of Combinatorial Optimization A. Kluwer, Boston, MA, 295-377.
35. Nemhauser, G. L., L. A. Wolsey. 1988. Linear and Integer Optimization. Wiley, New York.
36. Nowicki, E., C. Smutnicki. 1996. A fast taboo search algorithm for the job shop problem. Management Sci. 42 797-813.
37. Padberg, M. W. 1973. On the facial structure of set packing polyhedra. Math. Programming 5 199-215.
38. Pasechnik, D. V. 1998. An interior point approximation algorithm for a class of combinatorial optimization problems: Implementations and enhancements. Technical report, Delft University of Technology, Delft, The Netherlands.
39. Rayward-Smith, V. J., G. McKeown, G. Smith, A. W. J. Kolen, P. Chardaire, A. Kapsalis, S. Rush. 1995. Genetic algorithms. Technical report CALMA 2.1.6, Centre d'Etudes et de Recherches de Toulouse, Toulouse, France.
40. Roberts, F. R. 1989. T-Colorings of graphs: recent results and open problems. Discrete Math. 93 229-245.
41. Robertson, N., P. Seymour. 1986. Graph minors. II. Algorithmic aspects of tree-width. J. Algorithms 7 309-322.
42. Tiourine, S. R., C. A. J. Hurkens, J. K. Lenstra. 2000. Local search algorithms for the radio link frequency assignment problem. Telecommunication Systems 13 293-314.
43. Tsang, E. P. K. 1993. Foundations of Constraint Satisfaction. Academic Press, New York.
44. _, C. J. Wang. 1992. A generic neural network approach for constraint satisfaction problems. J. Taylor, ed. Neural Network Applications. Springer, Berlin, Germany, 12-22.
45. Van Laarhoven, P. J. M., E. H. L. Aarts, J. K. Lenstra. 1992. Job shop scheduling by simulated annealing. Oper. Res. 40 113-125.
46. Vom Scheidt, G. 1995. Extension of GENET to partial constraint satisfaction problems and constraint satisfaction problems. Master's thesis, King's College, London, U.K.
47. Voudouris, C., E. Tsang. 1998. Solving the radio link frequency assignment problem using guided local search. Proc. NATO Res. and Technology Organization Meeting 13: Frequency Assignment, Sharing and Conservation in Systems (Aerospace). Aalborg, Denmark, 14a1-14a7.
48. Warners, J. P. 1998. A nonlinear approach to a class of combinatorial optimization problems. Statistica Neerlandica 52 162-184.
49. _, T. Terlaky, C. Roos, B. Jansen. 1997a. A potential reduction approach to the frequency assignment problem. Discrete Appl. Math. 78 251-282.
50. _, _, _, _. 1997b. Potential reduction algorithms for structured combinatorial optimization problems. Oper. Res. Lett. 21 55-64.