Consultant-Guided Search Algorithms for the Quadratic Assignment Problem

Consultant-Guided Search (CGS) is a recent swarm intelligence metaheuristic for combinatorial optimization problems, inspired by the way real people make decisions based on advice received from consultants. Until now, CGS has been successfully applied to the Traveling Salesman Problem. Because a good metaheuristic should be able to tackle efficiently a large variety of problems, it is important to see how CGS behaves when applied to other classes of problems. In this paper, we propose four CGS algorithms for the Quadratic Assignment Problem (QAP) and we compare their performance. Our experimental results show that CGS is able to compete with Ant Colony Optimization in terms of solution quality.