Models and solution techniques for frequency assignment problems

被引:151
作者
Aardal, Karen I.
van Hoesel, Stan P. M.
Koster, Arie M. C. A. [1 ]
Mannino, Carlo
Sassano, Antonio
机构
[1] Univ Warwick, Ctr Discrete Math & Applicat DIMAP, Coventry CV4 7AL, W Midlands, England
[2] Univ Roma La Sapienza, Dipartimento Informat & Sistemist, I-00185 Rome, Italy
[3] Ctr Wiskunde & Informat, NL-1090 GB Amsterdam, Netherlands
[4] Univ Maastricht, Dept Quantitat Econ, NL-6200 MD Maastricht, Netherlands
关键词
frequency assignment; channel assignment; wireless networks; mathematical optimization models; exact methods; heuristics;
D O I
10.1007/s10479-007-0178-0
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
Wireless communication is used in many different situations such as mobile telephony, radio and TV broadcasting, satellite communication, wireless LANs, 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.
引用
收藏
页码:79 / 129
页数:51
相关论文
共 153 条
[81]   Channel assignment schemes for cellular mobile telecommunication systems: A comprehensive survey [J].
Katzela, I ;
Naghshineh, M .
IEEE PERSONAL COMMUNICATIONS, 1996, 3 (03) :10-31
[82]   OPTIMUM FREQUENCY REUSE IN MOBILE TELEPHONY SYSTEMS [J].
KAZANTZAKIS, MG ;
DEMESTICHAS, PP ;
ANAGNOSTOU, ME .
INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, 1995, 8 (03) :185-190
[83]   Cellular radio channel assignment using a modified Hopfield network [J].
Kim, JS ;
Park, SH ;
Dowd, PW ;
Nasrabadi, NM .
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 1997, 46 (04) :957-967
[84]   A genetic algorithm for the partial binary constraint satisfaction problem: an application to a frequency assignment problem [J].
Kolen, Antoon .
STATISTICA NEERLANDICA, 2007, 61 (01) :4-15
[85]  
KOLEN AWJ, 1994, 222 EUCLID CALMA
[86]   Domination analysis of greedy heuristics for the frequency assignment problem [J].
Koller, AE ;
Noble, SD .
DISCRETE MATHEMATICS, 2004, 275 (1-3) :331-338
[87]  
Koster A. M. C. A., 1999, THESIS MAASTRICHT U
[88]  
KOSTER AMC, 2001, RICERCA OPERATIVA, V30, P101
[89]   Solving partial constraint satisfaction problems with tree decomposition [J].
Koster, AMCA ;
van Hoesel, SPM ;
Kolen, AWJ .
NETWORKS, 2002, 40 (03) :170-180
[90]   The partial constraint satisfaction problem: Facets and lifting theorems [J].
Koster, AMCA ;
van Hoesel, SPM ;
Kolen, AWJ .
OPERATIONS RESEARCH LETTERS, 1998, 23 (3-5) :89-97