×

zbMATH — the first resource for mathematics

An efficient hybrid genetic algorithm for a fixed channel assignment problem with limited bandwidth. (English) Zbl 1038.68790
Cantú-Paz, Erick (ed.) et al., Genetic and evolutionary computation – GECCO 2003. Genetic and evolutionary computation conference, Chicago, IL, USA, July 12–16, 2003. Proceedings, Part II. Berlin: Springer (ISBN 3-540-40603-4/pbk). Lect. Notes Comput. Sci. 2724, 2240-2251 (2003).
Summary: 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.
For the entire collection see [Zbl 1025.68695].
MSC:
68U99 Computing methodologies and applications
68T05 Learning and adaptive systems in artificial intelligence
68T20 Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
90B18 Communication networks in operations research
Software:
FASoft
PDF BibTeX XML Cite
Full Text: Link