The full text of this article


Using a genetic algorithm approach to solve the dynamic channel-assignment problem
by Xiannong Fu, Anu G. Bourgeois, Pingzhi Fan, Yi Pan
International Journal of Mobile Communications (IJMC), Vol. 4, No. 3, 2006


Abstract: The Channel Assignment Problem is an NP-complete problem to assign a minimum number of channels under certain constraints to requested calls in a cellular radio system. Examples of the many approaches to solve this problem include using neural-networks, simulated annealing, graph colouring, genetic algorithms, and heuristic searches. We present a new heuristic algorithm that consists of three stages: 1) determine-lower-bound cell regular interval assignment; 2) greedy region assignment; and 3) genetic algorithm assignment. Through simulation, we show that our heuristic algorithm achieves lower bound solutions for 11 of the 13 instances of the well known Philadelphia benchmark problem. Our algorithm also has the advantage of being able to find optimum solutions faster than existing approaches that use neural networks.

Online publication date: Mon, 06-Feb-2006


is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mobile Communications (IJMC):
Login with your Inderscience username and password:


    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email