| Article ID: | iaor19971397 |
| Country: | Netherlands |
| Volume: | 63 |
| Issue: | 1 |
| Start Page Number: | 301 |
| End Page Number: | 319 |
| Publication Date: | May 1996 |
| Journal: | Annals of Operations Research |
| Authors: | Hurley S., Castelino D.J., Stephens N.M. |
| Keywords: | tabu search |
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. The authors report on the present 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 favorably than ones obtained using a genetic algorithm.