Abstract
In mobile communication network, assigning Base Transmission Station (BTS) to Base Station Controller (BSS) is known as Base Station Subsystem Assignment problem. For solving assignment problem, in this paper, a hybridized heuristic approach based on Iterative Local Search and Simulated Annealing is proposed. Conventional brute force method by explicit enumeration requires exponential computational time and it becomes non-feasible to obtain the optimal solution. Thus, the assignment problem defined above is a NP-Hard. Particularly in this paper, 2-opt Local Search is utilized to improve the CPU performance of the proposed hybridized algorithm. Empirical results show that the proposed heuristic produces results proximity to optimal solution as expected. The proposed heuristic algorithm also promises to be efficient even in case of larger size assignment problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Merchant, A., Sengupta, B.: Multiway Graph Partitioning with Applications to PCS Networks. In: INFOCOM, pp. 593–600 (1994)
Merchant, A., Sengupta, B.: Assignment of Cells to Switches in PCS Networks. IEEE/ACM Transaction on Networking 3, 521–526 (1995)
Houeto, F., Pierre, S.: Assigning Cells to Switches in Cellular Mobile Networks Using Taboo Search. IEEE Transactions on Systems, Man and Cybernetic - Part B: Cybernetic 32, 351–356 (2002)
Quintero, A., Pierre, S.: A Memetic Algorithm for Assigning Cells to Switches in Cellular Mobile Networks. IEEE Communications Letters 6, 484–486 (2002)
Quintero, A., Pierre, S.: Assigning Cells to Switches in Cellular Mobile Networks: A Comparative Study. Computer Communications 26, 950–960 (2003)
Menon, S., Gupta, R.: Assigning Cells to Switches in Cellular Networks by Incorporating a Pricing Mechanism into Simulated Annealing. IEEE Transaction on Systems, Man and Cybernetics, Part B: Cybernetics 34, 558–565 (2004)
Salcedo-Sanz, S., Xin, Y.: A Hybrid Hopfield Network-Genetic Algorithm Approach for the Terminal Assignment Problem. IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics 34, 2343–2353 (2004)
Glover, F., Kocheherger, G.A.: Handbook of Metaheuristics. Kluwer Academic Publishers, Dordrecht (2003)
Lourenco, H.R., Martin, O., Stuetzle, T.: A Beginner’s Introduction to Iterated Local Search. In: Proceedings of MIC 2001 - 4th Meta-heuristics International Conference at Porto, Portugal (2001)
Stuetzle, T.: Local Search Algorithms for Combinatorial Problems–Analysis, Improvements, and New Applications. PhD thesis, Darmstadt University of Technology, Department of Computer Science (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Krishnamurthi, R., Kumar, P., Bindu, H.M. (2010). Solving Base Station Subsystem Assignment Problem in Mobile Communication Networks Using Hybridized Heuristic Algorithm. In: Huang, DS., McGinnity, M., Heutte, L., Zhang, XP. (eds) Advanced Intelligent Computing Theories and Applications. ICIC 2010. Communications in Computer and Information Science, vol 93. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14831-6_45
Download citation
DOI: https://doi.org/10.1007/978-3-642-14831-6_45
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14830-9
Online ISBN: 978-3-642-14831-6
eBook Packages: Computer ScienceComputer Science (R0)