By Topic

Optimizing ACS for Big TSP Problems Distributing Ant Parameters

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

3 Author(s)
Mohammadi, F.A. ; Fac. of Comput. Eng., Sharif Univ. of Technol., Tehran ; Fathi, A.H. ; Manzuri, M.T.

Ant colony algorithms are a group of heuristic optimization algorithms that have been inspired by ants foraging for food. In these algorithms there are some agents, the ants, that for finding the suitable solution, search the solution space. Ant colony algorithms have some parameters like relative pheromone importance on trail and pheromone decay coefficient that convergence and efficiency of algorithms is highly related to them. Usually desirable value of these parameters regarding the problem is determined through trial and error. Some approaches proposed to adapt parameter of these algorithms for optimizing them. The most important feature of the proposed algorithms are complication and time overhead. In this paper we have presented a simple and efficient approach based on distribution of ant parameters for optimizing ACS algorithm and by using different experiments efficiency of this proposed approach has been evaluated and we have shown that the presented concept is one of the most important reasons in success for parameter adapting algorithms

Published in:

Communications and Information Technologies, 2006. ISCIT '06. International Symposium on

Date of Conference:

Oct. 18 2006-Sept. 20 2006