Solving channel allocation problem using new genetic algorithm with clique partitioning method

Many channel assignment methods are used in cellular networks in allocating the frequencies or channels to the corresponding cells. The assignment strategy of channels should target the maximal efficiency of channels which satisfies the different constraints of the network. The problem of fixing the channels to mobile stations, an NP-hard problem, is solved using the different soft computing strategies. The clique partition problem is partitioning of G into a fixed least number of cliques constrained with every vertex is available in a unique clique. This paper focuses on the new genetic algorithm with use of clique partitioning in solving channel allocation. The proposed strategy works well even for the smaller N, the population size and achieves high stochastic convergence with low fitness thresholds. Even for the larger problem instances, the maximum simulation run length is set to 50000 which yield higher fitness threshold limits. The comparison of simulated results of this proposed method with existing techniques is presented and the experimental outcomes are better than those techniques.