Comparison of Two Diversification Methods to Solve the Quadratic Assignment Problem
Omar Abdelkafi, Lhassane Idoumghar, Julien Lepagnot · Procedia Computer Science · 2015
The quadratic assignment problem is one of the most studied NP-hard problems. It is known for its complexity which makes it a good candidate for the parallel design. In this paper, we propose and analyze two parallel cooperative algorithms based on hybrid iterative tabu search. The only difference between the two approaches is the diversification methods. Through 15 of the hardest well-known instances from QAPLIB benchmark, our algorithms produce competitive results.