Solving The Travelling Salesmen Problem using HNN and HNN-SA algorithms

TL;DR

This paper explores solving the Traveling Salesman Problem using Hopfield Network-based algorithms, specifically HNN and HNN-SA, comparing their effectiveness in addressing this complex computational challenge.

Contribution

It introduces novel application of Hopfield Network algorithms, HNN and HNN-SA, for solving the Traveling Salesman Problem, providing insights into their performance.

Findings

HNN and HNN-SA algorithms effectively solve the TSP.

Comparison shows HNN-SA outperforms traditional methods.

Hopfield Networks offer a promising approach for combinatorial optimization.

Abstract

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.