论文标题
使用HNN和HNN-SA算法解决旅行推销员问题
Solving The Travelling Salesmen Problem using HNN and HNN-SA algorithms
论文作者
论文摘要
在此案例研究中，已经研究了著名的旅行推销员问题。旅行推销员问题是计算机科学中最苛刻的计算问题。使用Hopfield Network通过两种不同的方式解决了旅行推销员问题。该问题的主要理论是在节点之间具有边缘的图中找到节点之间的距离和连接性。用于此问题的基本算法是Djikstra的算法。但是到目前为止，许多此类算法已经发展。其中（其他一些算法）是不同的，并且已被证明可以通过Graph Theone来解决旅行推销员问题。
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.
