Channel assignment problem in cellular systems: a new model and a tabu search algorithm

1999 ◽  
Vol 48 (4) ◽  
pp. 1252-1260 ◽  
Author(s):  
A. Capone ◽  
M. Trubian
Keyword(s):  
Tabu Search ◽  
Channel Assignment ◽  
Assignment Problem ◽  
Search Algorithm ◽  
Cellular Systems ◽  
Tabu Search Algorithm ◽  
New Model ◽  
Channel Assignment Problem

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.

Sign in / Sign up

Export Citation Format

Share Document