Comparison of Two Diversification Methods to Solve the Quadratic Assignment Problem

被引：5

作者：

Abdelkafi, Omar ^{[1
]}

Idoumghar, Lhassane ^{[1
]}

Lepagnot, Julien ^{[1
]}

机构：

[1] Univ Haute Alsace, Mulhouse, Alsace, France

来源：

INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE, ICCS 2015 COMPUTATIONAL SCIENCE AT THE GATES OF NATURE | 2015年 / 51卷

关键词：

metaheuristics; hybrid iterative tabu search; diversification algorithms; LOCAL SEARCH;

D O I：

10.1016/j.procs.2015.05.392

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

The quadratic assignment problem is one of the most studied NP-hard problems. It is known for its complexity which makes it a good candidate for the parallel design. In this paper, we propose and analyze two parallel cooperative algorithms based on hybrid iterative tabu search. The only difference between the two approaches is the diversification methods. Through 15 of the hardest well-known instances from QAPLIB benchmark, our algorithms produce competitive results.

引用

页码：2703 / 2707

页数：5

共 50 条

[41] An Enhanced MOGWW for the bi-objective Quadratic Assignment Problem [J].

Gutierrez, Everardo ;

Brizuela, Carlos .

INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE SYSTEMS, 2011, 4 (04) :530-549

[42] On the performance of parallel hybrid algorithms for the solution of the quadratic assignment problem [J].

Tosun, Umut .

ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2015, 39 :267-278

[43] Finding a cluster of points and the grey pattern quadratic assignment problem [J].

Zvi Drezner .

OR Spectrum, 2006, 28 :417-436

[44] Restart-Based Genetic Algorithm for the Quadratic Assignment Problem [J].

Misevicius, Alfonsas .

RESEARCH AND DEVELOPMENT IN INTELLIGENT SYSTEMS XXV, 2009, :91-104

[45] Consultant-Guided Search Algorithms for the Quadratic Assignment Problem [J].

Iordache, Serban .

HYBRID METAHEURISTICS, 2010, 6373 :148-159

[46] Randomized Decomposition Solver with the Quadratic Assignment Problem as a Case Study [J].

Mihic, Kresimir ;

Ryan, Kevin ;

Wood, Alan .

INFORMS JOURNAL ON COMPUTING, 2018, 30 (02) :295-308

[47] An implementation of the iterated tabu search algorithm for the quadratic assignment problem [J].

Alfonsas Misevicius .

OR Spectrum, 2012, 34 :665-690

[48] A MODIFICATION OF THRESHOLD ACCEPTING AND ITS APPLICATION TO THE QUADRATIC ASSIGNMENT PROBLEM [J].

NISSEN, V ;

PAUL, H .

OR SPEKTRUM, 1995, 17 (2-3) :205-210

[49] Optimization of the quadratic assignment problem using an ant colony algorithm [J].

Demirel, Nihan Cetin ;

Toksari, M. Duran .

APPLIED MATHEMATICS AND COMPUTATION, 2006, 183 (01) :427-435

[50] Finding a cluster of points and the grey pattern quadratic assignment problem [J].

Drezner, Zvi .

OR SPECTRUM, 2006, 28 (03) :417-436

← 1 2 3 4 5 →