论文部分内容阅读
本文给出一种解TSP问题的新方法,在保证路径有效的前提下,所求出的准最优解优于或至少近似于用以前各种方法所求出的解.特别是避免了用Hopfield模型时常常存在的许多不足.文中同时给出这一算法的神经网络实现与仿真结果.
In this paper, a new method to solve TSP problem is given, and the quasi-optimal solution obtained by this method is superior to or at least similar to that obtained by the previous methods, especially when the path is guaranteed. Especially, Hopfield model often exist many deficiencies.The article also gives the neural network of this algorithm and simulation results.