Tabu Search for Frequency Assignment in Mobile Radio Networks
Journal of Heuristics
An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem
INFORMS Journal on Computing
Performance of Various Computers Using Standard Linear Equations Software
Performance of Various Computers Using Standard Linear Equations Software
A heuristic manipulation technique for the sequential ordering problem
Computers and Operations Research
The stable set problem and the thinness of a graph
Operations Research Letters
A Tabu search algorithm for frequency assignment problem in wireless communication networks
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Hybrid metaheuristics in combinatorial optimization: A survey
Applied Soft Computing
Hi-index | 0.02 |
Heuristic manipulation attempts to modify the search space of an optimization problem, using information provided by an underlying heuristic method. In this paper it is applied in combination with tabu search to the fixed spectrum frequency assignment problem. The frequency assignment problem involves the assignment of discrete channels (or frequencies) to the transmitters of a radio network, such as a mobile telephone network. Frequency separation is necessary to avoid interference by other transmitters to the signal received from the wanted transmitter at the reception points. Unnecessary separation causes an excess requirement for spectrum. Good assignments minimize interference and the spectrum required. In fixed spectrum frequency assignment the frequency spectrum available is given and the target is to minimize the interference in the network. Computational experiments confirm that the manipulation technique is able to drive the underlying tabu search algorithm towards improved solutions.