A bi-objective location area planning for wireless phone network Online publication date: Sat, 09-Aug-2014
by Saoussen Krichen; Ons Abdelkhalek; Adel Guitouni
International Journal of Applied Decision Sciences (IJADS), Vol. 5, No. 4, 2012
Abstract: In this paper, we propose an extension of the classical location area planning (LAP) problem in the wireless telephony system including additional objectives and constraints. The bi-objective location area planning (BOLAP) problem considers the minimisation of both distance costs between base transceiver stations and the base station controllers. A vector evaluated particle swarm optimisation (VEPSO) is then implemented to solve the bi-objective model. This heuristic operates in term of two swarms, each corresponding to one of the two objectives, and exchanging their best experience. A comparison of the proposed algorithm is performed with the statistical method being used by a major wireless telephone company. The empirical results show that the proposed approach dominates the operator's method on one hand, and that the BOLAP is an effective generalisation of the classical LAP model on the other hand.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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 Applied Decision Sciences (IJADS):
Login with your Inderscience username and 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