@article{MAKHILLIJSC20105120996,
    title = {Hybridizing Iterative Local Search Algorithm for Assigning Cells to Switch in Cellular Mobile Network},
    journal = {International Journal of Soft Computing},
    volume = {5},
    number = {1},
    pages = {7-12},
    year = {2010},
    issn = {1816-9503},
    doi = {ijscomp.2010.7.12},
    url = {https://makhillpublications.co/view-article.php?issn=1816-9503&doi=ijscomp.2010.7.12},
    author = {Hima,Prakash and},
    keywords = {NP hard problem,Integer programming,heuristics,Assignment problem,Iterative Local search,optimal solution},
    abstract = {In this study, a hybridized heuristics approach based on Iterative Local search and Simulated Annealing is proposed to solve the assignment problem of Cellular Mobile Network. In Cellular Mobile Networks, assigning of cells to switch is known as assignment problem. The conventional integer programming method could be used for solving this problem but then, when the number of cells exceeds 35, the total computational data surpass the memory available, computational time grow too larger and it becomes unfeasible to obtain the optimal solution. Thus, this assignment problem is a complex integer programming problem which is proved to be NP hard problem. Particularly, in this study 2-opt Local search and 3-opt Local search methods are embedded to improve the CPU performance of the proposed hybridized algorithm. The objective function is to minimize the link cost between cells and switches upon their assignment alongwiththe constraint that number of cells assigned to each switch. Empirical results show that the proposed heuristic produces results proximity to optimal solution as expected.}
    }