• Sep 03, 2018 News!Vol.10, No.4 has been published with online version.   [Click]
  • Aug 06, 2018 News!Vol.9, No.1-Vol.9, No.4 have been indexed by EI (Inspec).   [Click]
  • Aug 06, 2018 News!Vol.8, No.6 has been indexed by EI (Inspec).   [Click]
General Information
Prof. Wael Badawy
Department of Computing and Information Systems Umm Al Qura University, Canada
I'm happy to take on the position of editor in chief of IJCTE. We encourage authors to submit papers concerning any branch of computer theory and engineering.
IJCTE 2009 Vol.1(5): 588-591 ISSN: 1793-8201
DOI: 10.7763/IJCTE.2009.V1.94

Comparative Analysis of Simulated Annealingand Tabu Search Channel Allocation Algorithms

Maninder Singh Kamboj and Jyotsna Sengupta

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-2018. International Journal of Computer Theory and Engineering. All rights reserved.
E-mail: ijcte@iacsitp.com