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 条
  • [1] Multistart Tabu Search and Diversification Strategies for the Quadratic Assignment Problem
    James, Tabitha
    Rego, Cesar
    Glover, Fred
    IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART A-SYSTEMS AND HUMANS, 2009, 39 (03): : 579 - 596
  • [2] The bipartite quadratic assignment problem and extensions
    Punnen, Abraham P.
    Wang, Yang
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 250 (03) : 715 - 725
  • [3] A comparison of different metaheuristics for the quadratic assignment problem in accelerated systems
    Kumar, Manoj
    Sahu, Aryabartta
    Mitra, Pinaki
    APPLIED SOFT COMPUTING, 2021, 100
  • [4] A survey for the quadratic assignment problem
    Loiola, Eliane Maria
    de Abreu, Nair Maria Maia
    Boaventura-Netto, Paulo Oswaldo
    Hahn, Peter
    Querido, Tania
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 176 (02) : 657 - 690
  • [5] Memetic search for the quadratic assignment problem
    Benlic, Una
    Hao, Jin-Kao
    EXPERT SYSTEMS WITH APPLICATIONS, 2015, 42 (01) : 584 - 595
  • [6] A Hybrid Metaheuristic for the Quadratic Assignment Problem
    Lin-Yu Tseng
    Shyi-Ching Liang
    Computational Optimization and Applications, 2006, 34 : 85 - 113
  • [7] On the hardness of the quadratic assignment problem with metaheuristics
    Angel, E
    Zissimopoulos, V
    JOURNAL OF HEURISTICS, 2002, 8 (04) : 399 - 414
  • [8] A hybrid metaheuristic for the quadratic assignment problem
    Tseng, LY
    Liang, SC
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2006, 34 (01) : 85 - 113
  • [9] Ant colonies for the quadratic assignment problem
    Gambardella, LM
    Taillard, ÉD
    Dorigo, M
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1999, 50 (02) : 167 - 176
  • [10] On the landscape ruggedness of the quadratic assignment problem
    Angel, E
    Zissimopoulos, V
    THEORETICAL COMPUTER SCIENCE, 2001, 263 (1-2) : 159 - 172
12345