Skip to main content
SpringerLink
Log in

A tabu search algorithm for frequency assignment

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

Abstract

This paper presents the application of a tabu search algorithm for solving the frequency assignment problem. This problem, known to be NP-hard, is to find an assignment of frequencies for a number of communication links, which satisfy various constraints. We report on our computational experiments in terms of computational efficiency and quality of the solutions obtained for realistic, computer-generated problem instances. The method is efficient, robust and stable and gives solutions which compare more favourably than ones obtained using a genetic algorithm.

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

Access this article

Log in via an institution

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. H. Beltran and D. Skorin-Kapov, On minimum cost isolated failure immune networks, Telecommun. Syst.(1994), to appear.

  2. J. Chakrapani and J. Skorin-Kapov, Massively parallel tabu search for the quadratic assignment problem, Ann. Oper. Res. 41(1993)207–230.

    Article  Google Scholar 

  3. K. Chiba, F. Takahata and M. Nohara, Theory and performance of frequency assignment schemes for carriers with different bandwidths under demand assignment SCPC/FDMA operation, IEICE Trans. Commun. E75-B(1992)476–486.

    Google Scholar 

  4. D. Costa, On the use of some known methods for t-colourings of graphs, Ann. Oper. Res. 41(1993)343–358.

    Article  Google Scholar 

  5. W. Crompton, S. Hurley and N.M. Stephens, Frequency assignment using a parallel genetic algorithm,Proc. IEE/IEEE Natural Algorithms in Signal Processing Workshop vol. 2 (1993) pp. 26/1–26/8.

    Google Scholar 

  6. W. Crompton, S. Hurley and N.M. Stephens, A parallel genetic algorithm for frequency assignment problems,Proc. IMACS/IEEE Conf. on Signal Processing, Robotics and Neural Networks, Lille, France (1994) pp. 81–84.

  7. R.L. Daniels and J.B. Mazzola, A tabu-search heuristic for the flexible resource flow shop scheduling problem, Ann. Oper. Res. 41(1993)207–230.

    Article  Google Scholar 

  8. M. Duque-Anton, D. Kunz and B. Rüber, Channel assignment for cellular radio using simulated annealing, IEEE Trans. Vehicular Technol. 42(1993)647–656.

    Article  Google Scholar 

  9. M.R. Garey and D.S. Johnson,Computers and Intractability, A Guide to the Theory of NP-Completeness (Freeman, 1979).

  10. F. Glover, Heuristics for integer programming using surrogate constraints, Dec. Sci. 8(1977)156–166.

    Google Scholar 

  11. F. Glover, Future paths for integer programming and links to artificial intelligence, Comp. Oper. Res. 13(1986)543–549.

    Google Scholar 

  12. F. Glover and C. McMillan, General employee scheduling problem: An integration of management science and artificial intelligence, Comp. Oper. Res. 15(1986)563–573.

    Article  Google Scholar 

  13. F. Glover, Tabu search - Part 1, ORSA J. Comp. 1(1989)190–206.

    Google Scholar 

  14. F. Glover, Tabu search - Part 2, ORSA J. Comp. 1(1990)4–32.

    Google Scholar 

  15. F. Glover, Least cost network design for a new service, Ann. Oper. Res. 33(1992) 351–362.

    Article  Google Scholar 

  16. F. Glover and M. Laguna, Tabu search, in:Modern Heuristic Techniques for Combinatorial Problems, ed. C.R. Reeves (Blackwell Scientific, 1993).

  17. W.K. Hale, Frequency assignment: theory and applications, Proc. IEEE 68(1980)1497–1514.

    Google Scholar 

  18. R. Mathar and J. Mattfeldt, Channel assignment in cellular radio networks, IEEE Trans. Vehicular Technol. 42(1993)647–656.

    Article  Google Scholar 

  19. B.H. Metzger, Spectrum management technique, presented at 38th National ORSA Meeting, Detroit, MI (1970).

  20. E.L. Mooney and R.L. Rardin, Tabu search for a class of scheduling problems, Ann. Oper. Res. 41(1993)253–278.

    Article  Google Scholar 

  21. I.H. Osman, Metastrategy simulated annealing and tabu search algorithms for vehicle routing problems, Ann. Oper. Res. 41(1993)421–451.

    Article  Google Scholar 

  22. I.H. Osman and N. Christofides, Capacitated clustering by hybrid simulated annealing and tabu search, Int. Trans. Oper. Res. 1(1994)317–336.

    Article  Google Scholar 

  23. I.H. Osman, Heuristics for the generalised assignment problem: simulated annealing and tabu search approaches, OR-Spektrum (1994), to appear.

  24. A. Raychaudhuri, Optimal multiple interval assignments in frequency assignment and traffic phasing, Discr. Appl. Math. 40(1992)319–332.

    Article  Google Scholar 

  25. F. Semet and E. Taillard, Solving real-life vehicle routing problems efficiently using tabu search, Ann. Oper. Res. 41(1993)469–488.

    Article  Google Scholar 

  26. J. Skorin-Kapov, Tabu search applied to the quadratic assignment problem, ORSA J. Comp. 2(1990)33–45.

    Google Scholar 

  27. D. Skorin-Kapov and J. Skorin-Kapov, On tabu search for the location of interacting hub facilities, Euro. J. Oper. Res. (1992).

  28. P. Soriano and M. Gendreau, Diversification strategies in tabu search algorithms for the maximum clique problem, Centre de Recherche sur les Transports, Publication 940, Université de Montréal (1993).

  29. E. Taillard, Robust taboo search for the quadratic assignment problem, Parallel Comp. 17(1991)443–455.

    Article  Google Scholar 

  30. E. Taillard, F. Glover and D. de Werra, A user's guide to tabu search, Ann. Oper. Res. 41(1993)3–28.

    Article  Google Scholar 

  31. S.R. Thangiah, I.H. Osman, R. Vinayagamoorthy and T. Sun, Algorithms for vehicle routing problems with time deadlines, Amer. J. Math. Manag. Sci. 13(1993)323–355.

    Google Scholar 

  32. D. de Werra and Y. Gay, Chromatic scheduling and frequency assignment, Discr. Appl. Math. 49(1994)165–174.

    Article  Google Scholar 

  33. J. Wesley Barnes, F. Glover and M. Laguna, Tabu search methods for a single machine scheduling problem, J. Int. Man. 2(1991)63–74.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Wales Cardiff, P.O. Box 916, CF2 3XF, Cardiff, UK

    D. J. Castelino, S. Hurley & N. M. Stephens

Authors
  1. D. J. Castelino
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. Hurley
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. N. M. Stephens
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Castelino, D.J., Hurley, S. & Stephens, N.M. A tabu search algorithm for frequency assignment. Ann Oper Res 63, 301–319 (1996). https://doi.org/10.1007/BF02125459

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02125459

Keywords

Search

Navigation