Tuning the PBIL algorithm to solve a real-world FAP problem Online publication date: Wed, 02-Dec-2009
by Jose M. Chaves-Gonzalez, Miguel A. Vega-Rodriguez, David Dominguez-Gonzalez, Juan A. Gomez-Pulido, Juan M. Sanchez-Perez
International Journal of Reasoning-based Intelligent Systems (IJRIS), Vol. 2, No. 1, 2010
Abstract: Frequency planning, also known as frequency assignment problem (FAP), is a very important task for current GSM operators. FAP basically tries to minimise the number of interferences (or conflicts in the communications) caused when a limited number of frequencies has to be assigned to a quite high number of transceivers (and there are much more transceivers than frequencies). In this work, we focus on solving this problem for a realistic-sized, real-world GSM network using the population-based incremental learning (PBIL) algorithm. The work described here is divided in two parts. In the first one, we analyse and fix the standard PBIL algorithm to solve the FAP; whereas in the second, we take as initial point the results obtained with the standard version of PBIL and we perform a complete study with the most relevant variations of the algorithm to discover which approach can compute the best frequency plans for real-world instances.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Reasoning-based Intelligent Systems (IJRIS):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook