Solving a Constraint Satisfaction Problem for Frequency Assignment in Low Power FM Broadcasting

We present an algorithm to solve the frequency assignment problem for low power FM broadcasting. To get a good suboptimal solution, some heuristics such as k-coloring variable ordering and mostly-used value ordering rule are provided. They enforce the backtracking process in a constraint satisfaction problem, so both the search space and computing time are greatly reduced. A lot of outstanding work on graph coloring problems has been achieved, and the theoretical lower bound of the chromatic number of random graph is one of them. Comparison between the theoretical lower bound and our computed approximate solution has been made for evaluation of proposed algorithm.