DocumentCode
2928124
Title
A comparison of two search algorithms for solving the channel assignment problem
Author
Kim, Min-Jeong ; Ryu, Kwan-Hong
Author_Institution
Telecommun. Network Res. Lab., Korea Telecom, Seoul, South Korea
Volume
2
fYear
1996
fDate
29 Sep-2 Oct 1996
Firstpage
681
Abstract
We compare two efficient search algorithms for solving the channel assignment problem, which assigns the channels to the PCS base stations in a spectrum efficient way. We use the simulated annealing and the tabu search algorithms for that technique. We describe the algorithms and report on our computational experiments
Keywords
cellular radio; frequency allocation; land mobile radio; personal communication networks; radio spectrum management; search problems; simulated annealing; telecommunication computing; PCS base stations; cellular radio; channel assignment problem; computational experiments; search algorithms; simulated annealing; spectrum efficient method; tabu search; Electromagnetic interference; Electromagnetic measurements; Interchannel interference; Interference constraints; Linear programming; Mathematical model; Optimization methods; Performance evaluation; Simulated annealing; Temperature distribution;
fLanguage
English
Publisher
ieee
Conference_Titel
Universal Personal Communications, 1996. Record., 1996 5th IEEE International Conference on
Conference_Location
Cambridge, MA
Print_ISBN
0-7803-3300-4
Type
conf
DOI
10.1109/ICUPC.1996.562660
Filename
562660
Link To Document