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 条
  • [21] A tabu search algorithm for the quadratic assignment problem
    Misevicius, A
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2005, 30 (01) : 95 - 111
  • [22] Unsupervised Machine Learning for the Quadratic Assignment Problem
    The Van Luong
    Taillard, Eric D.
    METAHEURISTICS, MIC 2022, 2023, 13838 : 118 - 132
  • [23] A Tabu Search Algorithm for the Quadratic Assignment Problem
    Alfonsas Misevicius
    Computational Optimization and Applications, 2005, 30 : 95 - 111
  • [24] Parallel Ant Colonies for the quadratic assignment problem
    Talbi, EG
    Roux, O
    Fonlupt, C
    Robillard, D
    FUTURE GENERATION COMPUTER SYSTEMS, 2001, 17 (04) : 441 - 449
  • [25] The Rank-One Quadratic Assignment Problem
    Wang, Yang
    Yang, Wei
    Punnen, Abraham P.
    Tian, Jingbo
    Yin, Aihua
    Lu, Zhipeng
    INFORMS JOURNAL ON COMPUTING, 2021, 33 (03) : 979 - 996
  • [26] A greedy evolutionary hybridization algorithm for the optimal network and quadratic assignment problem
    Balde, Mouhamadou A. M. T.
    Gueye, Serigne
    Ndiaye, Babacar M.
    OPERATIONAL RESEARCH, 2021, 21 (03) : 1663 - 1690
  • [27] A Parallel Tabu Search for the Large-scale Quadratic Assignment Problem
    Abdelkafi, Omar
    Derbel, Bilel
    Liefooghe, Arnaud
    2019 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2019, : 3070 - 3077
  • [28] Fuzzy-metaheuristic methods to solve a hybrid flow shop scheduling problem with pre-assignment
    Yalaoui, Naim
    Ouazene, Yassine
    Yalaoui, Farouk
    Amodeo, Lionel
    Mahdi, Halim
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2013, 51 (12) : 3609 - 3624
  • [29] Incorporating a modified uniform crossover and 2-exchange neighborhood mechanism in a discrete bat algorithm to solve the quadratic assignment problem
    Riffi, Mohammed Essaid
    Saji, Yassine
    Barkatou, Mohammed
    EGYPTIAN INFORMATICS JOURNAL, 2017, 18 (03) : 221 - 232
  • [30] A study of exponential neighborhoods for the travelling salesman problem and for the quadratic assignment problem
    Deǐneko V.G.
    Woeginger G.J.
    Mathematical Programming, 2000, 87 (3) : 519 - 542
12345