Skip to Main Content
An efficient heuristic algorithm is proposed for the channel assignment problem in cellular mobile systems. The merit of the algorithm is the improved repetitive ordering of requirements in sequences using the deterministic assignment difficulties. Benchmark problems are employed to validate the performance merit of the proposed algorithm and five other well-known channel assignment schemes. The relative merit of performance is measured in terms of the number of required channels, the percentage of assignment for a fixed number of available channels and the computational time. The study shows that the proposed algorithm is superior to the other investigated algorithms. It yields the optimal assignment for most of the benchmark problems and near-optimal assignment for other cases.