Open AccessMetaheuristics for solving a real-world frequency assignment problem in GSM networks
Author(s) -
Francisco Luna,
César Estébanez,
Coromoto León,
José M. Chaves-González,
Enrique Alba,
Ricardo Aler,
Carlos Segura,
Miguel A. VegaRodríguez,
Antonio J. Nebro,
José M. Valls,
Gara Miranda,
Juan A. GómezPulido
Publication year - 2008
Publication title -
citeseer x (the pennsylvania state university)
Language(s) - English
Resource type - Conference proceedings
DOI - 10.1145/1389095.1389396
Subject(s) - gsm , metaheuristic , computer science , benchmarking , key (lock) , frequency assignment , mobile telephony , distributed computing , computer network , mobile radio , artificial intelligence , telecommunications , computer security , marketing , business
The Frequency Assignment Problem (FAP) is one of the key issues in the design of GSM networks (Global System for Mobile communications), and will remain important in the foreseeable future. There are many versions of FAP, most of them benchmarking-like problems. We use a formulation of FAP, developed in published work, that focuses on aspects which are relevant for real-world GSM networks. In this paper, we have designed, adapted, and evaluated several types of metaheuristic for different time ranges. After a detailed statistical study, results indicate that these metaheuristics are very appropriate for this FAP. New interference results have been obtained, that significantly improve those published in previous research.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom