| Article ID: | iaor20001732 |
| Country: | France |
| Volume: | 32 |
| Issue: | 1 |
| Start Page Number: | 75 |
| End Page Number: | 99 |
| Publication Date: | Jan 1998 |
| Journal: | RAIRO Operations Research |
| Authors: | Jiang M. |
| Keywords: | heuristics |
We are interested in heuristics for the set T-coloring problem, in order to solve a huge frequency allocation problem in civil aviation. The goal is to minimize the frequency bandwidth. Two heuristic methods are studied and tested: dynamic order and Tabu search. An hybridisation of these methods is used as well. The results show a swift convergence of the dynamic order, and the Tabu search is a good tool to improve solutions.