Channel allocation schemes in a cellular network can be modeled as combinat
orial optimization problems. Genetic algorithms (GAs) have been shown to be
effective and robust tools in providing adequate solutions of such problem
s. This paper investigates the application of GAs to two common assignment
strategies from the field of cellular communications: the dynamic (DCA) and
the borrowing channel assignment (BCA). In bath schemes, channel allocatio
n is formulated as a discrete energy minimization problem and can be put in
proper genetic representation. A computer simulation model examines the pe
rformance of the proposed GA-DCA and GA-BCA schemes for uniform and non-uni
form traffic distributions under the effect of cochannel and adjacent chann
el interference constraints. (C) 2000 IMACS/Elsevier Science B.V. All right
s reserved.