登录
首页 » matlab » JSPGA

JSPGA

于 2014-12-21 发布 文件大小:3KB
0 237
下载积分: 1 下载次数: 10

代码说明:

  关于车间调度问题JSP的遗传算法.直接可以调用该函数进行运算(About shop scheduling problem JSP GA)

文件列表:

JSPGA.m,7301,2014-12-20

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • PSO-TOOLBOX
    说明:  粒子群算法,很有用的一个设计程序,如果需要优化,可以使用(Particle Swarm Optimization )
    2011-03-08 22:01:10下载
    积分:1
  • CODE1
    universal noise removal code
    2011-09-13 17:49:35下载
    积分:1
  • postprocessingFEM
    This provides good overview for post-processing by Matlab
    2019-03-25 22:58:12下载
    积分:1
  • dg-placement
    It is code for( 33 bus IEEE data) DG placement code for minimizing a function using particle swarm optimization technique.
    2020-11-13 22:49:43下载
    积分:1
  • Fisher-program
    Fisher program 图片处理程序,报告搜索Fisher (Fisher program image processing procedures, reports Search Fisher)
    2013-07-14 14:15:37下载
    积分:1
  • chaoliujisuan
    用于对简单电力系统网络的潮流计算,只需输入线路元件参数,节点电压初值,PQ,PV节点的初值,即可输出各节点电压,平衡节点的功率,线路的功率。(for easy power system)
    2011-12-29 21:11:27下载
    积分:1
  • knn1
    K最邻近密度估计技术是一种分类方法,不是聚类方法。 不是最优方法,实践中比较流行。 通俗但不一定易懂的规则是: 1.计算待分类数据和不同类中每一个数据的距离(欧氏或马氏)。 2.选出最小的前K数据个距离,这里用到选择排序法。 3.对比这前K个距离,找出K个数据中包含最多的是那个类的数据,即为待分类数据所在的类。(K nearest neighbor density estimation is a classification method, not a clustering method. It is not the best method, but it is popular in practice. Popular but not necessarily understandable rule is: 1. calculate the distance between the data to be classified and the data in each other (Euclidean or Markov). 2. select the minimum distance from the previous K data, where the choice sorting method is used. 3. compare the previous K distances to find out which K data contains the most data of that class, that is, the class to which the data to be classified is located.)
    2017-08-09 21:06:38下载
    积分:1
  • wimax
    wimax simulation by sinmulink, contain the part of mimo, ofdm and multipath
    2009-06-26 22:35:51下载
    积分:1
  • ComputationalStatisticsHandbookWithMatlab
    一本讲述时间序列分析的英文书,非常详细!(A book about time series analysis of the English book, very detailed!)
    2010-09-25 22:10:43下载
    积分:1
  • 1
    说明:  有n个整数,使其前面各数顺序向后移m个位置,最后m个数变成最前面的m个数 (Have n integers, to move back in front of the order m of the number of positions, finally becoming the foremost m m the number of number of)
    2010-11-17 09:17:40下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载