A memetic algorithm for assigning cells to switches in cellular mobile networks

• Published in: IEEE communications letters Vol. 6; no. 11; pp. 484 - 486
• Main Authors: Quintero, A., Pierre, S.
• Format: Journal Article
• Language: English
• Published: New York, NY IEEE 01.11.2002; Institute of Electrical and Electronics Engineers; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Algorithms; Applied sciences; Cellular; Cellular communication; Cellular networks; Communication switching; Costs; Equipments and installations; Exact sciences and technology; Frequency; Heuristic; Intelligent networks; Land mobile radio cellular systems; Mobile radiocommunication systems; Networks; NP-hard problem; Radiocommunications; Relays; Switches; Switching theory; Systems, networks and services of telecommunications; Tabu search; Telecommunications; Telecommunications and information theory; Teletraffic; Testing; Cell network; Heuristic approach; Tabu search; Algorithm; Wireless telecommunication; Resource allocation
• ISSN: 1089-7798; 1558-2558
• DOI: 10.1109/LCOMM.2002.805515

Assigning cells to switches in cellular mobile networks is an NP-hard problem which, for real size mobile networks, could not be solved using exact methods. In this context, heuristic approaches like memetic algorithms can be used. This paper proposes a memetic algorithm (MA) to solve this problem. The implementation of this 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 tabu search and Merchant and Sengupta's heuristics. This heuristic can be used to solve NP-hard problems, like designing and planning, in the next-generation mobile networks.