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 the graph coloring techniques and called 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 VR algorithm is appropriate for the cellular systems where the traffic demand of each cell varies at short intervals.
展开▼
