An adaptive local-search algorithm for the channel-assignment problem (CAP)

The channel-assignment problem (CAP) for cellular radio networks is an NP-complete problem. Previous techniques for solving this problem have used graph-coloring algorithms, neural networks, simulated annealing, and pattern-based optimization procedures. We describe an efficient two-phase adaptive local-search algorithm for the channel-assignment problem. This algorithm has been applied to several existing benchmark problems with encouraging results. In many cases it outperforms the existing algorithms in the quality of the solution obtained. When used in conjunction with structured preprocessing, the algorithm can be applied to large networks. It is thus a practical tool for the planning of cellular radio networks.