通过人工神经网络实现异或问题的解决，用visual c++开发

用GAlib库实现的解决0/1背包问题的遗传算法程序源代码。- Solution 0/1 knapsack question heredity algorithm procedure source code realizes which with the GAlib storehouse.

对于具有一定规模的TSP问题的求解，至今没有较完善的求解办法。本程序是用遗传算法来求解TSP问题。-for a certain size of the TSP solution and there has been no better way to solve. This procedure is used genetic algorithms to TSP.

根据粒子群算法的特点，用vc写出了源程序，可以实现粒子群的优化-According to the characteristics of particle swarm optimization, using vc wrote source code, you can achieve the particle swarm optimization

网络为３层结构，输入层为６个神经元，隐含层为４个神经元，输出层为１个神经元，当输入层为中心对称样本 1，0，0，0，0，1等时，网络输出为1，否则输出为0。-network of three-layer structure, input layer to six neurons to the hidden layer 4 neurons, the output layer to a neuron, when the input layer to the center symmetry samples such as 1,0,0,0,0,1, the output of a network, the output is 0.

高人用C＋＋写的ALOPEX(即模式提取算法)实现程序，程序相当精炼，值得大家研究！-expert C++ to write the ALOPEX (model extraction algorithm) procedures, procedures considerable refining, we should study!

可用于bp,elman,rbf,grnn四种神经网络的预测命令-Can be used for bp, elman, rbf, grnn four types of neural network prediction order

Pascal Programs Printed in GENETIC ALGORITHMS IN SEARCH, OPTIMIZATION, AND MACHINE LEARNING by David E. Goldberg -Pascal Programs Printed in GENETIC ALGORITHMS IN SEARCH, OPTIMIZATION, AND MACHINE LEARNING by David E. Goldberg

　基于VB的遗传算法软件实现 在程序中,FitnessValue (i) 为适应度值数组、avFit2nessValue (100) 为归一化适应度值数组、Population2 Chrom(i ,j) 为遗传个体的等位基因值、Popsize 为种群中的个体数,CHROMLENGTH为一母体对的等位基因 总数。-VB-based genetic algorithm software implementation in the proceedings, FitnessValue (i) In order to meet an array value, avFit2nessValue (100) for the normalized fitness value of the array, Population2 Chrom (i, j) for the genetic value of individual alleles, Popsize for stocks in the number of individuals, CHROMLENGTH for one parent to the total number of alleles.

用贪心法解决TSP问题.输入数据可求得所要的最值的结果.-greedy algorithm used to solve TSP. Input data can be obtained by the most value to the results.

多段图的分析算法,找到最优路径,用VC编的-more of the map analysis algorithms to find the optimal path, the series with VC