Combinatorial evolution strategy-based implementation of dynamic channel assignment in cellular communications

The dynamic channel assignment (DCA) problem has been extensively studied and various algorithmic methods have been tried as solutions. However, the majority of these techniques suffers from the high computational cost that reduces the possibility of hardware implementation of a DCA controller for online operation in geographic cellular environments. In order to overcome this problem, various heuristic methods have been suggested in the literature. An efficient heuristic approach called the combinatorial evolution strategy (CES) is applied to a DCA problem. The CES belongs to the general category of the so called evolutionary algorithms (EAs) that try to solve difficult problems by mimicking the process of natural evolution. Comparisons with various channel assignment schemes show the superior performance of the CES-DCA for both models with uniform and non-uniform traffic distribution