A tabu search algorithm for frequency assignment

被引：58

作者：

Castelino, DJ ^{[1
]}

Hurley, S ^{[1
]}

Stephens, NM ^{[1
]}

机构：

[1] UNIV WALES CARDIFF,DEPT COMP SCI,CARDIFF CF2 3XF,S GLAM,WALES

来源：

ANNALS OF OPERATIONS RESEARCH | 1996年 / 63卷

关键词：

D O I：

10.1007/BF02125459

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

This paper presents the application of a tabu search algorithm for solving the frequency assignment problem. This problem, known to be NP-hard, is to find an assignment of frequencies for a number of communication links, which satisfy various constraints. We report on our computational experiments in terms of computational efficiency and quality of the solutions obtained for realistic, computer-generated problem instances. The method is efficient, robust and stable and gives solutions which compare more favourably than ones obtained using a genetic algorithm.

引用

页码：301 / 319

页数：19

共 33 条

[1]

[Anonymous], P IMACS IEEE INT S S

[2]

[Anonymous], 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness

[3]

BARNES JW, 1991, J INT MAN, V2, P63

[4]

BELTRAN H, 1994, IN PRESS TELECOMMUN

[5]

CHAKRAPANI J, 1993, ANN OPER RES, V41, P207

[6]

CHIBA K, 1992, IEICE T COMMUN, VE75B, P476

[7]

Costa D., 1993, Annals of Operations Research, V41, P343, DOI 10.1007/BF02023000

[8]

CROMPTON W, 1993, P IEE IEEE NAT ALG S, V2

[9]

Daniels R. L., 1993, Annals of Operations Research, V41, P207, DOI 10.1007/BF02023075

[10] CHROMATIC SCHEDULING AND FREQUENCY ASSIGNMENT [J].

DEWERRA, D ;

GAY, Y .

DISCRETE APPLIED MATHEMATICS, 1994, 49 (1-3) :165-174

← 1 2 3 4 →