APPLICATION OF THE GRAPH COLORING ALGORITHM TO THE FREQUENCY ASSIGNMENT PROBLEM

The frequency assignment problem is introduced and solved with efficient heuristics. The problem is to assign channels to transmitters using the smallest span of frequency band while satisfying the requested communication qua,lity. A solution procedure which is based on Kernighan-Lin's two way uniform pa.rtitioning procedure is developed for the k-coloring problem. The k-coloring algorithm is modified to solve the frequency assignment problem. The performance of the proposed algorithm is tested with randomly generated graphs with different number of nodes, density types and graph types. The computational result shows that the proposed algorithm gives far better solution than a well-known heuristic procedure.

[1]  Taehoon Park,et al.  On the k-coloring Problem , 1994 .

[2]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[3]  Frank Thomson Leighton,et al.  A Graph Coloring Algorithm for Large Scheduling Problems. , 1979, Journal of research of the National Bureau of Standards.

[4]  Dominique de Werra,et al.  Chromatic Scheduling and Frequency Assignment , 1994, Discret. Appl. Math..

[5]  Fred Glover,et al.  Tabu Search: A Tutorial , 1990 .

[6]  이채영,et al.  On the k-Coloring Problem , 1994 .