By Topic

On Multi-Behavior Based Multi-Colony Ant Algorithm for TSP

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)
Sheng Liu ; Sch. of Manage., Shanghai Univ. of Eng. Sci., Shanghai, China ; Xiaoming You

To avoid premature convergence and stagnation problems in classical ant colony system, a novel multi-behavior based multi-colony ant algorithm (MBMCAA) is proposed. The ant colony is divided into several sub-colonies; the sub-colonies have their own population evolved independently and in parallel according to four different behavior options, and update their local pheromone and global pheromone level respectively according to immigrant operator. This parallel and cooperating optimization scheme by using different behavioral characteristics and inter-colonies migration strategies can help the algorithm skip from local optimum effectively. The experimental results for TSP show the validity of this algorithm.

Published in:

Intelligent Information Technology Application, 2009. IITA 2009. Third International Symposium on  (Volume:3 )

Date of Conference:

21-22 Nov. 2009