Chapter 9

Applying Evolutionary Algorithms to Solve the Automatic Frequency Planning Problem

Francisco Luna

Francisco Luna

Universidad de Málaga, ETS. Ing. Informática, Campus de Teatinos, 29071 Málaga, Spain

Search for more papers by this author
Enrique Alba

Enrique Alba

Dpto. de Lenguajes y Ciencias de la Computación, E.T.S. Ing. Informática, Campus de Teatinos, 29071 Málaga, Spain

Search for more papers by this author
Antonio J. Nebro

Antonio J. Nebro

Universidad de Málaga, ETS. Ing. Informática, Campus de Teatinos, 29071 Málaga, Spain

Search for more papers by this author
Patrick Mauroy

Patrick Mauroy

Universidad de Málaga, ETS. Ing. Informática, Campus de Teatinos, 29071 Málaga, Spain

Search for more papers by this author
Salvador Pedraza

Salvador Pedraza

Universidad de Málaga, ETS. Ing. Informática, Campus de Teatinos, 29071 Málaga, Spain

Search for more papers by this author
First published: 01 March 2007
Citations: 1

Summary

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, such as frequency hopping. In these networks, interferences provoked by channel reuse due to the limited available radio spectrum result in a major impact of the quality of service (QoS) for subscribers. Therefore, frequency planning is of great importance for GSM operators. We here focus on optimizing the frequency planning of a realistic-sized, real-world GSM network by using evolutionary algorithms (EAs). Results show that a (1+10) EA developed by the chapter authors for which different seeding methods and perturbation operators have been analyzed is able to compute accurate and efficient frequency plans for real-world instances.

The full text of this article hosted at iucr.org is unavailable due to technical difficulties.