A parallel tabu search and its hybridization with genetic algorithms

被引：3

作者：

Matsumura, T ^{[1
]}

Nakamura, M ^{[1
]}

Tamaki, S ^{[1
]}

Onaga, K ^{[1
]}

机构：

[1] Univ Ryukyus, Dept Informat Engn, Nishihara, Okinawa 9030213, Japan

来源：

I-SPAN 2000: INTERNATIONAL SYMPOSIUM ON PARALLEL ARCHITECTURES ALGORITHMS AND NETWORKS, PROCEEDINGS | 2000年

关键词：

D O I：

10.1109/ISPAN.2000.900254

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 [计算机软件与理论];

摘要：

This paper proposes two parallel meta-heuristics. One is a cooperative parallel tabu search which incorporates with the historical information exchange among processors in addition to its own searching of each processor. The other is a cooperative parallel starch between genetic algorithm and tabu search processes. Through computational experiment we observe the improvement of solutions by our proposed method.

引用

页码：18 / 22

页数：5

共 19 条

[1]

TABU SEARCH AND DESIGN OPTIMIZATION [J].

BLAND, JA ;

DAWSON, GP .

COMPUTER-AIDED DESIGN, 1991, 23 (03) :195-201

[2]

Freville A., 1990, INVESTIGATION OPERAT, V1, P251

[3]

Gendreau M., 1993, Annals of Operations Research, V41, P385, DOI 10.1007/BF02023002

[4]

Glover F., 1988, Tabu Search

[5]

HOLLAND JH, 1992, ADAPTATION NATURAL A

[6]

KELLY J, 1993, ANN OPS RES, V41, P68

[7]

KHURI S, 1994, P 1994 ACM S APPL CO, P188, DOI DOI 10.1145/326619.326694.(HTTP://D0LACM.0RG/10.1145/326619.326694)

[8]

OPTIMIZATION BY SIMULATED ANNEALING [J].

KIRKPATRICK, S ;

GELATT, CD ;

VECCHI, MP .

SCIENCE, 1983, 220 (4598) :671-680

[9]

LIN S, 1973, ANN OPS RES, V21, P495

[10]

MIYAGI O, 1995, THESIS U RYUKYUS JAP

← 1 2 →