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
关键词
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 条
  • [21] On the Maximum Quadratic Assignment Problem
    Nagarajan, Viswanath
    Sviridenko, Maxim
    MATHEMATICS OF OPERATIONS RESEARCH, 2009, 34 (04) : 859 - 868
  • [22] On the Maximum Quadratic Assignment Problem
    Nagarajan, Viswanath
    Sviridenko, Maxim
    PROCEEDINGS OF THE TWENTIETH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2009, : 516 - +
  • [23] The Random Quadratic Assignment Problem
    Paul, Gerald
    Shao, Jia
    Stanley, H. Eugene
    JOURNAL OF STATISTICAL PHYSICS, 2011, 145 (03) : 734 - 744
  • [24] ALGORITHM FOR QUADRATIC ASSIGNMENT PROBLEM
    GRAVES, GW
    WHINSTON, AB
    MANAGEMENT SCIENCE SERIES A-THEORY, 1970, 16 (07): : 453 - 471
  • [25] Solving the Quadratic Assignment Problem
    I. V. Sergienko
    V. P. Shylo
    S. V. Chupov
    P. V. Shylo
    Cybernetics and Systems Analysis, 2020, 56 : 53 - 57
  • [26] CONTRIBUTIONS TO THE QUADRATIC ASSIGNMENT PROBLEM
    CHRISTOFIDES, N
    MINGOZZI, A
    TOTH, P
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1980, 4 (04) : 243 - 247
  • [27] ON THE USE OF EXACT AND HEURISTIC CUTTING PLANE METHODS FOR THE QUADRATIC ASSIGNMENT PROBLEM
    BAZARAA, MS
    SHERALI, HD
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1982, 33 (11) : 991 - 1003
  • [28] A LABELING ALGORITHM TO SOLVE THE ASSIGNMENT PROBLEM
    LOTFI, V
    COMPUTERS & OPERATIONS RESEARCH, 1989, 16 (05) : 397 - 408
  • [29] THE RECURRENT METHOD TO SOLVE THE ASSIGNMENT PROBLEM
    Matsiy, O. B.
    Morozov, A. V.
    Panishev, A. V.
    CYBERNETICS AND SYSTEMS ANALYSIS, 2015, 51 (06) : 939 - 946
  • [30] An Empirical Comparison of Memetic Algorithm Strategies on the Multiobjective Quadratic Assignment Problem
    Garrett, Deon
    Dasgupta, Dipankar
    MCDM: 2009 IEEE SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE IN MULTI-CRITERIA DECISION-MAKING, 2009, : 80 - 87