A Biogeography-Based Optimization Algorithm Hybridized with Tabu Search for the Quadratic Assignment Problem

Abstract EN

The quadratic assignment problem (QAP) is an NP-hard combinatorial optimization problem with a wide variety of applications.

Biogeography-based optimization (BBO), a relatively new optimization technique based on the biogeography concept, uses the idea of migration strategy of species to derive algorithm for solving optimization problems.

It has been shown that BBO provides performance on a par with other optimization methods.

A classical BBO algorithm employs the mutation operator as its diversification strategy.

However, this process will often ruin the quality of solutions in QAP.

In this paper, we propose a hybrid technique to overcome the weakness of classical BBO algorithm to solve QAP, by replacing the mutation operator with a tabu search procedure.

Our experiments using the benchmark instances from QAPLIB show that the proposed hybrid method is able to find good solutions for them within reasonable computational times.

Out of 61 benchmark instances tested, the proposed method is able to obtain the best known solutions for 57 of them.