Optimal Channel Assignment in Cellular Systems using Tabu Search

摘要

The channel assignment problem (CAP) in cellular systems has the task of planning the reuse of the limited available frequencies in a spectrum-efficient and interference-minimal way. We adopt an integer programming representation of the static channel assignment (SCA) formulated by Smith and Palaniswami. The tabu search (TS) algorithm is implemented to solve this problem. Ten benchmark problems are tested, and we show that the TS approach significantly outperforms other optimization techniques.