Evolutionary algorithms for real-world instances of the automatic frequency planning problem in GSM networks

  • Authors:
  • Francisco Luna;Enrique Alba;Antonio J. Nebro;Salvador Pedraza

  • Affiliations:
  • Department of Computer Science, University of Málaga, Spain;Department of Computer Science, University of Málaga, Spain;Department of Computer Science, University of Málaga, Spain;Optimi Corp., Málaga, Spain

  • Venue:
  • EvoCOP'07 Proceedings of the 7th European conference on Evolutionary computation in combinatorial optimization
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Frequency assignment is a well-known problem in Operations Research for which different mathematical models exist depending on the application specific conditions. However, most of these models are far from considering actual technologies currently deployed in GSM networks (e.g. frequency hopping). These technologies allow the network capacity to be actually increased to some extent by avoiding the interferences provoked by channel reuse due to the limited available radio spectrum, thus improving the Quality of Service (QoS) for subscribers and an income for the operators as well. Therefore, the automatic generation of frequency plans in real GSM networks is of great importance for present GSM operators. This is known as the Automatic Frequency Planning (AFP) problem. In this paper, we focus on solving this problem for a realistic-sized, real-world GSM network by using Evolutionary Algorithms (EAs). To be precise, we have developed a (1, λ) EA for which very specialized operators have been proposed and analyzed. Results show that this algorithmic approach is able to compute accurate frequency plans for real-world instances.