The demand for mobile communication has been steadily increasing
in recent years. With the limited frequency spectrum, the problem of channel assignment becomes increasingly important, i.e., how do we assign the calls to the available channels so that the interference is minimized while the demand is met? This problém is known to belong to a class of very difficult combinatorial optimization problems. In this paper, we apply the formulation of Ngo and Li with genetic algorithms to ten benchmarking problems. Interference-free Solutions cannot be found for soine of these problems; however, the approach is able to minimize the interference significantly. The results demonstrate the effectiveness of genetic algorithms in searching for optirnal Solutions in this complex optimization problem.