A Parameter-Free Genetic Algorithm for a Fixed Channel Assignment Problem with Limited Bandwidth

Authors:
Shouichi Matsui;Isamu Watanabe;Ken-ichi Tokoro
Affiliations:
-;-;-
Venue:
PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
Year:
2002

Citing 2
Cited 1

A Permutation Based Genetic Algorithm for Minimum Span Frequency Assignment

PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
Parameter-Free Genetic Algorithm Inspired by ``Disparity Theory of Evolution''

PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature

Impact of tradeoff between blocking and interference on TDMA cell capacity planning

International Journal of Mobile Network Design and Innovation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Increasing the channel re-usability is necessary for reducing the call-blocking rate in any cellular systems with limited bandwidth and a large number of subscribers. To increase the re-usability, we need an efficient channel assignment algorithm that minimizes the sum of blocking cost and interference cost. We propose a new genetic algorithm for the problem based on the parameter-free GA. 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, without tedious parameter tuning, produces far better solutions to several practical problems than the existing GAs.