Travelling Salesperson Problem
The TSP is a very important problem in the context of Ant Colony Optimization because it is the problem to which the original AS was first applied, and it has later often been used as a benchmark to test a new idea and algorithmic variants. We describe an artificial ant colony capable of solving the traveling salesman problem (TSP). Ants of the artificial colony are able to generate successively shorter feasible tours by using information accumulated in the form of a pheromone trail deposited on the edges of the TSP graph. Ant Colony Algorithm Ant are the agents that 1. Choose next town to go according to the probability that is a function of distance of town and amount of pheromone on edge. 2. Legal tours are “forced” by use of a tabular list; an ant can only visit a town once. Each ant has its own “tour memory”. 3. When the tour is complete, a pheromone is laid down on the trail. 4. Itera...