Channel assignment problem in cellular networks using genetic algorithms

In order to use the frequencies more efficiently, a new channel assignment approach based on genetic algorithms was proposed. Three constraints were considered for the channel assignment: the co-channel constraint, the adjacent constraint and the co-site constraint. The objective is to obtain a channel assignment scheme. The scheme satisfies both the traffic demand requirements and electromagnetic compatibility constraints with the lower-bound channel number. The minimum-separation encoding scheme was put forward. The traffic demand can be fulfilled throughout the iterative process using the genetic-fix operators (crossover and mutation). Some GAs operators were proposed and tested. Some well-known benchmark problems were simulated. The proposed algorithm is a better approach for solving the channel assignment problem.