Skip to main content
SpringerLink
Log in

A surrogate constraint tabu thresholding implementation for the frequency assignmentproblem

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

Abstract

This paper presents a surrogate constraint tabu thresholding (SCTT) implementationfor solving the frequency assignment problem. The frequency assignment problem is animportant combinatorial optimisation problem that arises in telecommunications. The mainobjective is to assign radio frequencies to a number of communication links such that interferenceis minimised. Interference is minimised by satisfying a number of problem specificconstraints. The surrogate constraint is created by taking a weighted sum of the constraintsnot satisfied. SCTT is compared with a tabu thresholding method from the literature on a setof simulated but realistic test problems with respect to quality of the solution in a given timeperiod. Computational results show that SCTT is more efficient and effective for all the testproblems.

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. K.I. Aardal, A. Hipolito, C.P.M. van Hoesel, B. Jansen, C. Roos and T. Terlaky, A branch-and-cut algorithm for the frequency assignment problem, CALMA project, Delft and Eindhoven Universities of Technology, The Netherlands, 1995.

    Google Scholar 

  2. A. Bouju, J.F. Boyce, C.H.D. Dimitropoulos, G. vom Scheidt, J.G. Taylor, A. Likas, G. Papageorgiou and A. Stafylopatis, Intelligent search for the radio links frequency assignment problem, in: International Conference on Digital Signal Processing, Limassol, Cyprus, 1995, pp. 26-28.

  3. J.F. Boyce, C.H.D. Dimitropoulos, G. vom Scheidt and J.G. Taylor, GENET and tabu search for combinatorial optimization problems, in: World Congress on Neural Networks, Washington, DC, USA, 1995.

  4. D.J. Castelino, S. Hurley and N.M. Stephens, Solving frequency assignment problems using tabu search, Annals of Operations Research 63(1996)301-319.

    Google Scholar 

  5. D.J. Castelino and N.M. Stephens, Tabu thresholding for the frequency assignment problem, in: Meta-Heuristics: Theory and Applications, eds. I.H. Osman and J.P. Kelly, Kluwer Academic.

  6. 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. vol. E75-B,No. 6 (1992)476-486.

    Google Scholar 

  7. J.S. Cook and B.T. Han, Efficient heuristics for robot aquisition planning for a CIM system, OR Spectrum 17(1995)99.

    Google Scholar 

  8. W. Crompton, S. Hurley and N.M. Stephens, Frequency assignment using a parallel genetic algorithm, in: Proceedings of the IEE/IEEE Natural Algorithms in Signal Processing Workshop, vol. 2, 1993, pp. 26/1-26/8.

    Google Scholar 

  9. W. Crompton, S. Hurley and N.M. Stephens, A parallel genetic algorithm for frequency assignment problems, in: Proceedings of the IMACS/IEEE Conference on Signal Processing, Robotics and Neural Networks, Lille, France, 1994, pp. 81-84.

  10. F. Glover, A multiphase-dual algorithm for the zero-one integer programming problem, Operations Research 13(1965)879-919.

    Google Scholar 

  11. F. Glover, Surrogate constraints, Operations Research 16(1965)741-749.

    Google Scholar 

  12. F. Glover, Surrogate constraint duality in mathematical programming, Operations Research 23(1968)434-451.

    Google Scholar 

  13. F. Glover, D. Karney, D. Klingman and A. Napier, A computational study on start procedures, basis change criteria and solution algorithms for transportation problems, Management Science 20(1974)793-813.

    Google Scholar 

  14. F. Glover, Heuristics for integer programming using surrogate constraints, Decision Sciences 8(1977)156-166.

    Google Scholar 

  15. F. Glover, Tabu search — Part 1, ORSA Journal on Computing 1(1989)190-206.

    Google Scholar 

  16. F. Glover, Tabu search — Part 2, ORSA Journal on Computing 2(1990)4-32.

    Google Scholar 

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

  18. F. Glover, Tabu thresholding: improved search by nonmonotonic trajectories, ORSA Journal on Computing 7(1995)426-442.

    Google Scholar 

  19. W.K. Hale, Frequency assignment: Theory and applications, Proceedings of the IEEE 68(1980)1497-1514.

    Google Scholar 

  20. T.C. Hu, A.B. Khang and C.W.A. Tsao, Old bachelor acceptance. A new class of non-monotonic threshold accepting methods, ORSA Journal on Computing 7(1995)417.

    Google Scholar 

  21. A. Kapsalis, P. Chardaire, V.J. Rayward-Smith and G.D. Smith, The radio link frequency assignment: A case study using genetic algorithms, Evolutionary Computing 2, Lecture Notes in Computer Science 993, Springer, pp. 131-149.

  22. A. Kapsalis, V.J. Rayward-Smith and G.D. Smith, Using genetic algorithms to solve the radio link frequency assignment, in: Proceedings of the 2nd International Conference on Artificial Neural Networks and Genetic Algorithms, eds. D.W. Pearson, N.C. Steele and R.F. Albrecht, Springer, Ales, France, 1995, pp. 37-40.

    Google Scholar 

  23. A. Kapsalis and G.D. Smith, A meta genetic algorithm for the radio link frequency assignment problem, in: International Conference on Soft Computing, Reading, UK, 1996.

  24. R. Marti, An aggressive search procedure for the bipartite drawing problem, in: Meta-Heuristics: Theory and Applications, eds. I.H. Osman and J.P. Kelly, Kluwer Academic, pp. 97-113.

  25. A. Raychaudhuri, Optimal multiple interval assignments in frequency assignment and traffic phasing, Discrete Applied Mathematics 40(1992)319-332.

    Google Scholar 

  26. S. Tiourine, C. Hurkens and J.K. Lenstra, An overview of algorithmic approaches to frequency assignment problems, CALMA project, Department of Mathematics and Computing Science, Eindhoven University of Technology, Eindhoven, The Netherlands, 1995.

    Google Scholar 

  27. S. Tiourine, C. Hurkens and J.K. Lenstra, Frequency assignment by local search, CALMA project, Department of Mathematics and Computing Science, Eindhoven University of Technology, Eindhoven, The Netherlands, 1994.

    Google Scholar 

  28. P. Toth and D. Vigo, Heuristic algorithms for handicapped persons for the transportation problem, Working Paper DEIS-OR-95-7, D.E.I.S., Università di Bologna, Italy, 1995.

    Google Scholar 

  29. V. Valls, R. Marti and P. Lino, A tabu thresholding algorithm for arc crossing minimization in bipartite graphs, Annals of Operations Research 60(1996).

  30. J.P. Warners, T. Terlaky, C. Roos and B. Jansen, Potential reduction algorithms for the frequency assignment problem, Technical Report 95-98, Faculty of Technical Mathematics and Informatics, Delft University of Tehnology, Delft, The Netherlands, 1995.

    Google Scholar 

Download references

Authors
  1. D. Castelino
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. N. 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., Stephens, N. A surrogate constraint tabu thresholding implementation for the frequency assignmentproblem. Annals of Operations Research 86, 259–270 (1999). https://doi.org/10.1023/A:1018958819459

Download citation

  • Issue Date:

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

Keywords

Search

Navigation