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

Authors :: Hutchison, David
Kanade, Takeo
Kittler, Josef
Kleinberg, Jon M.
Mattern, Friedemann
Mitchell, John C.
Naor, Moni
Nierstrasz, Oscar
Pandu Rangan, C.
Steffen, Bernhard
Sudan, Madhu
Terzopoulos, Demetri
Tygar, Doug
Vardi, Moshe Y.
Weikum, Gerhard
Ghosh, Ashish
De, Rajat K.
Pal, Sankar K.
Tsutsui, Shigeyoshi
Source :: Pattern Recognition & Machine Intelligence (978-3-540-77045-9); 2007, p269-278, 10p
Publication Year :: 2007
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. [ABSTRACT FROM AUTHOR]

Full Text Access

Tools