遗传算法的源程序，里面有基本的遗传算法的各种操作过程，很全面！...

基本bp神经网络算法和改进型bp神经网络算法都是我改写完成的算法，是网上到处传播的一个c++ bp神经网络算法改写的，由于网上的那个算法编译会出现若干百个错误，在其基础上重新编写和改进，写出了这两个算法-bp basic neural network algorithms and improved neural network algorithm bp I are complete rewrite the algorithm, the Internet is spreading everywhere, a c bp neural network algorithm rewrite the Internet that the algorithm will build several hundred mistakes, on the basis of its rewrite and improve, and wrote a This algorithm 2

使用蚁群算法解决旅行商问题，mfc应用程序，城市数目及坐标在eil51.tsp里-use ant algorithm to solve the traveling salesman problem, and mfc applications, The number of cities and coordinates the eil51.tsp Lane

多目标优化进化算法目前公认效果收敛性最好的算法NSGA2源码，内有多目标算法的工具箱，对实现其他多目标优化算法很有帮助-Multi-objective optimization evolutionary algorithm is currently recognized as the effect of convergence of the algorithm NSGA2 best source, with a number of target algorithm toolbox for achieving the other multi-objective optimization algorithm for helpful

这是用实验函数--Ackley函数来检验遗传算法的优越性，其中有点小毛病，就是种群数在20个左右效果最好，一旦增加种群，结果就不大对劲了。忙了好多天，也没调出来，还请各位大侠指点喽-This is the experimental function-- Ackley function to test the advantages of genetic algorithm, with a little fault, is the number of stocks in the 20 best around, once increased stocks, the result is not very comfortable having the. Busier afterwards, it was not stressed out, please Shanhaiguan kind Lackeys

平台vs2005 模拟固体退火算法实现144个城市的旅行商问题，可设置具体参数-VS2005 simulation platform to achieve solid annealing algorithm 144 city traveling salesman problem, you can set specific parameters

本算法使用了遗传算法的方法实现了随机数的生成方法。能够比较平均得实现随机数的生成。-The algorithm uses a genetic algorithm to achieve the method of random number generator. Compared to the average achieved in the generation of random numbers.

进化策略进行函数寻优Evolutionary function optimization strategy-Evolutionary function optimization strategy

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

可视化的手写（鼠标）字母数字神经网络训练程序。-visulized neural network trainning programme。

本程序是使用APRIORI算法搜索相关联的项目，在搜索前需要用户先对项目的个数和最低支持度进行设置，然后程序就会在指定的项目是找出满足最低支持度的相关联的频繁项目集-This procedure is to use search algorithms APRIORI associated projects, the needs of users in the search before the first number of the project and set the minimum degree of support, and then the procedure will be in the designated project is to identify a minimum degree of support to meet the frequently associated itemsets