International Journal of Computer Theory and Engineering

Frequency: Quarterly
ISSN: 1793-8201 (Print), 2972-4511 (Online)
Publisher:IACSIT Press

OPEN ACCESS
4.0
CiteScore

IJCTE 2009 Vol.1(5): 588-591
doi: 10.7763/IJCTE.2009.V1.94

Comparative Analysis of Simulated Annealingand Tabu Search Channel Allocation Algorithms

Maninder Singh Kamboj , 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.

Keywords

  • Frequency Allocation Problem
  • Tabu Search
  • Simulated Annealing
94-G576-591

How to Cite

Copied

Maninder Singh Kamboj and Jyotsna Sengupta, "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. https://doi.org/10.7763/IJCTE.2009.V1.94

Copyright & License

Copyright © 2009 by the authors. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).

Article Metrics in Dimensions

Menu