An investigation on metaheuristic techniques for solving cell to switch assignment problem Online publication date: Mon, 10-Sep-2018
by Mridul Chawla; Manoj Duhan
International Journal of Wireless and Mobile Computing (IJWMC), Vol. 15, No. 1, 2018
Abstract: The assignment of cells to switches in a Personal Communication Services Network (PCSN) is a Non-Deterministic Polynomial Time (NP) hard problem with exponential complexity and is among the hardest combinatorial optimisation problems of great practical importance in wireless communication systems. The objective is to assign cells to switches in an optimal manner, such that the cost comprising the sum of hand-off, cabling and switching cost is minimised with reasonable accuracy in an acceptable time scale, while obeying the constraints that each cell must be assigned to exactly one switch and total load of all the cells which are assigned to a switch is below the capacity of the switch. The aim of this article is to experimentally investigate the performance of three recent metaheuristic algorithms namely Bat Algorithm (BA), Firefly Algorithm (FA) and Flower Pollination Algorithm (FPA) for solving the Cell to Switch Assignment (CSA) problem.
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 Wireless and Mobile Computing (IJWMC):
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
Our Blog 
Follow us on Twitter 
Visit us on Facebook