Solution for a Travelling Salesman Problem in Neural Networks

Travelling Salesman Problem is a very hard Optimization Problem in a field of Operations research. It often used as for new optimization Techniques. This paper surveys the neutrally inspired Travelling Salesman Problem using Ant Colony Optimization Algorithm. It presents Adaptive Resonance theory in combination with Ant Colony Optimization Algorithm to solve the large instance of Travelling Salesman Problem. Travelling salesman problem (TSP) consists of finding the shortest route in complete weighted graph G with n nodes and n(n-1) edges, so that the start node and the end node are identical and all other nodes in this tour are visited exactly once.