An improved tabu search algorithm for the fixed-spectrum frequency-assignment problem

作     者：Montemanni, R Moon, JNJ Smith, DH 

作者机构：Univ Glamorgan Sch Comp Pontypridd CF37 1DL M Glam Wales Univ Glamorgan Div Math Pontypridd CF37 1DL M Glam Wales 

出 版 物：《IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY》 (IEEE Trans. Veh. Technol.)

年 卷 期：2003年第52卷第4期

页      面：891-901页

核心收录：

学科分类：0810[工学-信息与通信工程] 0808[工学-电气工程] 08[工学] 0823[工学-交通运输工程] 

主　　题：fixed-spectrum problems radio-frequency assignment tabu search algorithm 

摘      要：A tabu search algorithm with a dynamic tabu list for the fixed-spectrum frequency-assignment problem is presented. For cellular problems, the algorithm can be combined with an efficient cell reoptimization step. The algorithm is tested on several sets of test problems and compared with existing algorithms of established performance. In particular, it is used to improve some of the best existing assignments for COST 259 benchmarks. These results add support to the claim that the algorithm is the most effective available, at least when solution quality is a more important criterion than solution speed. The algorithm is robust and easy to tune.