Asian Science Citation Index is committed to provide an authoritative, trusted and significant information by the coverage of the most important and influential journals to meet the needs of the global scientific community.  
ASCI Database
308-Lasani Town,
Sargodha Road,
Faisalabad, Pakistan
Fax: +92-41-8815544
Contact Via Web
Suggest a Journal
International Journal of Soft Computing
Year: 2010  |  Volume: 5  |  Issue: 1  |  Page No.: 7 - 12

Hybridizing Iterative Local Search Algorithm for Assigning Cells to Switch in Cellular Mobile Network

K. Rajalakshmi, Prakash Kumar and Hima M. Bindu    

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.

Fulltext    |   Related Articles   |   Back
   
 
 
 
  Related Articles

 
 
 
Copyright   |   Desclaimer   |    Privacy Policy   |   Browsers   |   Accessibility