Metaheuristics for solving a real-world frequency assignment problem in GSM networks
Francisco Luna, César Estébanez, Coromoto León, Jose Manuel Chaves-Gonzalez, Enrique Alba, Ricardo Aler, Carlos Segura, Miguel Angel Vega-Rodríguez, Antonio Jesús Nebro, José M. Valls, Gara Miranda, Juan Antonio Gomez-Pulido · 2008
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.