The extended concentric tabu for the quadratic assignment problem

In this paper we propose to extend the concentric tabu search for the quadratic assignment problem to include more permissible moves. Two extensions are suggested and tested. The computational comparisons with existing hybrid genetic algorithms provide comparable solutions to the best available algorithms.