A 2-Level Iterated Tabu Search Algorithm for the Quadratic Assignment Problem
Articles
Alfonsas Misevičius
Kaunas University of Technology, Lithuania
Dovilė Kuznecovaitė (Verenė)
Kaunas University of Technology, Lithuania
Published 2019-10-28
https://doi.org/10.15388/Im.2019.85.19
PDF
HTML

Keywords

computational intelligence
combinatorial optimization
heuristic algorithms
tabu search
mutation procedures
quadratic assignment problem

How to Cite

Misevičius A. and Kuznecovaitė (Verenė) D. (2019) “A 2-Level Iterated Tabu Search Algorithm for the Quadratic Assignment Problem”, Informacijos mokslai, 850, pp. 115-134. doi: 10.15388/Im.2019.85.19.

Abstract

 In this paper, a 2-level iterated tabu search (ITS) algorithm for the solution of the quadratic assignment problem (QAP) is considered. The novelty of the proposed ITS algorithm is that the solution mutation procedures are incorporated within the algorithm, which enable to diversify the search process and eliminate the search stagnation, thus increasing the algorithm’s efficiency. In the computational experiments, the algorithm is examined with various implemented variants of the mutation procedures using the QAP test (sample) instances from the library of the QAP instances – QAPLIB. The results of these experiments demonstrate how the different mutation procedures affect and possibly improve the overall performance of the ITS algorithm.

PDF
HTML
Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Please read the Copyright Notice in Journal Policy