Parallel island-based genetic algorithm for radio network design

被引：48

作者：

Calegari, P ^{[1
]}

Guidec, F ^{[1
]}

Kuonen, P ^{[1
]}

Kobler, D ^{[1
]}

机构：

[1] Swiss Fed Inst Technol, CH-1015 Lausanne, Switzerland

来源：

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING | 1997年 / 47卷 / 01期

关键词：

Genetic algorithms; parallel computing; combinatorial optimization; island concept; set covering problem; radio transmitter siting;

D O I：

10.1006/jpdc.1997.1397

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

This paper uses a realistic combinatorial optimization problem as an example to show how a genetic algorithm can be parallelized in an efficient way. The problem considered is the selection of the best set of transmitter locations in order to cover a given geographical region at optimal cost. It is shown that it is possible to obtain good solutions to the problem even with a very low communication load. The parallel program is tested, first on an artificial example, then on a real-life case. (C) 1997 Academic Press.

引用

页码：86 / 90

页数：5

共 10 条

[1]

[Anonymous], P 47 VEH TECHN C IEE

[2]

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

[3]

[Anonymous], 1991, Handbook of genetic algorithms

[4]

Cantu-Paz E, 1995, SUMMARY RES PARALLEL

[5]

COLORNI A, 1991, 1 EUR C ART LIF, P134

[6]

GLOVER F, 1994, STAT COMPUT, V4, P131, DOI 10.1007/BF00175357

[7]

Goldberg D., 1989, GENETICS ALGORITHMS

[8]

KUONEN P, 1996, P IEEE VTC 46 VEH TE, V3, P1438

[9]

TANESE R, 1989, 2 INT C GEN ALG

[10]

WHITLEY DA, 1993, CS93103 COL STAT U

← 1 →