Solving quadratic assignment problems with the cunning ant system

Author

Tsutsui, Shigeyoshi ; Liu, Lichi

Author_Institution

Hannan Univ., Osaka

fYear

2007

fDate

25-28 Sept. 2007

Firstpage

173

Lastpage

179

Abstract

In a previous paper, we proposed a variant of the ACO algorithm called the cunning ant system (cAS) and evaluated it using TSP instances in the TSPLIB. The results showed that it could be one of the most promising ACO algorithms. In this paper, we applied cAS to solving the QAP and showed cAS has promising performance on the QAP as well. We introduced the entropy measure to evaluate the diversity of pheromone density and to analyze the convergence process of cAS. The results clearly showed evidence that the cunning scheme in cAS is effective in maintaining diversity of pheromone density and leads to successful search. The effectiveness of cAS was also confirmed when it was combined with the taboo local search.

Keywords

entropy; optimisation; search problems; ACO algorithm; cunning ant system; entropy measure; pheromone density; quadratic assignment problems; taboo local search; Ant colony optimization; Cities and towns; Content addressable storage; Convergence; Density measurement; Diversity reception; Entropy; Feedback; Hospitals; Production facilities;

fLanguage

English

Publisher

ieee

Conference_Titel

Evolutionary Computation, 2007. CEC 2007. IEEE Congress on

Conference_Location

Singapore

Print_ISBN

978-1-4244-1339-3

Electronic_ISBN

978-1-4244-1340-9

Type

conf

DOI

10.1109/CEC.2007.4424469

Filename

4424469