CHANNEL ASSIGNMENT FOR CELLULAR RADIO USING SIMULATED ANNEALING

The channel assignment problem (CAP), i.e., the task to assign the channels to the radio base stations in a spectrum efficient way, is an NP-complete optimization problem occurring during design of cellular radio systems. So far, this problem has been solved by graph coloring algorithms. An alternative approach is presented in this paper. The problem is solved using simulated annealing, which is a general approach to combinatorial optimization. The algorithm has been successfully applied to practical radio network planning situations. One major benefit of the approach consists in the enhanced flexibility it gives to the engineer.