A Survey on the Algorithms Used to Solve the Channel Assignment Problem

Author(s): Jayrani Cheeneebash , Jose Antonio Lozano , Harry Coomar Shumsher Rughooputh .

Journal Name: Recent Patents on Telecommunication (Discontinued)

Volume 1 , Issue 1 , 2012


This article provides a detailed discussion of the different algorithms used in solving the Channel Assignment Problem. The authors provide a survey of a large number of published papers in the area of Channel Allocation Problems and describe the different methods used from the early 70s till now. The algorithms can be broadly categorized in terms of Local Search, Simulated Annealing, Graph Theory, Neural Networks, Genetic Algorithms and Tabu Search. Also in this paper we refer to some patents that have been recently acquired in the field of mobile communication and evolutionary algorithms.

Keywords: Channel Assignment Problems, algorithms, FCA, Hybrid Channel Allocation, frequency division, time division, code division, co-channel constraint, adjacent channel constraint, co-site constraint, pseudo-code, CAP, Neural Network , Hopfield Network, DCHNN

Rights & PermissionsPrintExport Cite as

Article Details

Year: 2012
Page: [54 - 71]
Pages: 18
DOI: 10.2174/2211740711201010054

Article Metrics

PDF: 7