TSP算法，应用局部搜索法得到最优路径，已经经过优化。没有密码，可以使用，vc环境下使用。

遗传算法的实现,c++/vc++/遗传算法的学习安例!-genetic algorithm to achieve, c/vc/GA-cases of learning!

自己用swarm开发的一个车辆跟驰的模型，希望能跟广大爱好者共同探讨。-own use development of a swarm of vehicles- following model, the majority of fans are able to explore together.

手写汉字识别 应用SVM和神经网络进行识别,可自行训练-Handwritten Chinese Character Recognition Application of SVM and neural networks to identify their own training

这是一个数据挖掘中的关联规则挖掘的经典算法：Apriori算法的程序-This is the code of Apriori-the classical algorithm used in Association Rules of Data Mining

数据挖掘各类代码:Apriori源代码全部-Various types of data mining code: Apriori all source code

本程序是数据挖掘中的关联规则模型中著名的Aprior算法的VC实现程序，可用于知识发现、数据挖掘、人工智能、模式识别等领域（请先解压文件）-The code is the VC implementation of the well-known Aprior algorithm in Association Rule Model of Data Mining field, can be used in Knowledge Discovery, Data Mining, AI, Pattern Recognition and so on.(Please unzip the file first)

另一个遗传算法程序-Another genetic algorithm program

我们解决八数码问题,广度优先搜索可能会导致内存不够用,采用启发式搜索,启发函数为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 ...

eview 编写的时间序列预报程序 可以用于金融预报，等-eview the preparation of time-series forecasting procedures can be used for financial forecasting, etc.

matlab中求解最大最小问题的蚂蚁算法源代码。很有参考价值。-Matlab solution of the biggest problems the smallest ant algorithm source code. Great reference value.