### Abstract

This paper addresses the problem of fixed channel assignment in cellular communication systems with nonuniform traffic distribution. The objective of the channel assignment is to minimise the average blocking probability. Methods for finding a good allocation can be based on first building a number of sets of cochannel cells or allocation patterns and then assigning them to channels. This usually implies that only a subset of the feasible region is attainable. The approach suggested in this paper uses the concept of packed pattern, since all patterns in an optimal solution will be of that kind. With a constructive method, the entire set of packed patterns is built and used in the optimisation process. The complexity (large-scale and nonlinearity) of the resulting problem suggested the use of general search procedures (local search, tabu search, simulated annealing, etc.), which have the further advantage of flexibility when dealing with extensions to the problem. A neighbouring structure was used, that facilitated the calculations while still allowing for the search in the entire solution space. A summary of extensive numerical experiments is presented. The outcome is an improvement over previous results

Original language | English |
---|---|

Journal | Control and Cybernetics |

Volume | 29 |

Issue number | 3 |

Pages (from-to) | 685-700 |

ISSN | 0324-8569 |

Publication status | Published - 2000 |

## Cite this

Borges, P. M. F. C., & Vidal, R. V. V. (2000). Fixed channel assignment in cellular communication systems considering the whole set of packed patterns: An investigation based on metaheuristics.

*Control and Cybernetics*,*29*(3), 685-700. http://www2.imm.dtu.dk/pubdb/p.php?1931