This article proposes a modified algorithm for solving the travelling salesman problem (TSP) by neural network.
本文提出用神经网络解旅行商问题(tsp)的改进算法。
Many questions of biology and chemistry can be reduced to versions of the travelling salesman problem, where the challenge is to find the most efficient solution among a whole host of possibilities.
很多生物或者化学题目可以被分解成不同的倾销员题目的版本，而面对这一题目的挑战就是从所有的可能性当中找到最有效的方式。
This paper offers an exact algorithm for the classic travelling salesman problem, the computational results show that it has some obvious advantages and practical applications.
本文对经典的旅行商问题给出一种精确式算法，计算结果表明，它具有一定的优越性和实用性。
The paper has used the improved algorithm and has been proved by travelling salesman problem of solving the problems of CHN31, ATT48 and EIL51.
本文运用了新改进的算法，通过旅行商问题来进行验证，分别对其中的CHN31、ATT48和EIL51进行求解。
The paper has used the improved algorithm and has been proved by travelling salesman problem of solving the problems of CHN31, ATT48 and EIL51.
本文运用了新改进的算法，通过旅行商问题来进行验证，分别对其中的CHN31、ATT48和EIL51进行求解。
应用推荐