Consultant-guided search algorithms for the quadratic assignment problem

Abstract. 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 an algorithm for the Quadratic Assignment Problem (QAP), which hybridizes CGS with a local search procedure. Our experimental results show that CGS is able to compete in terms of solution quality with one of the best Ant Colony Optimization algorithms, the MAX-MIN Ant System.

• Type: Conference
• Year: 2010
• Where: GECCO
• Authors: Serban Iordache
• Keywords: Combinatorial Optimization Problems, GECCO 2010, Optimization, Quadratic Assignment Problem, Traveling Salesman Problem