A hybrid evolutionary approach to the registration area planning problem

摘要

The last two decades have witnessed a phenomenal growth in the number of cellular wireless network users which in turn stressed the need to utilize the limited network bandwidth in an efficient manner. The network bandwidth is consumed not only by user traffic, but also by control traffic needed for ensuring the mobility of users. As we don’t have any control over the volume of user traffic, all attempts to efficiently use bandwidth are based on frequency reuse and minimizing the control traffic. The registration area planning (RAP) problem seeks a partition of the cells of the network into contiguous areas called registration areas so that the bandwidth consumed by control signals is minimized. RAP problem in an \(\mathcal {NP}\)-Hard problem. In this paper, we present a steady-state grouping genetic algorithm with local search to solve this problem. We have compared our approach with the state-of-the-art approaches reported in the literature. Computational results show the effectiveness of our approach.