搜索资源列表
fulltext123
- solving TSP using Hopfield Neural Network
hopfield_for_TSP
- 使用hopfield网络解决六城市以上的TSP问题-Use hopfield network of more than six cities to solve TSP problems
hopfield
- 利用C语言编写的hopfield网络模型解决TSP问题-use hopfield network programmed with C to solve the TSP problem
Hopfield
- Hopfield网络的TSP问题求解，能够出图的，哈哈啊-Hopfield network to solve TSP problems
hopfield-for-tsp
- hopfield神经网络求解TSP，收敛神经网络求最优路径，使用matlab-hopfield for the tsp
TSP
- Approximate solution for the Traveling Salesman’s Problem Using Continuous Hopfield Network, matlab TSP
hopfield
- 针对8个城市的TSP问题，构造Hopfield Network，用matlab设计程序，并给出了图形演示结果。-Eight cities in the TSP, constructed Hopfield Network matlab design process, and gives a graphical presentation results.
Hopfield-TSP
- Hopfield神经网络解TSP问题的算法源程序以及实例-Source code as well as examples of the Hopfield neural network algorithm for TSP
TSP
- TSP问题是一个典型的、容易描述但是难以处理的NP完全问题，同时TSP问题也是诸多领域内出现的多种复杂问题的集中概括和简化形式。目前求解TSP问题的主要方法有启发式搜索法、模拟退火算法、遗传算法、Hopfield神经网络算法、二叉树描述算法。所以，有效解决TSP问题在计算理论上和实际应用上都有很高的价值，而且TSP问题由于其典型性已经成为各种启发式的搜索、优化算法的间接比较标准(如遗传算法、神经网络优化、列表寻优(TABU)法、模拟退火法等)。遗传算法就其本质来说，主要是解决复杂问题的一种鲁棒性
TSP
- 用hopfield神经网络解决TSP问题-solving the TSP problem by Using Hopfield neural network
hopfield-Network-tsp
- hopfield Network实现的旅行商问题的优化方案，完美的验证了其算法的优越性-hopfield Network implementation traveling salesman problem optimization program, perfect validate the superiority of the algorithm
TSP
- 求解TSP问题，即在N个城市中各经历一次回到出发点，使所经过的路程最短。采用连续的Hopfield网络实现以5个城市为例的TSP问题。-TSP problem, that each of the N cities experiencing a return to the starting point, so that the shortest distance elapsed. Use continuous Hopfield networks to five cities as an examp
TSP
- TSP问题的人工智能解决方法，包括进化计算、蚁群算法和霍普菲尔德神经网络。-TSP solution to the problem of artificial intelligence, including evolutionary computation, ant colony algorithm and Hopfield neural networks.
Hopfield-TSP
- hopfield神经网络解决tsp问题，很好的程序-hopfield neural network to solve the issue tsp very good program
hopfield
- TSP问题，是一个多局部最优的最优化问题：有n个城市，一个推销员要从其中某一个城市出发，唯一走遍所有的城市，再回到他出发的城市，求最短的路线。-TSP, is more than one local optimum optimization problem: There are n cities, where a salesman one city starting only traveled all the cities, and then returned to his departure
Hopfield
- 一个hofield解决TSP的经典问题，大于60个城市，如果有错误请联系我-Hopfield solve a classical problem TSP
CHNN-solve-TSP-problem
- 连续Hopfield网络解决TSP问题的程序-Continuous Hopfield network programs to solve TSP problem
hp-TSP-
- Hopfield解决TSP问题,但是位置坐标为小数点，当时没有改出来，有兴趣的可以自己改下-Hopfield solve TSP problem, but the position coordinates of the decimal point, there was no change out of their own interest may change under
Hopfield-RNN-TSP
- 连续Hopfield神经网络的优化-旅行商问题优化计算- Optimization of continuous Hopfield neural network- traveling salesman problem optimization calculation
TSP
- 基于连续HP网络的TSP问题。根据Hopfield神经网络相关知识，得到旅行商最短路径。本例程解决的是一个城市数量为10的TSP问题，城市位置在图上用坐标表示。-TSP problem based on continuous HP network.