.png){kind=icon}
Return
A tabu search algorithm for frequency assignment
.png){kind=icon}
PRE
AI
DOI：10.1007/BF02125459.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Journal
IF:
4.5
Papers:
8.0K
Citations:
2.1W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveShareSaveShareSave
View more