A channel allocation for cellular mobile radio systems using simulated annealing

We consider the channel allocation problem, which is one of the most intere sting problems in mobile radio systems. This problem is known to be NP-comp lete and a couple of heuristic algorithms have been developed. In this pape r, we convert the problem into a simpler form through the concept of patter n, a set of cochannel cells. We suggest another algorithm based on simulate d annealing for this simplified problem. The algorithm is applied into diff erent benchmark problems that have appeared in the literature. The presente d examples illustrate that our method works very well. Computational result s using our formulation and simulated annealing algorithm are reported.