中国旅行商问题 meaning in English
ctsp
Examples
- Traveling salesman problem is combinatorial optimization problem in graph theory , it has npc computation complexity , and lots of problem can transfer to traveling salesman problem . the computation of tsp is analyzed , then the hopfield network method for solving tsp is given , at last we solve 10 - citys traveling salesman problem and chinese traveling salesman problem by using chaos neural network modeling
首先分析了旅行商问题在穷举搜索法下的工作量；其次给出了求解旅行商问题的hopfield神经网络方法，同时分析了利用人工神经网络求解旅行商问题所存在的问题；最后利用混饨神经网络模型求解10城市旅行商问题和中国旅行商问题。