A 2-Level Iterated Tabu Search Algorithm for the Quadratic Assignment Problem

A 2-Level Iterated Tabu Search Algorithm for the Quadratic Assignment Problem

 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 pro...

Full description

Bibliographic Details
Main Authors: Alfonsas Misevičius, Dovilė Kuznecovaitė (Verenė)
Format: Article
Language:English
Published: Vilnius University Press 2019-10-01
Series:Informacijos Mokslai
Subjects:
computational intelligence
combinatorial optimization
heuristic algorithms
tabu search
mutation procedures
quadratic assignment problem
Online Access:http://www.zurnalai.vu.lt/informacijos-mokslai/article/view/14793

Similar Items

Similar Items