A comparison of two search algorithms for solving the channel assignment problem
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 compu...
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | 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. |
---|---|
DOI: | 10.1109/ICUPC.1996.562660 |