Solving Base Station Subsystem Assignment Problem in Mobile Communication Networks Using Hybridized Heuristic Algorithm

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.