Sequential and multi-population memetic algorithms for assigning cells to switches in mobile networks

摘要

The design of mobile networks is a complex process, which requires solving simultaneously many difficult combinatorial optimization problems. Assigning cells to switches in cellular mobile networks is an NP-hard problem, which can not be practically solved using exact methods. In this context, heuristic approaches like memetic algorithms (MAs) are recommended. This paper proposes different MAs to solve this problem. The implementation of these algorithms has been subject to extensive tests. The results obtained confirm the efficiency and the effectiveness of MA to provide good solutions for moderate- and large-sized cellular mobile networks, in comparison with standard genetic algorithm and with other heuristic methods well known in the literature.