Abstract—The major aim of the Frequency Allocation Problem in mobile radio networks is to allocate a limited number of frequencies to all radio cells in a network while minimizing electromagnetic interference due to the re-use off requencies. This problem is identified as NP-hard, and of huge significance in practice since enhanced solutions will permit a telecommunications operator to administer bigger cellular networks. This paper presents and implements two algorithms tabu search and simulated annealing. The algorithms are tested on realistic and large problem instances and compared. Results of comparison show that the tabu search is less efficient than simulated annealing algorithm.
Index Terms—Frequency Allocation Problem, Tabu Search, Simulated Annealing
Cite: Maninder Singh Kamboj, Jyotsna Sengupta, Department of Computer Science, Punjabi University, Patiala, "Comparative Analysis of Simulated Annealingand Tabu Search Channel Allocation Algorithms," International Journal of Computer Theory and Engineering vol. 1, no. 5, pp. 588-591, 2009.
Copyright © 2008-2024. International Association of Computer Science and Information Technology. All rights reserved.
