摘要
本文给出一种解TSP问题的新方法,在保证路径有效的前提下,所求出的准最优解优于或至少近似于用以前各种方法所求出的解.特别是避免了用Hopfield模型时常常存在的许多不足.文中同时给出这一算法的神经网络实现与仿真结果.
This paper presents a new approach to the Traveling Salesman Problem (TSP). On the premise of assuing the route effectiveness, the quasi-optimum solu- tions of TSP by this approach are better than or at least similar to those solutions by any other available method. Particularly, the short-coming of invalid routes by using the Hopfield model is avioded in this approach. The neural network realization and computer simulation results of several cases are given.
出处
《北方交通大学学报》
CSCD
北大核心
1992年第3期15-22,共8页
Journal of Northern Jiaotong University
