Reporting cell planning for cost reduction using binary genetic algorithm Online publication date: Wed, 28-Feb-2018
by Smita Rani Parija; Prasanna Kumar Sahu; Sudhansu Sekhar Singh
International Journal of Convergence Computing (IJCONVC), Vol. 2, No. 3/4, 2016
Abstract: In mobile access networks, location management is a major and complex issue where location information of the mobile user is essential to deliver incoming calls/SMS to the appropriate mobile stations (MSs). Many metaheuristic algorithms are developed to solve such types of important issue which is responsible for determining the network configuration. This paper proposes a conventional binary genetic algorithm (BGA) approach implemented to reporting cells planning problem in complex multimodal search spaces, since BGA is a conventional algorithm sufficiently able to solve the signalling cost problem along with the modifications in the generic operators. These modifications occur in the mutation operator. The simulation results obtained from the experiments conducted using the existing database along with the real time database. The proposed method shows better performance compared to existing algorithm. This simulation results obtained from the experiments reflects the effectiveness of the conventional BGA.
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 Convergence Computing (IJCONVC):
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