遗传算法的经典程序，初学者一定要

本程序实现的功能为建立一分类器,用于进行有监督的分类学习.-the program for the establishment of a functional classification, which is used for supervised classification study.

神经网络和遗传算法在水科学领域的应用-neural networks and genetic algorithms in the field of water science applications

一个简单的遗传算法源代码。。。。。代码保证尽可能少，实际上也不必查错-A simple genetic algorithm source code. . . . . Code to ensure that as little as possible, in fact, do not have error checking

BP算法的运算矩阵，很有用。-BP algorithm computing matrix, very useful.

仿真1：首先把网络温度参数T固定在100，按工作规则共进行1000次状态更新,把这1000次状态转移中网络中的各个状态出现的次数Si（i＝1，2，…，16）记录下来 按下式计算各个状态出现的实际频率： Pi=Si/∑i=1,NSi=Si/M 同时按照Bo1tzmann分布计算网络各个状态出现概率的理论值： Q（Ei）=（1/Z）exp（-Ei/T） 仿真2：实施降温方案，重新计算 采用快速降温方案：T（t）= T0/（1+t） T从1000降到0.01，按工作规则更新网络状态 当T=0.01时结束降温，再让T保持在0.01进行1000次状态转移，比较两种概率-a simulation : First of all network parameters temperature T fixed at 100 and, according to the rules for a total of 1000 to update the state, this state of the 1000 network transfer of all states for the number of Si (i = 1, 2, ..., 16) all recorded determined by the formula state-of the actual frequency : Pi = Si/i = 1, NSi = Si/M in accordance with Bo1tzmann distributed computing network of states all probability the theoretical value : Q (Ei) = (1/Z) exp (- Ei/T) Simulation 2 : implementation of cooling, re-using rapid cooling programs : T (t) = T0/(1 t) T dropped to 0.01 from 1000 and, according to the rules updated network state when T = 0.01 at the end of cooling, let T at 0.01 for the 1000 state tran

神经网络预测bp算法程序，可以对一组数据进行有效的预测-bp neural network prediction algorithm process to a group of data for effective forecast

中国科学院李德毅院士在北京航空航天大学关于不确定性人工智能的讲座PPT。-Uncertainty Artificial Intelligence Seminar PPT

结合均匀设计表和小边经验公式产生初始种群，使TSP应用遗传算法能求出更优更快解，详尽说明见paper.doc。-uniform design combining a small side table and have empirical formula initial population, TSP application of genetic algorithms can be obtained faster and better solutions, detailed description of paper.doc.

已知北京、上海、广州、昆明和西安五城市航线里程如图。分别实现： 1）找到北京到昆明的最短路径。 2）找到北京到昆明，必须途径上海的路径。 3）找到北京到昆明，必须途径上海，但不能去广州的路径。 -known Beijing, Shanghai, Guangzhou, Kunming and Xi"an City route five mileage figure. Were achieved : 1) to Kunming to Beijing to find the shortest path. 2) find Beijing to Kunming, Shanghai must channel"s path. 3) to find Beijing to Kunming, Shanghai must channels, but can not go to Guangzhou"s path.