On multi-behavior based multi-colony ant algorithm for TSP

Authors:
Sheng Liu;Xiaoming You
Affiliations:
School of Management, Shanghai University of Engineering Science, Shanghai, China;College of Electronic and Electrical Engineering, Shanghai University of Engineering Science, Shanghai, China
Venue:
IITA'09 Proceedings of the 3rd international conference on Intelligent information technology application
Year:
2009

Citing 5
Cited 0

MAX-MIN Ant system

Future Generation Computer Systems
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Pheromone Modification Strategies for Ant Algorithms Applied to Dynamic TSP

Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
Ant Systems for a Dynamic TSP

ANTS '02 Proceedings of the Third International Workshop on Ant Algorithms
Ant colony system: a cooperative learning approach to the traveling salesman problem

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

To avoid premature convergence and stagnation problems in classical ant colony system, a novel multibehavior based multi-colony ant algorithm (MBMCAA) is proposed. The ant colony is divided into several sub-colonies; the subcolonies 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.