MEDAL Report 2007006
Cunning Ant System for Quadratic Assignment Problem with Local Search and Parallelization
Shigeyoshi Tsutsui  (2007)

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

Download PDF

Go back

Missouri Estimation of Distribution Algorithms Laboratory
Department of Mathematics and Computer Science
University of Missouri-St. Louis, St. Louis, MO


            Web design by Martin Pelikan