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] A STUDY OF DIVERSIFICATION STRATEGIES FOR THE QUADRATIC ASSIGNMENT PROBLEM
    KELLY, JP
    LAGUNA, M
    GLOVER, F
    COMPUTERS & OPERATIONS RESEARCH, 1994, 21 (08) : 885 - 893
  • [2] An Chaotic Firefly Algorithm to Solve Quadratic Assignment Problem
    Guo, Meng-Wei
    Wang, Jie-Sheng
    Yang, Xue
    ENGINEERING LETTERS, 2020, 28 (02) : 337 - 342
  • [3] 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
  • [4] METHODS OF USING THE QUADRATIC ASSIGNMENT PROBLEM SOLUTION
    Kudelska, Izabela
    LOGFORUM, 2012, 8 (03)
  • [5] A Parallel Approach of Simulated Annealing Using GPGPU to Solve the Quadratic Assignment Problem
    Takemoto, Lucas Arakaki
    Dantas, Bianca de Almeida
    Mongelli, Henrique
    2018 SYMPOSIUM ON HIGH PERFORMANCE COMPUTING SYSTEMS (WSCAD 2018), 2018, : 23 - 29
  • [6] Evaluating the performance of the Quantum Approximate Optimisation Algorithm to solve the Quadratic Assignment Problem
    Khumalo, M. T.
    Prag, K.
    Nixont, K. J.
    2022 9TH INTERNATIONAL CONFERENCE ON SOFT COMPUTING & MACHINE INTELLIGENCE, ISCMI, 2022, : 86 - 90
  • [7] A comparison of nature inspired algorithms for the quadratic assignment problem
    Chmiel, W.
    Kadluczka, P.
    Kwiecien, J.
    Filipowicz, B.
    BULLETIN OF THE POLISH ACADEMY OF SCIENCES-TECHNICAL SCIENCES, 2017, 65 (04) : 513 - 522
  • [8] THE QUADRATIC ASSIGNMENT PROBLEM
    LAWLER, EL
    MANAGEMENT SCIENCE, 1963, 9 (04) : 586 - 599
  • [9] ON THE QUADRATIC ASSIGNMENT PROBLEM
    DREZNER, Z
    OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 1984, 12 (04): : 406 - 407
  • [10] ON THE QUADRATIC ASSIGNMENT PROBLEM
    FRIEZE, AM
    YADEGAR, J
    DISCRETE APPLIED MATHEMATICS, 1983, 5 (01) : 89 - 98
12345