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 条
  • [31] An alternate approach to solve two-level priority based assignment problem
    Fanrong Xie
    Anuj Sharma
    Zuoan Li
    Computational Optimization and Applications, 2022, 81 : 613 - 656
  • [32] An alternate approach to solve two-level priority based assignment problem
    Xie, Fanrong
    Sharma, Anuj
    Li, Zuoan
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2022, 81 (02) : 613 - 656
  • [33] COMPARISON OF 2 RESOLUTION METHODS FOR A QUADRATIC COMBINATORIAL PROBLEM
    HENNET, JC
    RAIRO-RECHERCHE OPERATIONNELLE-OPERATIONS RESEARCH, 1983, 17 (03): : 285 - 295
  • [34] RELAXED ASSIGNMENT ALGORITHM FOR THE QUADRATIC ASSIGNMENT PROBLEM.
    Smith, J.MacGregor
    MacLeod, Robert
    INFOR: Information Systems and Operational Research, 1988, 26 (03): : 170 - 190
  • [35] Performance Comparison of Methods to Solve the Routing and Spectrum Allocation Problem
    Duran, R. J.
    Rodriguez, I.
    Fernandez, N.
    de Miguel, I.
    Merayo, N.
    Fernandez, P.
    Aguado, J. C.
    Jimenez, T.
    Lorenzo, R. M.
    Abril, E. J.
    2012 14TH INTERNATIONAL CONFERENCE ON TRANSPARENT OPTICAL NETWORKS (ICTON 2012), 2012,
  • [36] The quadratic three-dimensional assignment problem:: Exact and approximate solution methods
    Hahn, Peter M.
    Kim, Burn-Jin
    Stuetzle, Thomas
    Kanthak, Sebastian
    Hightower, William L.
    Samra, Harvind
    Ding, Zhi
    Guignard, Monique
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 184 (02) : 416 - 428
  • [37] Approximating the maximum quadratic assignment problem
    Arkin, EM
    Hassin, R
    PROCEEDINGS OF THE ELEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2000, : 889 - 890
  • [38] A HEURISTIC APPROACH TO QUADRATIC ASSIGNMENT PROBLEM
    LASHKARI, RS
    JAISINGH, SC
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1980, 31 (09) : 845 - 850
  • [39] The Wiener maximum quadratic assignment problem
    Cela, Eranda
    Schmuck, Nina S.
    Wimer, Shmuel
    Woeginger, Gerhard J.
    DISCRETE OPTIMIZATION, 2011, 8 (03) : 411 - 416
  • [40] A PARALLEL ALGORITHM FOR THE QUADRATIC ASSIGNMENT PROBLEM
    PARDALOS, PM
    CROUSE, JV
    PROCEEDINGS : SUPERCOMPUTING 89, 1989, : 351 - 360
12345