SS vs PBIL to solve a real-world frequency assignment problem in GSM networks

  • Authors:
  • José M. Chaves-González;Miguel A. Vega-Rodríguez;David Domínguez-González;Juan A. Gómez-Pulido;Juan M. Sánchez-Pérez

  • Affiliations:
  • Univ. Extremadura., Dept. Technologies of Computers and Communications, Escuela Politécnica, Cáceres, Spain;Univ. Extremadura., Dept. Technologies of Computers and Communications, Escuela Politécnica, Cáceres, Spain;Univ. Extremadura., Dept. Technologies of Computers and Communications, Escuela Politécnica, Cáceres, Spain;Univ. Extremadura., Dept. Technologies of Computers and Communications, Escuela Politécnica, Cáceres, Spain;Univ. Extremadura., Dept. Technologies of Computers and Communications, Escuela Politécnica, Cáceres, Spain

  • Venue:
  • Evo'08 Proceedings of the 2008 conference on Applications of evolutionary computing
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we study two different meta-heuristics to solve a real-word frequency assignment problem (FAP) in GSM networks. We have used a precise mathematical formulation in which the frequency plans are evaluated using accurate interference information coming from a real GSM network. We have developed an improved version of the scatter search (SS) algorithm in order to solve this problem. After accurately tuning this algorithm, it has been compared with a version fixed for the FAP problem of the population-based incremental learning (PBIL) algorithm. The results show that SS obtains better frequency plannings than PBIL for all the experiments performed.