用局部最优探索算法求解tsp问题。。。matlab编写。附有城市坐标用于检验。...

针对TSP问题，用类神经网路的方法去求解！-against TSP, and the neural network approach to solving!

clementine8.1中文手册经典的数据挖掘软件说明-clementine8.1 Chinese classic manual data mining software Note

解非线性规划模型的遗传算法，用c++语言编写，注释完整，结构清晰-Genetic Algorithm for nonlinear programming

收集的关于遗传算法的模糊搜索的ppt资料，有兴趣的可以研究一下-Collected on the genetic algorithm ppt fuzzy search information, interested can look at

传算法伪代码实例，遗传算法中最重要的过程就是选择和交叉。 -Examples of pseudo-code algorithm, genetic algorithm is the most important process of selection and crossover.

该工具包提供七种神经网络的C语言实现方式，对那些真正学习神经网络的人有一定的帮助和指导意义。-The kit provides seven neural networks realize the C language by means of neural networks to learn who the real people who have a certain degree of help and guidance.

EBP反向传播算法对应的源程序，三层网络，分隐层神经元，输出层神经元，输入层神经元的一个基本的程序实现-EBP back-propagation algorithm the corresponding source code, the three-tier networks, sub-hidden layer neurons, output layer neurons, input layer neurons realize a basic procedure

这是神经网络中一个重要的算法，挺有意义的。-This is a neural network algorithm important, quite meaningless.

基于遗传算法的模拟退火-based on genetic algorithm simulated annealing

我们解决八数码问题,广度优先搜索可能会导致内存不够用,采用启发式搜索,启发函数为f(x)=g(x)+h(x) g(x)为该结点不同于目标结点的个数,h(x)为该结点的深度,选择那f(x)结点最小的那个结点进行扩展, 引入了一个"扩展数组[4]"(因为扩展的结点最多只有4个),该数组保存着某个结点的0点向各个方向的扩展的结点对象,然后对该扩展数组进行分析,利用启发函数在进行递归扩展... -us solve eight digital, BFS may lead to insufficient memory, using heuristic search, heuristic function f (x) = g (x) h (x) g (x) for the target node is different from the number of nodes, h (x) for the nodes of depth, the choice between f (x) nodes that the smallest node expansion. the introduction of an "expanded array [4]" (because the expansion of the nodes at most four), The array maintains a node of 0:00 a.m. to expand in all directions in the target node, and then expanded array analysis, use heuristic function during recursive expansion ...