An efficient algorithm for PMFAP

Perturbation-Minimizing Frequency Assignment Problem (PMFAP) is a frequency assignment problem in which newly generated demands are satisfied with minimum change in the already existing frequency assignment keeping all the interference constraints. In this paper an efficient heuristic algorithm for PMFAP is presented. The efficiency of this algorithm is compared with the existing results from literature. The proposed algorithm also works for the well-known Frequency Assignment Problem (FAP) and its performance is compared with the existing results for the standard benchmark data sets