Computationally efficient algorithms for location area planning in future cellular systems

Efficient resource utilisation in future cellular systems is related to the control of the signalling load imposed by the location update and paging operations. Important means for controlling this load is the “proper” planning of location areas. In this paper we define and solve a version of the location area planning problem. Starting from a formal definition and an optimal formulation of the problem, three computationally efficient algorithms, adhering to simulated annealing, taboo search, and genetic algorithm paradigm, are presented.