TSP Solution Using Dimensional Ant Colony Optimization

Abstract

This paper describes Dimensional Ant Colony Optimization (DACO), a distributed algorithm that will be applied to solve traveling salesman problem (TSP). In an Any Colony System (ACS), a set of co-operating agents called ants co-operate to find the good solutions of TSPs. Ants co-operate using an indirect form of communication that is mediated by pheromone they deposited on the edges of the TSP graph when building solutions. The proposed system (Dimensional ACO) based on basic ACO algorithm with well defined distribution strategy in which entire search space area is initially being divided into N numbers of hyper-cubic quadrants where N is the dimension of entire search space area for updation of heuristic parameter of ACO and to improve the performance while solving TSP. From our experiments, this proposed algorithm has better performance than other standard bench mark algorithms.