Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

Improving the performance of ACO algorithms by adaptive control of candidate set

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)
Watanabe, I. ; Commun. & Inf. Res. Lab., Central Res. Inst. of Electr. Power Ind., Tokyo, Japan ; Matsui, S.

The performance of ant colony optimization (ACO) algorithms with candidate sets is high for large optimization problems, but it is difficult to set the size of candidate sets to optimal in advance. We propose an adaptive control mechanism of candidate sets based on pheromone concentrations for improving the performance of ACO algorithms and report the results of computational experiments using the graph coloring problems.

Published in:

Evolutionary Computation, 2003. CEC '03. The 2003 Congress on  (Volume:2 )

Date of Conference:

8-12 Dec. 2003