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

15Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

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. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Chaves-González, J. M., Vega-Rodríguez, M. A., Domínguez-González, D., Gómez-Pulido, J. A., & Sánchez-Pérez, J. M. (2008). SS vs PBIL to solve a real-world frequency assignment problem in GSM networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4974 LNCS, pp. 21–30). https://doi.org/10.1007/978-3-540-78761-7_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free