PARALLEL COOPERATIVE SAVINGS BASED ANT COLONY OPTIMIZATION - MULTIPLE SEARCH AND DECOMPOSITION APPROACHES

被引：24

作者：

Doerner, Karl F. ^{[1
]}

Hartl, Richard F. ^{[2
]}

Benkner, Siefried ^{[3
]}

Lucka, Maria ^{[4
]}

机构：

[1] Univ Vienna, Dept Management Sci, Bruenner Str 72, A-1040 Vienna, Austria

[2] Univ Vienna, Dept Management Sci, A-1210 Vienna, Austria

[3] Univ Vienna, Inst Sci Comp, A-1090 Vienna, Austria

[4] Univ Vienna, Inst Sci Comp, A-1210 Vienna, Austria

来源：

PARALLEL PROCESSING LETTERS | 2006年 / 16卷 / 03期

关键词：

Ant Colony Optimization; Decomposition Approach; Parallel Metaheuristic; Vehicle Routing Problem;

D O I：

10.1142/S0129626406002691

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

In this paper we study different parallel implementations of the Savings based Ant System algorithm developed for solving the Vehicle Routing Problem. We analyze the effects of low-level parallelization, multiple search strategies and domain decomposition approaches. For the different strategies speedup and efficiency as well as solution quality are reported. Different information exchanges are analyzed within the multiple search strategies.

引用

页码：351 / 369

页数：19

共 29 条

[1]

Alba E, 2005, WILEY SER PARA DIST, P1, DOI 10.1002/0471739383

[2]

Alba E., 2002, LNCS, V2400

[3]

Alba E., INFORM PROCESSING LE, V82, P7

[4]

Benkner S., 2005, COMPL P PARA 04 WORK, P3

[5]

Bullnheimer B., 1999, CENTRAL EUR J OPER R, V7, P25

[6] ParadisEO: A framework for the reusable design of parallel and distributed metaheuristics [J].

Cahon, S ;

Melab, N ;

Talbi, EG .

JOURNAL OF HEURISTICS, 2004, 10 (03) :357-380

[7]

Christofides N., 1979, COMBINATORIAL OPTIMI

[8] SCHEDULING OF VEHICLES FROM CENTRAL DEPOT TO NUMBER OF DELIVERY POINTS [J].

CLARKE, G ;

WRIGHT, JW .

OPERATIONS RESEARCH, 1964, 12 (04) :568-&

[9]

Crainic T. G., 2002, HDB METAHEURISTICS, P251

[10]

Delisle P., 6 MET INT C 2005 VIE, P257

← 1 2 3 →