搜索资源列表
ga_and_hopfield
- 机器学习及神经网络的算法，具体解决经典的HOPFIELD模型，在TSP问题中可以加速解的收和快速求解。-arithmetic for machine learning and neural net,mostly for HOPFIELD modal of TSP problem
Hopfield网络解TSP的改进算法
- 这是一个旅行商问题的神经网络算法,神经网络算法有很多种,但神经网络算法还比较少见,这是本人从中国期刊网下载到的,很有用-This is a traveling salesman problem of neural network algorithms and neural network algorithm can take many forms, but the neural network algorithm is still relatively rare, this is my jour
hopfield_for_tsp
- Hopfield网络解决旅行商问题（TSP），迭代过程中采用保优方法，并计算最优解和次优解的个数。-Hopfield network Traveling Salesman Problem (TSP), iterative process used method for ensuring quality, and calculating the optimal solution and sub-optimal number of solutions.
HopfieldofTSP
- 这是在MATLAB上的Hopfield解决简单的TSP问题，虽然有点简单，但效果很好~-This is the MATLAB on the Hopfield simple solution of TSP, Although somewhat simple, but very effective ~
Tsp_GA_Hopfield
- 这是一个用VC++6求TSP问题的程序。程序中采用了两种方法：遗传算法和Hopfield神经网络-This is a VC 6 for TSP procedures. Procedures for the use of two methods : genetic algorithms and neural networks Hopfield
pathoptimizationwithHopfield
- 基于Hopfield人工神经网路的室内全域路径优化。主要是利用Hopfield求解TSP的方法。用于课程设计。-based on artificial neural network Hopfield indoor entire domain path optimization. Hopfield is mainly used for TSP method. For course design.
hopfieldTSP
- 利用hopfield神经网络解决TSP(旅行商)问题-use hopfield neural network to solve TSP salesman problem (TSP)
HopfieldTsp
- 连续Hopfield网络解决TSP, 绘制路径,计算路径实际长度
hopfield-Network-tsp
- hopfield Network实现的旅行商问题的优化方案，完美的验证了其算法的优越性-hopfield Network implementation traveling salesman problem optimization program, perfect validate the superiority of the algorithm
Hopfield-Neural-Network-TSP-problem
- hopfield神经网络解决TSP问题 论文 C-Tsp hopfield neural network to solve the problem of paper C++
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问题，是一个多局部最优的最优化问题：有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.
模拟退火算法解决tsp问题
- 设计一个可以对TSP问题进行组合优化的连续型Hopfield神经网络模型，利用该魔心可以快速的找到最优的一条路线。(A continuous Hopfield neural network model for combinatorial optimization of TSP problems is designed, which can be used to find the optimal route quickly.)
TSP_hopfield
- 用 HOPFIELD 求取TSP问题的最优解，早些时候的版本(TSP HOPFIELD NEURAL NETWORK)