Problem of assignment cells to switches in a cellular mobile network via beam search method

The problem of assigning cells to switches in a cellular mobile network is an NP-hard optimization problem. So, real size mobile networks could not be solved by using exact methods. The alternative is the use of the heuristic methods, because they allow us to find a good quality solution in a quite satisfactory computational time. This paper proposes a Beam Search method to solve the problem of assignment cell in cellular mobile networks. Some modifications in this algorithm are also presented, which allows its parallel application. Computational results obtained from several tests confirm the effectiveness of this approach to provide good solutions for medium- and large-sized cellular mobile network.

Keywords

Assignment problem, Beam search method, Cellular network, Combinatorial optimization, Assignment problems, Beam search, Cellular mobile networks, Computational results, Computational time, Exact methods, Mobile networks, NP-hard, Optimization problems, Parallel application, Cellular neural networks, Computational complexity, Heuristic methods, Problem solving, Traveling salesman problem, Wireless networks