2006 | OriginalPaper | Buchkapitel
Iterated Ants: An Experimental Study for the Quadratic Assignment Problem
verfasst von : Wolfram Wiesemann, Thomas Stützle
Erschienen in: Ant Colony Optimization and Swarm Intelligence
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Ant colony optimization (ACO) algorithms construct solutions each time starting from scratch, that is, from an
empty
solution. Differently from ACO algorithms, iterated greedy, another constructive stochastic local search method, starts the solution construction from
partial solutions
. In this paper, we examine the performance of a variation of
$\mathcal{MAX}$
-
$\mathcal{MIN}$
Ant System, one of the most successful ACO algorithms, that exploits this idea central to iterated greedy algorithms. We consider the quadratic assignment problem as a case-study, since this problem was also tackled in a closely related research to ours, the one on the usage of
external memory
in ACO. The usage of external memory resulted in ACO variants, where partial solutions are used to seed the solution construction. Contrary to previously reported results on external memory usage, our computational results are more pessimistic in the sense that starting the solution construction from partial solutions does not necessarily lead to improved performance when compared to state-of-the-art ACO algorithms.