Springer
Table of ContentsAuthor IndexSearch

An Efficient Hybrid Genetic Algorithm for a Fixed Channel Assignment Problem with Limited Bandwidth

Shouichi Matsui, Isamu Watanabe, and Ken-ichi Tokoro

Communication & Information Research Laboratory (CIRL)
Central Research Institute of Electric Power Industry (CRIEPI)
2-11-1 Iwado-kita, Komae-shi
Tokyo 201-8511, Japan
{matsui,isamu,tokoro}@criepi.denken.or.jp

Abstract. We need an efficient channel assignment algorithm for increasing channel re-usability, reducing call-blocking rate and reducing interference in any cellular systems with limited bandwidth and a large number of subscribers. We propose an efficient hybrid genetic algorithm for a fixed channel assignment problem with limited bandwidth constraint. The proposed GA finds a good sequence of codes for a virtual machine that produces channel assignment. Results are given which show that our GA produces far better solutions to several practical problems than existing GAs.

LNCS 2724, p. 2240 ff.

Full article in PDF


lncs@springer.de
© Springer-Verlag Berlin Heidelberg 2003