.png){kind=icon}
Return
A genetic algorithm for channel assignment problems
.png){kind=icon}
PRE
AI
DOI：10.1002/ett.4460050219.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
AbstractChannel 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.
Journal
No journal information available
Organization
No organization information available
Cited Papers
No cited papers available