A tabu search algorithm for the quadratic assignment problem
From MaRDI portal
Publication:1773110
DOI10.1007/s10589-005-4562-xzbMath1130.90041OpenAlexW1975389169MaRDI QIDQ1773110
Publication date: 25 April 2005
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-005-4562-x
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
The generalised machine layout problem ⋮ A cooperative parallel tabu search algorithm for the quadratic assignment problem ⋮ Computing the metric dimension of graphs by genetic algorithms ⋮ A survey for the quadratic assignment problem ⋮ A hybrid method integrating an elite genetic algorithm with tabu search for the quadratic assignment problem ⋮ Comparative performance of tabu search and simulated annealing heuristics for the quadratic assignment problem ⋮ An efficient implementation of the robust tabu search heuristic for sparse quadratic assignment problems ⋮ An implementation of the iterated tabu search algorithm for the quadratic assignment problem ⋮ Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem ⋮ An experimental study of variable depth search algorithms for the quadratic assignment problem ⋮ An ejection chain algorithm for the quadratic assignment problem ⋮ Finding a cluster of points and the grey pattern quadratic assignment problem ⋮ Sequential Monte Carlo for maximum weight subgraphs with application to solving image jigsaw puzzles ⋮ Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
Uses Software
