用java语言写的遗传算法库，包含了实例。

此程序为训练RBF网权值的量子粒子群优化算法，供各位参考-this program for training RBF net weights Quantum Particle Swarm Optimization Algorithm for reference

针对TSP问题，提出了一种改进的遗传算法。在遗传算法中引入进化算法的思想，在此基础上提出顶端培育策略和分阶段策略，以求在保证群体多样性的同时加快收敛速度。-against TSP, an improved genetic algorithms. Genetic Algorithm evolutionary algorithm introduced the idea that the basis of this proposed strategy and cultivating top phased strategy groups in order to ensure diversity at the same time speed up the convergence.

这是个java版的人工模拟股市。-This is a java version of the artificial simulation of the stock market.

神经网络算法

基于遗传算法的排课系统，可以实现多种课程的排列-based on genetic algorithm Course Scheduling System, can achieve a wide variety of courses with the

一个蚁群算法，大家很想要得东东，共享给大家了。-an ant colony algorithm, we want to fine Eastern, we had to share.

遗传算法的原代码，用于最优化计算，只需解压便可使用。-Genetic algorithm source code for the optimization calculation, just unzip to use.

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

蚁群算法源程序 ，比较实用，有简要说明-蚁群算法源程序 ，比较实用，有简要说明

Fisher线性判别分类器应用于IRIS数据集的例子-An example of Fisher linear discriminant Classifier applied on IRIS Data Set