A genetic algorithm for channel assignment problems

Abstract

Channel assignment problems are NP-complete optimization problems occurring during design of cellular radio systems. So far, these problems have been treated by sequential graph coloring algorithms [1, 2] and by heuristic techniques [3, 4]. On the other hand, genetic algorithms (GAs) were successfully applied to other NP-complete problems. In this paper, a strategy for using genetic algorithms to solve channel assignment problems is presented.