论文信息 - A genetic algorithm for channel assignment problems

A genetic algorithm for channel assignment problems

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.

Monica Cuppini | Monica Cuppini

[1] A. Gamst,et al. Computational complexity of some interference graph calculations (mobile radio) , 1990 .

[2] D. Kunz,et al. Channel assignment for cellular radio using neural networks , 1991 .

[3] Masakazu Sengoku,et al. A new coloring problem of networks related to a channel assignment problem in cellular mobile systems , 1991, 1991., IEEE International Sympoisum on Circuits and Systems.

[4] Kenneth A. De Jong,et al. Using Genetic Algorithms to Solve NP-Complete Problems , 1989, ICGA.

[5] F. Box,et al. A heuristic technique for assigning frequencies to mobile radio nets , 1978, IEEE Transactions on Vehicular Technology.

[6] A. Gamst. A resource allocation techniqiue for FDMA systems , 1988 .

[7] L. Darrell Whitley,et al. Scheduling Problems and Traveling Salesmen: The Genetic Edge Recombination Operator , 1989, International Conference on Genetic Algorithms.

[8] Ming Zhang,et al. Comparisons of channel-assignment strategies in cellular mobile telephone systems , 1989 .

[9] Masakazu Sengoku,et al. Cellular mobile communication systems and a channel assignment using neural networks , 1990, Proceedings of the 33rd Midwest Symposium on Circuits and Systems.