A novel approach to the Fixed Channel Assignment problem

A critical task in the design of a cellular radio network is to determine a spectrum-efficient and conflict-free allocation of channels among the cells. In this paper, we propose a new approach to the Fixed Channel Assignment (FCA) problem. By preserving the co-site channel constraint throughout our algorithm and adopting a fine-tuning procedure to escape front a local minimum, we reduce the overall execution time and improve the convergence rate. Simulation results show that our algorithm achieves a very high rate of convergence to solutions for eight benchmark problems. Furthermore, the number of iterations our algorithm requires is fewer than previous results.