Applying an extended guided local search to the quadratic assignment problem

被引：29
|
作者：
Mills, P [1 ]
Tsang, E [1 ]
Ford, J [1 ]
机构：
[1] Univ Essex, Dept Comp Sci, Colchester CO4 3SQ, Essex, England
来源：
ANNALS OF OPERATIONS RESEARCH | 2003年 / 118卷 / 1-4期
关键词：
local search; meta-heuristics; quadratic assignment problem;
D O I：
10.1023/A:1021857607524
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
In this paper, we show how an extended Guided Local Search (GLS) can be applied to the Quadratic Assignment Problem (QAP). GLS is a general, penalty-based meta-heuristic, which sits on top of local search algorithms, to help guide them out of local minima. We present empirical results of applying several extended versions of GLS to the QAP, and show that these extensions can improve the range of parameter settings within which Guided Local Search performs well. Finally, we compare the results of running our extended GLS with some state of the art algorithms for the QAP.
引用
收藏
页码：121 / 135
页数：15
相关论文
共 50 条
  • [1] Applying an Extended Guided Local Search to the Quadratic Assignment Problem
    Patrick Mills
    Edward Tsang
    John Ford
    [J]. Annals of Operations Research, 2003, 118 : 121 - 135
  • [2] On the quality of local search for the quadratic assignment problem
    Angel, E
    Zissimopoulos, V
    [J]. DISCRETE APPLIED MATHEMATICS, 1998, 82 (1-3) : 15 - 25
  • [3] Breakout local search for the quadratic assignment problem
    Benlic, Una
    Hao, Jin-Kao
    [J]. APPLIED MATHEMATICS AND COMPUTATION, 2013, 219 (09) : 4800 - 4815
  • [4] Iterated local search for the quadratic assignment problem
    Stuetzle, Thomas
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2006, 174 (03) : 1519 - 1539
  • [5] Hierarchical Iterated Local Search for the Quadratic Assignment Problem
    Hussin, Mohamed Saifullah
    Stutzle, Thomas
    [J]. HYBRID METAHEURISTICS, PROCEEDINGS, 2009, 5818 : 115 - 129
  • [6] Consultant-Guided Search Algorithms for the Quadratic Assignment Problem
    Iordache, Serban
    [J]. HYBRID METAHEURISTICS, 2010, 6373 : 148 - 159
  • [7] Consultant-Guided Search Algorithms for the Quadratic Assignment Problem
    Iordache, Serban
    [J]. GECCO-2010 COMPANION PUBLICATION: PROCEEDINGS OF THE 12TH ANNUAL GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2010, : 2089 - 2090
  • [8] Ant Colony with Stochastic Local Search for the Quadratic Assignment Problem
    Mouhoub, Malek
    Wang, Zhijie
    [J]. ICTAI-2006: EIGHTEENTH INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2006, : 127 - +
  • [9] A Memetic Algorithm for the Quadratic Assignment Problem with Parallel Local Search
    Harris, Matthew
    Berretta, Regina
    Inostroza-Ponta, Mario
    Moscato, Pablo
    [J]. 2015 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2015, : 838 - 845
  • [10] A Local Search based on Variant Variable Depth Search for the Quadratic Assignment Problem
    Okano, Takeshi
    Katayama, Kengo
    Kanahara, Kazuho
    Nishihara, Noritaka
    [J]. 2018 IEEE 7TH GLOBAL CONFERENCE ON CONSUMER ELECTRONICS (GCCE 2018), 2018, : 60 - 63
12345