Skip to Main Content
In the channel assignment problem, frequencies are assigned to requested calls in a cellular mobile network subject to co-channel, adjacent channel and co-site constraints such that required bandwidth is minimized. In this paper, a new hybrid algorithm is proposed to solve the channel assignment problem and Node-color and Node-degree ordering of cells and Row-wise and Column-wise ordering of calls and local search are used. The performance of proposed method is evaluated by solving 5 channel assignment problems. Results show that this method can find more and better solutions with minimum required bandwidth in comparison with the other algorithms investigated in the paper. Other advantages of this method are convergence and simplicity.