Solving The Travelling Salesmen Problem using HNN and HNN-SA algorithms
This work addresses a classic computational problem in computer science, but it appears incremental as it combines existing methods without clear novelty.
The study tackled the Travelling Salesman Problem by applying Hopfield Network and a hybrid Hopfield Network-Simulated Annealing algorithm, achieving unspecified results without concrete numerical improvements.
In this case study, the renowned Travelling Salesmen problem has been studied. Travelling Salesman problem is a most demanding computational problem in Computer Science. The Travelling Salesmen problem has been solved by two different ways using Hopfield Network. The main theory of the problem is to find distance and connectedness between nodes in a graph having edges between the nodes. The basic algorithm used for this problem is Djikstra's Algorithm. But till now , a number of such algorithms have evolved. Among them(some other algorithms) , are distinct and have been proved to solve the travelling salesmen problem by graph theory.