Local search study of honeycomb clustering problem for cellular planning
by Jean-Charles Creput, Abderrafiaa Koukam
International Journal of Mobile Network Design and Innovation (IJMNDI), Vol. 1, No. 2, 2006

Abstract: We study a local search approach for a coverage problem in the plane, called Balanced Honeycomb Clustering Problem (BHCP), where a honeycomb mesh is used to build irregular hexagonal clusters that have to cover a fixed amount of points of a given data distribution. This problem has application to dimension cellular networks adapted to radio-mobile traffic. The local search approach uses dynamic application of fitness landscape penalties in order to exit local minima and improve performances, while eliminating overloaded cells. Results are given in comparison to best solutions known generated by an evolutionary algorithm. For a considerable reduction of computational time, about 3000% lower, we show that local search outperforms a population-based evolutionary approach.

Online publication date: Tue, 05-Sep-2006

The full text of this article 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 Network Design and Innovation (IJMNDI):
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 subs@inderscience.com