Frequency assignment with complex co-site constraints

The adaption of meta-heuristic algorithms such as tabu search and simulated annealing to large frequency assignment problems with complex co-site cons traints is described. The constraints considered include frequency separati on constraints, intermodulation product constraints and spurious emission a nd response constraints. Requests for frequencies can also be prioritised. The importance of fast evaluation of the quality of the current assignment by updating techniques is stressed, Additionally, a useful lower bound for assessing the quality of assignments is described.