Abstract. A novel Repeated Iterated Tabu Search for quadratic assignment problem is presented. We compare our approach to the state-of-the-art techniques and demonstrate its advantages with respect to run times and solution quality.

Keywords: quadratic assignment problem, tabu search, computing experiment, a comparative study of algorithms.