Approximate solution for the Traveling Salesman's Problem Using Continuous Hopfield Network
Ritesh Gandhi · 2001
I have proposed an implementation of an algorithm in neural network for an approximate solution for Traveling Salesman’s Problem. TSP is a classical example of optimization and constrain satisfaction problem which falls under the family of NP-complete of problems. I have used Continuous Hopefield network to find the solution for the given problem. The algorithm gives near optimal result in most of the cases for upto 20 cities.