Abstract
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 experimented: 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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
