A Tabu search algorithm for frequency assignment problem in wireless communication networks

Authors:
Zhang Yu-Bin;Zhao Yu-Cai;Xiong Hui
Affiliations:
School of Electronic Science and Engineering, National University of Defense Technology, ChangSha, China;School of Electronic Science and Engineering, National University of Defense Technology, ChangSha, China;School of Electronic Science and Engineering, National University of Defense Technology, ChangSha, China
Venue:
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Year:
2009

Citing 5
Cited 0

Future paths for integer programming and links to artificial intelligence

Computers and Operations Research - Special issue: Applications of integer programming
Tabu Search

Tabu Search
Radio Link Frequency Assignment

Constraints
Tabu Search for Frequency Assignment in Mobile Radio Networks

Journal of Heuristics
Heuristic manipulation, tabu search and frequency assignment

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

Fixed spectrum frequency assignment problem, known as a NP-hard problem, is frequencies available are fixed and the goal is to minimize the interference due to the reuse of frequencies. The problem is still very important in wireless communication networks. An improved heuristic method, tabu search with a special data structure named single-frequency violation and an initialization strategy along with other new features, are presented. Experimentations tested on standard benchmark problems confirm that the algorithm could improve the solution speed without the solution quality declined.