Quadratic assignment problem variants: A survey and an effective parallel memetic iterated tabu search

2020 ◽  
Author(s):  
Allyson Silva ◽  
Leandro C. Coelho ◽  
Maryam Darvish
Keyword(s):  
Tabu Search ◽  
Assignment Problem ◽  
Quadratic Assignment Problem ◽  
Quadratic Assignment ◽  
Iterated Tabu Search

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

2020 ◽  
Vol 90 ◽  
pp. 96-115
Author(s):  
Alfonsas Misevičius ◽  
Dovilė Kuznecovaitė (Verenė)
Keyword(s):  
Tabu Search ◽  
Assignment Problem ◽  
Search Algorithm ◽  
Quadratic Assignment Problem ◽  
Test Sample ◽  
Quadratic Assignment ◽  
Search Process ◽  
Tabu Search Algorithm ◽  
Overall Performance ◽  
Iterated Tabu Search

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.

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

2019 ◽  
Vol 85 ◽  
pp. 115-134
Author(s):  
Alfonsas Misevičius ◽  
Dovilė Kuznecovaitė (Verenė)
Keyword(s):  
Tabu Search ◽  
Assignment Problem ◽  
Search Algorithm ◽  
Quadratic Assignment Problem ◽  
Test Sample ◽  
Quadratic Assignment ◽  
Search Process ◽  
Tabu Search Algorithm ◽  
Overall Performance ◽  
Iterated Tabu Search

 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.

AN IMPROVED HYBRID OPTIMIZATION ALGORITHM FOR THE QUADRATIC ASSIGNMENT PROBLEM

2005 ◽  
Vol 9 (2) ◽  
pp. 149-168 ◽  
Author(s):  
A. Misevičius
Keyword(s):  
Simulated Annealing ◽  
Tabu Search ◽  
Optimization Algorithm ◽  
Assignment Problem ◽  
Optimization Problem ◽  
Heuristic Algorithms ◽  
Quadratic Assignment Problem ◽  
Hybrid Optimization ◽  
Quadratic Assignment ◽  
Hybrid Optimization Algorithm

In this paper, we present an improved hybrid optimization algorithm, which was applied to the hard combinatorial optimization problem, the quadratic assignment problem (QAP). This is an extended version of the earlier hybrid heuristic approach proposed by the author. The new algorithm is distinguished for the further exploitation of the idea of hybridization of the well‐known efficient heuristic algorithms, namely, simulated annealing (SA) and tabu search (TS). The important feature of our algorithm is the so‐called “cold restart mechanism”, which is used in order to avoid a possible “stagnation” of the search. This strategy resulted in very good solutions obtained during simulations with a number of the QAP instances (test data). These solutions show that the proposed algorithm outperforms both the “pure” SA/TS algorithms and the earlier author's combined SA and TS algorithm. Key words: hybrid optimization, simulated annealing, tabu search, quadratic assignment problem, simulation.

scholarly journals A hybrid Tabu search-simulated annealing method to solve quadratic assignment problem

2014 ◽  
Vol 3 (3) ◽  
pp. 391-396 ◽  
Author(s):  
Mohamad Amin Kaviani ◽  
Mehdi Abbasi ◽  
Bentolhoda Rahpeyma ◽  
Mohamad Mehdi Yusefi
Keyword(s):  
Simulated Annealing ◽  
Tabu Search ◽  
Assignment Problem ◽  
Quadratic Assignment Problem ◽  
Quadratic Assignment ◽  
Simulated Annealing Method ◽  
Annealing Method

scholarly journals A new heuristic for the quadratic assignment problem

2002 ◽  
Vol 6 (3) ◽  
pp. 143-153 ◽  
Author(s):  
Zvi Drezner
Keyword(s):  
Genetic Algorithms ◽  
Tabu Search ◽  
Assignment Problem ◽  
Quadratic Assignment Problem ◽  
Quadratic Assignment ◽  
Test Problems ◽  
Heuristic Procedures

We propose a new heuristic for the solution of the quadratic assignment problem. The heuristic combines ideas from tabu search and genetic algorithms. Run times are very short compared with other heuristic procedures. The heuristic performed very well on a set of test problems.

Sign in / Sign up

Export Citation Format

Share Document