S. Hurley
- 1.Castelino, D.J, Hurley, S. and Stephens, N.M., 1995, A Tabu Search Algorithm for Frequency Assignment, to appear Annals of Operations Research.Google Scholar
- 2.Costa, D., 1993, On the use of some known methods for t-colourings of graphs, Annals of Operations Research, 41, pp 343-358. Google ScholarDigital Library
- 3.Crompton, W., Hurley, S. and Stephens, N.M., 1993, Frequency assignment using a parallel genetic algorithm, Proceedings of the IEE/IEEE Natural Algorithms in Signal Processing Workshop, 2, pp 26/1- 26/8.Google Scholar
- 4.Crompton, W., Hurley, S. and Stephens, N.M., 1994, A parallel genetic algorithm for frequency assignment problems, Proceedings of the IMAC$/IEEE Conference on Signal Processing, Robotics and Neural Networks, (Lille, France) pp 81-84.Google Scholar
- 5.Glover, F., Taillard E. and de Werra D., 1993, A User's Guide to Tabu Search, Annals of Operations Research, Vol 41, pp 3-28. Google ScholarDigital Library
- 6.Goldberg, D.E., 1989, Genetic Algorithms in $erach, Optimization, and Machine Learning, Addison- Wesley, Reading, MA. Google ScholarDigital Library
- 7.Gordon V.S. and Whitley D., 1993, Serial and Parallel Genetic Algorithms as Function Optimizers, Proc. 5th Int. Conf. on Genetic Algorithms, pp 177-183. Google ScholarDigital Library
- 8.Hale W.K., 1981, New Spectrum Management Techniques, iEEE international Symposium on Electromagnetic Compatibility, Boulder Colorado, pp 47-53.Google Scholar
- 9.Holland, J.H., 1975, Adaption in Natural and Artificial Systems, University of Michigan Press, Ann Arbor. Google ScholarDigital Library
- 10.Kirkpatrick, S., Gelatt C.D. and Vecchi M.D., 1983, Optimisation by Simulated Annealing, Science, Vol 220, No 4598, pp 671-680.Google ScholarCross Ref
Index Terms
- A comparison of local search algorithms for radio link frequency assignment problems
Recommendations
Local search algorithms for the k-cardinality tree problem
In this paper we deal with an NP-hard combinatorial optimization problem, the k-cardinality tree problem in node-weighted graphs. This problem has several applications, which justify the need for efficient methods to obtain good solutions. We review ...
A modified VNS metaheuristic for max-bisection problems
Variable neighborhood search (VNS) metaheuristic as presented in Festa et al. [Randomized heuristics for the MAX-CUT problem, Optim. Methods Software 17 (2002) 1033-1058] can obtain high quality solution for max-cut problems. Therefore, it is worthwhile ...
Heuristic manipulation, tabu search and frequency assignment
Heuristic manipulation attempts to modify the search space of an optimization problem, using information provided by an underlying heuristic method. In this paper it is applied in combination with tabu search to the fixed spectrum frequency assignment ...
Comments