Cart (Loading....) | Create Account
Close category search window

Solving quadratic assignment problems with the cunning ant system

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Tsutsui, S. ; Hannan Univ., Osaka ; Lichi Liu

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.

Published in:

Evolutionary Computation, 2007. CEC 2007. IEEE Congress on

Date of Conference:

25-28 Sept. 2007

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.