Cunning Ant System for Quadratic Assignment Problem with Local Search and Parallelization

Abstract. The previously proposed cunning ant system (cAS), a variant of the ACO algorithm, worked well on the TSP and the results showed that the cAS could be one of the most promising ACO algorithms. In this paper, we apply cAS to solving QAP. We focus our main attention on the effects of applying local search and parallelization of the cAS. Results show promising performance of cAS on QAP.

• Type: Conference
• Year: 2007
• Where: PREMI
• Authors: Shigeyoshi Tsutsui
• Keywords: ACO Algorithms, Cunning Ant, PREMI 2007, Promising Aco Algorithms