The vertexes reduction algorithm for the channel assignment problem-comparison analysis

In this paper the vertexes reduction (VR) algorithm is compared to the four general-purpose algorithms for channel assignment. All of them are based on graph coloring techniques and are called: the tabu search algorithm, simulated allocation algorithm, simulated annealing algorithm and maximum node degree algorithm, respectively. Some computational results of the simulation experiments are presented. This shows that the VR algorithm is appropriate for cellular systems where the traffic demand of each cell varies at short intervals.