Population-Based Incremental Learning to Solve the FAP Problem

摘要

Frequency assignment problem (FAP) is a very important issue in the field of telecommunications (especially in GSM -Global System for Mobile-Networks). In this work, we present the Population-Based Incremental Learning (PBIL) algorithm to solve a particular branch of the FAP problem (MS-FAP). MS-FAP (Minimum Span Frequency Assignment Problem) tries to minimize the range of frequencies which is necessary in a certain area to cover the communications which take place there. In this paper it is presented the problem and it is explained the methodology which solve it. We have performed tests with a complete set of experiments using seven well-known variations of PBIL and 7 types of MS-FAP problems. At the end, the results are presented and we compare them to conclude which variation of PBIL provides the best solution to the MS-FAP problem.