DocumentCode
1727433
Title
Fixed spectrum frequency assignment using natural algorithms
Author
Hurley, S. ; Smith, D.H.
Author_Institution
Univ. of Wales, UK
fYear
1995
Firstpage
373
Lastpage
378
Abstract
The frequency assignment problem, known to be NP-complete, is to find an assignment of radio frequencies to a set of transmitters in a region. The transmitters satisfy a large number of constraints. This paper presents a simulated annealing algorithm for determining such an assignment and compares the results with those obtained from a genetic algorithm. We report on our computational experiments in terms of quality of the solutions obtained for realistic, computer generated problem instances
Keywords
frequency allocation; genetic algorithms; simulated annealing; telecommunication computing; NP-complete; frequency assignment; genetic algorithm; natural algorithms; simulated annealing;
fLanguage
English
Publisher
iet
Conference_Titel
Genetic Algorithms in Engineering Systems: Innovations and Applications, 1995. GALESIA. First International Conference on (Conf. Publ. No. 414)
Conference_Location
Sheffield
Print_ISBN
0-85296-650-4
Type
conf
DOI
10.1049/cp:19951077
Filename
501700
Link To Document