An efficient tabu search for cell planning problem in mobile communication

During the past decades, mobile communication is in the vigorous development, where the cell planning problem (CPP) is one of impressive research issues. CPP has been proved to be NP‐Complete, and many works develop intelligent heuristic search strategies to solve it. Among many factors to affect the cell planning, the major one is the signaling cost, where the location management is critical to the cost. In this paper, we focus on how to tackle CPP such that the signaling cost can be minimized. We adopt a meta‐heuristic iterative search algorithm, Tabu Search (TS), to deal with the cell planning issue for the base station and propose novel designs to improve the TS capability, including initialization and neighbor swap strategy. The simulation results reveal that our TS outperforms traditional TS, genetic algorithms, and several previous works in CPP. Copyright © 2014 John Wiley & Sons, Ltd. The cell planning is a challenge problem of mobile computing in the wireless communication, and has been proved to be NP‐Complete. We adopt a meta‐heuristic local search algorithm to deal with the issue, and propose novel designs to improve the performance.