A new technique to the channel assignment problem in mobile communication networks
Carlos E. C. Vieira, Paulo Roberto de Lira Gondim, Carino Andrade Rodrigues, Jacir Luiz BORDIM · 2008
Channel allocation has been considered a NP-complete problem, and involves a very important issue for the adequate dimensioning of wireless communication networks. One of the possibilities for its solution involves the utilization of heuristics, able to produce near optimal solutions in an acceptable computational time. In this paper, a hybrid of GRASP (greedy randomized adaptive search procedure) and FEA (frequency exhaustive assignment) is proposed, allowing the achievement of best solutions for the channel allocation problem (CAP).