Skip to main content
Log in

Characteristics of Good Meta-Heuristic Algorithms for the Frequency Assignment Problem

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

Most writers on frequency assignment algorithms have described the details of a single algorithm, and evaluated the algorithm on selected data sets. There has been relatively little emphasis on describing the common features that are important if an algorithm is to have good performance. This paper describes the key features, with particular emphasis on algorithms for weighted fixed spectrum problems. The use of algorithms handling weighted constraints has become increasingly common in recent years. The advantages and disadvantages of weighting constraints are demonstrated.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. S.M. Allen, D.H. Smith and S. Hurley, Lower bounding techniques for frequency assignment, Discrete Math. 197/198 (1999) 41–52.

    Google Scholar 

  2. 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.

    Google Scholar 

  3. D. Beckmann and U. Killat, A new strategy for the application of genetic algorithms to the channelassignment problem, IEEE Trans. Vehicular Technology 48 (1999) 1261–1269.

    Google Scholar 

  4. CELAR Instances, ftp://ftp.win.tue.nl/pub/techreports/CALMA/Instances/ (see also http://fap.zib.de/).

  5. R. Dorne and J.-K. Hao, Tabu search for graph coloring, T-colorings and set T-colorings, in: Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, eds. A. Voss, S. Martello, I.H. Osman and C. Roucairol (Kluwer Academic, 1999) pp. 77-92.

  6. FAP web: http://fap.zib.de/

  7. A. Gamst, Some lower bounds for a class of frequency assignment problems, IEEE Trans. Vehicular Technology 35 (1986) 8–14.

    Google Scholar 

  8. P. Hansson, C. Lewer-Allen and J. Samuelsson, Breakthroughs in frequency planning, Mobile Communications International (December 97/January 98) 89-90.

  9. J.-K. Hao, R. Dorne and P. Galinier, Tabu search for frequency assignment in mobile radio networks, J. Heuristics 4 (1998) 47–62.

    Google Scholar 

  10. S. Hurley, D.H. Smith and S.U. Thiel, FASoft: A system for discrete channel frequency assignment, Radio Sci. 32(5) (1997) 1921–1939.

    Google Scholar 

  11. S. Hurley, D.H. Smith and C. Valenzuela, A permutation based genetic algorithm for minimum span frequency assignment, in: Proceedings 5th International Conference on Problem Solving from Nature, Lecture Notes in Computer Science, Vol. 1498, eds. A.E. Eiben, T. Bäck, M. Schoenauer and H.-P. Schwefel (Springer, 1998) pp. 907-916.

  12. S. Hurley, R.M. Whitaker and D.H. Smith, Channel assignment in cellular networks without channel separation constraints, in: Proc. IEEE Vehicular Technology Conference (Fall, 2000) pp. 1714-1718.

  13. A.W.J. Kolen, A genetic algorithm for frequency assignment, Technical report, University of Maastricht (1999). Available at http://www.unimaas.nl/~akolen.

  14. V. Maniezzo, A. Carbonaro and R. Montemanni, An approach to frequency assignment based on an ANTS heuristic, in: Proceedings of the 3rd Metaheuristics International Conference, MIC '99, Rio de Janeiro, Brazil (1999) pp. 311-316.

  15. D.H. Smith, S.M. Allen, S. Hurley and W.J. Watkins, Frequency assignment problems with multiple interference (submitted).

  16. D.H. Smith, S.M. Allen, S. Hurley and W.J. Watkins, Frequency assignment: methods and algorithms, in: Proceedings of the NATO RTA SET/ISET Symposium on Frequency Assignment, Sharing and Conservation in Systems (Aerospace), Aalborg, Denmark, October 1998, NATO RTO-MP-13 (1999) pp. K-1–K-18.

  17. D.H. Smith and S. Hurley, Bounds for the frequency assignment problem, Discrete Math. 167/168 (1997) 571–582.

    Google Scholar 

  18. D.H. Smith, S. Hurley and S.U. Thiel, Improving heuristics for the frequency assignment problem, European J. Operational Research 107(1) (1998) 76–86.

    Google Scholar 

  19. D.H. Smith, R.K. Taplin and S. Hurley, Frequency assignment with complex co-site constraints, IEEE Transactions on Electromagnetic Compatibility 43(2) (2001) 210–218.

    Google Scholar 

  20. S.U. Thiel, S. Hurley and D.H. Smith, Frequency assignment algorithms, Technical report, University of Cardiff/University of Glamorgan (1997).

  21. W.J. Watkins, S. Hurley and D.H. Smith, Evaluation of models for area coverage, Research report 98003, University of Cardiff (1998).

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Smith, D., Allen, S. & Hurley, S. Characteristics of Good Meta-Heuristic Algorithms for the Frequency Assignment Problem. Annals of Operations Research 107, 285–301 (2001). https://doi.org/10.1023/A:1014919603430

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1014919603430

Navigation