Models and Solution Techniques for Frequency Assignment Problems

Wireless communication is used in many different situations such as mobile telephony, radio and TV broadcasting, satellite communication, and military operations. In each of these situations a frequency assignment problem arises with application specific characteristics. Researchers have developed different modeling ideas for each of the features of the problem, such as the handling of interference among radio signals, the availability of frequencies, and the optimization criterion. This survey gives an overview of the models and methods that the literature provides on the topic. We present a broad description of the practical settings in which frequency assignment is applied. We also present a classification of the different models and formulations described in the literature, such that the common features of the models are emphasized. The solution methods are divided in two parts. Optimization and lower bounding techniques on the one hand, and heuristic search techniques on the other hand. The literature is classified according to the used methods. Again, we emphasize the common features, used in the different papers. The quality of the solution methods is compared, whenever possible, on publicly available benchmark instances

A decomposition approach for the Frequency Assignment Problem

The Frequency Assignment Problem (FAP) is an important optimization problem that arises in operational cellular wireless networks. Solution techniques based on meta-heuristic algorithms have been shown to be successful for some test problems but they have not been usually demonstrated on large scale problems that occur in practice. This thesis applies a problem decomposition approach in order to solve FAP in stances with standard meta-heuristics. Three different formulations of the problem are considered in order of difficulty: Minimum Span (MS-FAP), Fixed Spectrum (MS-FAP), and Minimum Interference FAP (MI-FAP). We propose a decomposed assignment technique which aims to divide the initial problem into a number of subproblems and then solves them either independently or in sequence respecting the constraints between them. Finally, partial subproblem solutions are recomposed into a solution of the original problem. Standard implementations of meta-heuristics may require considerable run times to produce good quality results whenever a problem is very large or complex. Our results, obtained by applying the decomposed approach to a Simulated Annealing and a Genetic Algorithm with two different assignment representations (direct and order-based), show that the decomposed assignment approach proposed can improve their outcomes, both in terms of solution quality and runtime. A number of partitioning methods are presented and compared for each FAP, such as clique detection partitioning based on sequential orderings and novel applications of existing graph partitioning and clustering methods adapted for this problem

Models and Solution Techniques for Frequency Assignment Problems

Wireless communication is used in many different situations such as mobile telephony, radio and TV broadcasting, satellite communication, and military operations. In each of these situations a frequency assignment problem arises with application specific characteristics. Researchers have developed different modeling ideas for each of the features of the problem, such as the handling of interference among radio signals, the availability of frequencies, and the optimization criterion. This survey gives an overview of the models and methods that the literature provides on the topic. We present a broad description of the practical settings in which frequency assignment is applied. We also present a classification of the different models and formulations described in the literature, such that the common features of the models are emphasized. The solution methods are divided in two parts. Optimization and lower bounding techniques on the one hand, and heuristic search techniques on the other hand. The literature is classified according to the used methods. Again, we emphasize the common features, used in the different papers. The quality of the solution methods is compared, whenever possible, on publicly available benchmark instances