A Genetic Algorithms and the Traveling Salesman Problem

资源描述这个应用解决了弗洛依德warshal算法。

适合解线性规划问题，配合VB的界面，非专业人士也可根据说明运用。-solutions for linear programming problem with VB interface, non-professionals can use, according to the notes.

《多元数据分析》是我正在看的一本书，把该书带的光盘内容上传到此。希望对其他人有用。- "Multi- Numbers according to Analysis" are I a book which looked, passes to this in this book belt compact disc content. Hopes to other person of useful.

一个用来计算矩阵运算的函数库，希望对大家有用-One used to calculate the matrix operations of the library and hope for all of us

二维三节点有限元计算程序 输入单元及节点信息，计算结构位移。最大单元数5000，最大节点数2000，能够处理集中力、体积力、已知位移等荷载。 采用迭代、回代算法计算线性方程组。能够生成节点的位移、应力及应变值，应力包括个应力分量及主应力值和主应力方向

数值处理算法源代码-numerical algorithm source code

采用dsp28335 产生三相的spwm信号，在微型逆变器中的应用，分析了spwm信号的产生原理与dsp28335相关的寄存器配置，

TCL 脚本对 AODV ；请下载并享受。这是写在 NS2 帮助别人得到的 NS2 的窍门。任何帮助请联系 ashwin.kannan1@gmail.com

通过此程序可以把输入的年份判别是平年,还是闰年.-through this procedure can be imported in the year discriminant is non-leap year, or a leap year.

98年全国大学生数学建模竞赛B题“水灾巡视问题”，是一个推销员问题，本题有53个点，所有可能性大约为exp(53),目前没有好方法求出精确解，既然求不出精确解，我们使用模拟退火法求出一个较优解,将所有结点编号为1到53,1到53的排列就是系统的结构,结构的变化规则是:从1到53的排列中随机选取一个子排列,将其反转或将其移至另一处,能量E自然是路径总长度。具体算法描述如下：步1： 设定初始温度T，给定一个初始的巡视路线。步2 ：步3 --8循环K次步3：步 4--7循环M次步4：随机选择路线的一段步5：随机确定将选定的路线反转或移动，即两种调整方式：反转、移动。步6：计算代价D，即调整前后的总路程的长度之差步7：按照如下规则确定是否做调整：如果D0,则按照EXP(-D/T)的概率进行调整步8:T*0.9-->T,降温-98 National Mathematical Contest in Modeling B and that the "flood inspections", is a salesman problem, and that is 53 points, all possibilities about exp (53), there is no good way to get accurate solutions, since no exact solution for, we used simulated annealing France obtained an optimum solution to all nodes to a number of 53 to 53.1 is with the system structure, changes in the structure of the rules is : from 1-53 with a randomly selected with a son, to reverse or to move it to another, the energy E is the natural path length. The specific algorithm is described as follows : Step 1 : The initial set temperature T,