TSP

使用simulink建立一个脉冲信号发生器(Using a pulse generator simulink)

整数规划matlab代码，代码简洁、效率高(Integer programming matlab code, the code is simple, high efficiency)

这是天津大学胡清华老师在粗糙集邻域领域做的最经典的源码，同学们可以在此基础上学习和修改，入口程序已经写好，需要其他方法可以自己添加，MAIN.m是入口程序，参数的意思在子函数里讲的很明白，调用了featureselect_FW_fast.m用来属性约简，几个clsf_dpd文件是使用不同的距离公式来计算属性重要度，选择得到属性结果，使用crossvalidate.m十折交叉算法来计算计算算法精度，该段代码调用了几个分类器，C4_5.m是决策树，KNN.m是最近邻分类器，NEC.m是类似于KNN的胡修改的程序，osu_svm3.00文件夹是使用svm分类器调用的文件，使用该分类器时，代码中间的路径需要修改。另外附上一堆常用的数据集。(This is Hu Qinghua teacher at Tianjin University neighborhood rough set field do the most classic source code, students can learn and modify On this basis, the entry procedures have been written, you need other ways to add your own, MAIN.m entry program is meaning parameters Functions talked in very clear call for the featureselect_FW_fast.m attribute reduction, several clsf_dpd file is to use a different formula to calculate the distance attribute importance, choose properties to get the results, use crossvalidate.m ten fold cross algorithm to calculate the accuracy of the calculation algorithm, the segment code calls several classifiers, C4_5.m is a decision tree, KNN.m is the nearest neighbor classifier, NEC.m is similar to KNN Hu modified program, osu_svm3. 00 folders using svm classifier called file, using the classification code in the middle of the path need to be modified. Also attach a bunch of common data sets.)

背包问题的主函数很有用啊 本程序主要用到遗传算法(背包)

There are 200 random lines. This program is used to calculate how many intersection points they have.

FCM_S算法的matlab代码 包括其改进FCM_S1 和 FCM_S2(FCM_S1 and FCM_S2 with matlab code)

matlab关于电机仿真的实例，对做电机控制的人很有帮助。(MATLAB simulation essence 50 cases of motor)

计算大气折射修正，利用分段模型，采用matlab软件编程计算(matlab caculate the refraction of atmoshpere)

用MATLAB调用EPA的几个例子，实现EPA中的管网模拟(Calling EPA with MATLAB)

说明：  SGA（Simple Genetic Algorithm）是一种强大的智能多变量优化算法，它模仿种群繁殖规律来进行 优化。 本SGA可以优化变量，求最小值,最大值（当把函数倒数也就求最小值啦） 并且支持浮点编码，grey编码，二进制编码；轮赌法选择，锦标赛选择；单点交叉，均布交叉，浮点交叉； 单点变异，浮点变异；(SGA (Simple Genetic Algorithm) is a powerful smart multi-variable optimization algorithm, which mimics the reproduction of law to be optimized. The SGA can be optimized variables, minimum, maximum, (when the function will last for the minimum is) and support for floating-point encoding, grey code, binary code round of betting method selection, tournament selection single-point crossover, uniform Cross, floating-point crossover single point mutation, floating-point mutation )