Article ID: | iaor20052192 |
Country: | United Kingdom |
Volume: | 32 |
Issue: | 1 |
Start Page Number: | 169 |
End Page Number: | 186 |
Publication Date: | Jan 2005 |
Journal: | Computers and Operations Research |
Authors: | Vrbrand Peter, Yuan Di, Bjrklund Patrik |
Keywords: | communication, heuristics, optimization: simulated annealing, programming: integer |
We consider a generalization of the classical frequency assignment problem. The generalization arises when frequency hopping is used in a cellular network. The planning problem concerns assigning lists of frequencies to blocks of transceivers, such that the total interference is minimized. This problem is considerably more difficult than the classical frequency assignment problem, because of the large number of possible frequency lists. We provide the technical background that motivates our study, and present a mathematical model which includes the classical frequency assignment problem as a special case. We describe a simulated annealing algorithm. The algorithm explores the solution space by solving an integer program in each iteration. We report computational results for real-life and synthesized networks.