Improving heuristics for the frequency assignment problem

European Journal of Operational Research

Volumn 107, Issue 1, 1998, Pages 76-86

  Smith, D H ^a   Hurley, S ^b   Thiel, S U ^b  

^a UNIVERSITY OF GLAMORGAN   (United Kingdom)

^b CARDIFF UNIVERSITY   (United Kingdom)

Author keywords

Frequency assignment; Graph theory; Heuristics

Indexed keywords

GRAPH THEORY; HEURISTIC METHODS; OPTIMIZATION; PROBLEM SOLVING;

FREQUENCY ASSIGNMENT PROBLEMS;

FREQUENCY ALLOCATION;

EID: 0032070963     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(98)80006-4     Document Type: Article

References (25)

1. A. Bouju, J.F. Boyce, C.H.D. Dimitropoulos, G. vom Scheidt, J.G. Taylor, Tabu search for the radio links frequency assignment problem, Conference on Applied Decision Technologies: Modern Heuristic Methods, Brunel University, 1995, 233-250.
2. D.J. Castelino, S. Hurley, N.M. Stephens, A tabu search algorithm for frequency assignment. Annals of Operations Research 63 (1996) 301-319.
3. D. Costa, On the use of some known methods for T-colourings of graphs, Annals of Operations Research 41 (1993) 343-358.
4. W. Crompton, S. Hurley, N.M. Stephens, A parallel genetic algorithm for frequency assignment problems, Proc. IMACS/IEEE Conference on Signal Processing, Robotics and Neural Networks, Lille, France, 1994 81-84.
5. A. Gamst, Homogeneous distribution of frequencies n a regular hexagonal cell system, IEEE Transactions on Vehicular Technology 31 (1982) 132-144.
6. R. Leese, A unified approach to the assignment of radio channels on a regular hexagonal grid, IEEE Transactions on Vehicular Technology to appear.
7. A. Gamst, Some lower bounds for a class of frequency assignment problems, IEEE Transactions on Vehicular Technology 35 (1986) 8-14.
8. D.H. Smith, S. Hurley, Bounds for the frequency assignment problem, Discrete Mathematics 167/168 (1997) 571-582.
9. W.K. Hale, Frequency assignment: theory and applications, Proc. IEEE 68 (1980) 1497-1514.
10. E.S. Roberts, T-colorings of graphs: recent results and open problems. Discrete Mathematics 93 (1991) 229-245.
11. J.A. Zoellner, C.L. Beall, A breakthrough in spectrum conserving frequency assignment technology, IEEE Trans. on Electromagnetic Compatibility EMC-19 (1977) 313-319.
12. R.C. Prim, Shortest connection networks and some generalizations, Bell System Technical Journal 36 (1957) 1389-1401.
13. J. Janssen, K. Kilakos, Polyhedral analysis of channel assignment problems: (I) tours, CDAM Research Report, London School of Economics and Political Science CDAM-96-17 (1996).
14. B. Descartes, Solution to advanced problem number 4526, Amer. Math. Monthly 61 (1954) 352.
15. J. Mycielski, Sur le coloriage des graphs, Colloq. Math. 3 (1955) 161-162.
16. S. Hurley, D.H. Smith, S.U. Thiel, FASoft: A software system for discrete channel frequency assignment. Radio Science, to appear; http://www.cs.cf.ac.uk/User/Steve.Hurley/freq_pub.htm
17. P. Prosser, Hybrid Algorithms for the constraint satisfaction problem. Computational Intelligence 9 (3) (1993) 268-299.
18. W. K. Hale, New spectrum management tools, Proc. IEEE International Symposium on Electromagnetic Compatibility, 1981 47-53.
19. CELAR Data, ftp://ftp.es.city.ac.uk/pub/constraints/csp-benchmarks
20. R. Carraghan, P.M. Pardalos, An exact algorithm for the maximum clique problem, Operations Research Letters 9 (1990) 375-382.
21. M. Gendreau, P. Soriano and L. Salvail, Solving the maximum clique problem using a tabu search approach, Annals of Operations Research 41 (1993) 385-403.
22. T. Volgenant, R. Jonker, A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation, European Journal of Operational Research 9 (1982) 83-89; http://www.mathematik.uni-kl.de/ wwwwi/WWWWI/ ORSEP/contents.html ftp://www.mathematik.uni-k1.de/ pub/Math/ORSEP/VOLGENAN.ZIP
23. L.G. Anderson, A simulation study of some dynamic channel assignment algorithms in a high capacity mobile telecommunications system. IEEE Transactions on Communications 21 (1973) 1294-1301.
24. K.N. Sivarajan, R.J. McEliece, J.W. Ketchum, Channel assignment in cellular radio. Proceedings of the 39th Conference of the IEEE Vehicular Technology Society, 1989 846-859.
25. W. Wang, C.K. Rushforth, An adaptive local-search algorithm for the channel-assignment problem (CAP), IEEE Trans. on Vehicular Technology 45 (1996) 459-466.