By Topic

A new strategy for the application of genetic algorithms to the channel-assignment problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Beckmann, D. ; Tech. Univ. Hamburg-Harburg, Germany ; Killat, U.

The channel-assignment problem in cellular radio networks is known to belong to the class of NP-complete optimization problems. So far, this problem has been solved by heuristic assignment strategies or by the application of combinatorial optimization tools like simulated annealing or neural networks. We propose a new powerful approach to the channel-assignment problem by combining the two mentioned groups of solution techniques. The results obtained by the application to a well-known benchmark problem reveal that this absolutely new strategy clearly outperforms the already existing algorithms

Published in:

Vehicular Technology, IEEE Transactions on  (Volume:48 ,  Issue: 4 )