An efficient hybrid genetic algorithm for a fixed channel assignment problem with limited bandwidth

Authors:
Shouichi Matsui;Isamu Watanabe;Ken-ichi Tokoro
Affiliations:
Communication & Information Research Laboratory, Central Research Institute of Electric Power Industry, Komae-shi, Tokyo, Japan;Communication & Information Research Laboratory, Central Research Institute of Electric Power Industry, Komae-shi, Tokyo, Japan;Communication & Information Research Laboratory, Central Research Institute of Electric Power Industry, Komae-shi, Tokyo, Japan
Venue:
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
Year:
2003

Citing 4
Cited 0

An introduction to genetic algorithms

An introduction to genetic algorithms
A Permutation Based Genetic Algorithm for Minimum Span Frequency Assignment

PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
On Permutation Representations for Scheduling Problems

PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
Genetic Search For Fixed Channel Assignment Problem With Limited Bandwidth

GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference

Quantified Score

Hi-index	0.00

Visualization

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.