Multiagent Search Strategy for Combinatorial Optimization Problems in Ant Model

Ant colony system (ACS) is a meta heuristic approach based on biology in order to solve combinatorial optimization problem. It is based on the tracing action of real ants that accumulate pheromone on the passed path and uses as communication medium. In order to search the optimal path, it is necessary to make a search for various edges. In existing ACS, the local updating rule assigns the fixed pheromone value to visited edge in all process. In this paper, modified local updating rule gives the pheromone value according to the number of visiting and the edge´s distance between visited nodes. Our approach can have less local optima than existing ACS and can find better solution by taking advantage of more information during searching