By Topic

An adaptive local-search algorithm for the channel-assignment problem (CAP)

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)
Wei Wang ; Dept. of Electr. Eng., Utah Univ., Salt Lake City, UT, USA ; Rushforth, C.K.

The channel-assignment problem (CAP) for cellular radio networks is an NP-complete problem. Previous techniques for solving this problem have used graph-coloring algorithms, neural networks, simulated annealing, and pattern-based optimization procedures. We describe an efficient two-phase adaptive local-search algorithm for the channel-assignment problem. This algorithm has been applied to several existing benchmark problems with encouraging results. In many cases it outperforms the existing algorithms in the quality of the solution obtained. When used in conjunction with structured preprocessing, the algorithm can be applied to large networks. It is thus a practical tool for the planning of cellular radio networks

Published in:

Vehicular Technology, IEEE Transactions on  (Volume:45 ,  Issue: 3 )