A tabu search algorithm for the quadratic assignment problem

Authors:
Alfonsas Misevicius
Affiliations:
Department of Practical Informatics, Kaunas University of Technology, Studentu St. 50-416a, LT-3031 Kaunas, Lithuania
Venue:
Computational Optimization and Applications
Year:
2005

Citing 12
Cited 15

A flexible, polynomial-time, construction and improvement heuristic for the quadratic assignment problem

Computers and Operations Research - Special issue: Applications of integer programming
Massively parallel tabu search for the quadratic assignment problem

Annals of Operations Research - Special issue on Tabu search
Extensions of a tabu search adaptation to the quadratic assignment problem

Computers and Operations Research - Special issue: heuristic, genetic and tabu search
A study of diversification strategies for the quadratic assignment problem

Computers and Operations Research - Special issue: heuristic, genetic and tabu search
A genetic approach to the quadratic assignment problem

Computers and Operations Research - Special issue on genetic algorithms
Variable neighborhood search

Computers and Operations Research
P-Complete Approximation Problems

Journal of the ACM (JACM)
Efficient Genetic Algorithms Using Simple Genes Exchange LocalSearch Policy for the Quadratic Assignment Problem

Computational Optimization and Applications
Record breaking optimization results using the ruin and recreate principle

Journal of Computational Physics
Tabu Search

Tabu Search
QAPLIB – A Quadratic Assignment ProblemLibrary

Journal of Global Optimization
Adaptive memories for the Quadratic Assignment Problems

Adaptive memories for the Quadratic Assignment Problems

Sequential and Parallel Path-Relinking Algorithms for the Quadratic Assignment Problem

IEEE Intelligent Systems
A fast hybrid genetic algorithm for the quadratic assignment problem

Proceedings of the 8th annual conference on Genetic and evolutionary computation
Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem

Computers and Operations Research
Experiments with Hybrid Genetic Algorithm for the Grey Pattern Problem

Informatica
Testing of Hybrid Genetic Algorithms for Structured Quadratic Assignment Problems

Informatica
Multistart tabu search and diversification strategies for the quadratic assignment problem

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Computing the metric dimension of graphs by genetic algorithms

Computational Optimization and Applications
Self Controlling Tabu Search algorithm for the Quadratic Assignment Problem

Computers and Industrial Engineering
Variable neighborhood search with permutation distance for QAP

KES'05 Proceedings of the 9th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part IV
Comparative performance of tabu search and simulated annealing heuristics for the quadratic assignment problem

Operations Research Letters
An implementation of the iterated tabu search algorithm for the quadratic assignment problem

OR Spectrum
Global equilibrium search algorithms for combinatorial optimization problems

PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part II
A Tabu Search Approach for the NMR Protein Structure-Based Assignment Problem

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Enhancing the performance of hybrid genetic algorithms by differential improvement

Computers and Operations Research
Path Relinking with Multi-Start Tabu Search for the Quadratic Assignment Problem

International Journal of Swarm Intelligence Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

Tabu search approach based algorithms are among the widest applied to various combinatorial optimization problems. In this paper, we propose a new version of the tabu search algorithm for the well-known problem, the quadratic assignment problem (QAP). One of the most important features of our tabu search implementation is an efficient use of mutations applied to the best solutions found so far. We tested this approach on a number of instances from the library of the QAP instances--QAPLIB. The results obtained from the experiments show that the proposed algorithm belongs to the most efficient heuristics for the QAP. The high efficiency of this algorithm is also demonstrated by the fact that the new best known solutions were found for several QAP instances.