An ANTS heuristic for the frequency assignment problem

被引：118

作者：

Maniezzo, V ^{[1
]}

Carbonaro, A ^{[1
]}

机构：

[1] Univ Bologna, Dept Comp Sci, I-47023 Cesena, Italy

来源：

FUTURE GENERATION COMPUTER SYSTEMS | 2000年 / 16卷 / 08期

关键词：

frequency assignment problem; ant colony optimization; metaheuristic algorithms;

D O I：

10.1016/S0167-739X(00)00046-7

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

The problem considered in this paper consists in assigning frequencies to radio links between base stations and mobile transmitters in order to minimize the global interference over a given region. This problem is NP-hard and few results have been reported on techniques for solving it to optimality. We have applied to this problem an ANTS metaheuristic, that is, an approach following the ant colony optimization paradigm. Computational results, obtained on a number of standard problem instances, testify the effectiveness of the proposed approach. (C) 2000 Elsevier Science B.V.

引用

页码：927 / 935

页数：9

共 30 条

[1]

AARDAL KI, 1995, T221A TU EINDH TU DE

[2]

ADJAKPLE P, 1998, NEW CLASS LOWER BOUN

[3]

ADJAKPLE PM, 1997, G9745 GERAD

[4] SIMULATION STUDY OF SOME DYNAMIC CHANNEL ASSIGNMENT ALGORITHMS IN A HIGH-CAPACITY MOBILE TELECOMMUNICATIONS SYSTEM [J].

ANDERSON, LG .

IEEE TRANSACTIONS ON COMMUNICATIONS, 1973, CO21 (11) :1294-1301

[5]

[Anonymous], 1992, OPTIMIZATION LEARNIN

[6] Frequency assignment in cellular phone networks [J].

Borndorfer, R ;

Eisenblatter, A ;

Grotschel, M ;

Martin, A .

ANNALS OF OPERATIONS RESEARCH, 1998, 76 (0) :73-93

[7]

BORNDORFER R, 1998, 9801 TR KONR ZUS INF

[8]

CAMINADA A, 1995, FTCNETBELPOHCDI7195C

[9]

Colorni A, 1991, P 1 EUR C ART LIF, DOI DOI 10.1109/MHS.1995.494215

[10]

Dorigo M, 1999, NEW IDEAS OPTIMIZATI, P11

← 1 2 3 →