登录
首页 » matlab » shuffle

shuffle

于 2013-01-24 发布 文件大小:214KB
0 184
下载积分: 1 下载次数: 107

代码说明:

  利用拉格朗日松弛法求解机组组合问题,考虑领域搜索的随机性(Using Lagrangian relaxation method to solve the unit combination problem, considering the randomness of the search field)

文件列表:

crossover.m,288,2007-02-01
ex1201.m,238,2007-03-15
ex1202.m,395,2007-03-15
ex1203.m,299,2007-03-15
ex1204.m,305,2007-03-16
ex1205.m,314,2007-03-16
ex1206.m,428,2007-03-15
ex1207.m,394,2007-03-15
ex1208.m,527,2007-03-15
ex1209.m,893,2007-03-16
ex1211.m,170,2007-03-15
ex1212.m,185,2007-03-16
ex1213.m,168,2007-03-16
ex1214.m,351,2007-03-16
ex1215.m,108,2007-03-16
ex1216.m,52,2007-03-16
ex1217.m,181,2007-03-16
ex1218.m,177,2007-03-16
ex1219.m,107,2007-03-16
ex1220.m,135,2007-03-16
f1209.m,320,2007-03-16
f1211.m,77,2007-03-16
f1215.m,104,2007-03-16
f1216.m,54,2007-03-16
f1219.m,81,2007-03-16
f1220.m,526,2007-03-16
fcon1212.m,155,2007-03-16
fcon1219.m,112,2007-03-16
genetic.m,1703,2007-02-01
gen_decode.m,319,2007-02-01
gen_encode.m,359,2007-02-01
MATLAB最优化计算20例.pdf,228169,2009-02-19
mutation.m,301,2007-02-01
Mu_Inv.m,96,2007-02-01
Nelder0.m,1457,2007-02-01
Opt_Golden.m,766,2007-01-24
Opt_Nelder.m,624,2007-01-31
Opt_Quadratic.m,1372,2007-02-01
Opt_Simu.m,1048,2007-02-01
Opt_Steepest.m,1641,2007-02-01
shuffle.m,186,2007-02-01

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

发表评论

0 个回复

  • sudoku
    The following is an example of how Microsoft Solver Foundation can be used to solve a constraint satisfaction problem (CSP) like generating a typical Sudoku problem. Sudoku http://www.codeproject.com/Articles/419389/Sudoku-using-Microsoft-solver-foundation In this article I do not attempt to explain everything there is to know about constraint satisfaction problems, but I will go over the concepts in the hope that even if you have never heard of CSP you will still get the idea.
    2012-07-30 16:59:24下载
    积分:1
  • tianwen
    说明:  VC实现,天文导航算法及实现 包括数据的获取、加工、处理、保存为文件(VC, astronomy, navigation algorithm and implementation including data acquisition, processing, handling, preservation of documents)
    2020-09-29 16:17:44下载
    积分:1
  • GUSS
    多点高斯平稳随机过程模拟,运用了快速傅里叶变换进行模拟。(Multi-Gaussian stationary random process simulation, using a fast Fourier transform simulation.)
    2020-11-02 12:39:53下载
    积分:1
  • FAST_v8.10.00a-bjj.tar
    这是一个风力机的气动软件,可以算是一个新新之秀,国内现在也有很多个人和公司在使用,的确是替代blade的一个优秀的开源fortran软件(A software used to perform simulation with wind turbine)
    2021-01-17 10:08:44下载
    积分:1
  • 14-NR
    14节点牛拉算法计算潮流程序,用于电力系统的潮流计算程序,可以直接用于潮流计算,也可以用于学习潮流计算的流程和方法。(For power flow calculation program, can be used directly flow calculation can also be used to study flow calculation processes and methods.)
    2020-07-04 20:40:02下载
    积分:1
  • LSHNR5
    三相潮流计算,使用的是牛顿拉弗逊方法。迭代较快。是解决潮流的较有效的方法。(Three-phase power flow calculation, using Newton' s method Laffer Johnson. Iterate rapidly. The trend is to solve the more effective method.)
    2013-10-29 23:32:56下载
    积分:1
  • pan-in77
    详细画出了时域和频域的相关图,实现了图像的灰度化并进一步用于视频监视控,小波包分析提取振动信号中的特征频率。( Correlation diagram shown in detail the time domain and frequency domain, Achieve a grayscale image and further control for video surveillance, Wavelet packet analysis to extract vibration signal characteristic frequency.)
    2017-03-21 19:32:56下载
    积分:1
  • preCG
    预处理CG算法,在进行共轭梯度法之前先对系数矩阵进行预处理,再进行迭代(pretreatment congruent gradient)
    2020-08-07 23:08:38下载
    积分:1
  • bike-wheel-calc-master
    自信车轮压力分析 python 源代码 有限元分析(Wheel of bike ,python Finite Element code)
    2015-12-08 08:13:15下载
    积分:1
  • gainiange
    概念格的构造问题是形式概念分析应用的前提。由于概念格的时空复杂度随着形式背景的增大而可能指数性的增大,有关概念格的生成问题一直是形式概念分析应用研究的一个重点。国内外的学者和研究人员对此进行了深入的研究,提出了一些有效的算法来生成概念格,这些算法一般可分为两类:批生成算法(Batch Algorithm)和渐进式生成算法(Incremental Algorithm )。。 (Concept lattice structure problem is the premise formal concept analysis applications. Since the concept of space-time lattice with the increasing complexity of the form and context may increase exponentially, generating questions about the concept lattice has been a focus of formal concept analysis applied research. Domestic and foreign scholars and researchers conducted a thorough study made a number of efficient algorithms to generate the concept lattice, these algorithms can be divided into two categories: batch generation algorithm (Batch Algorithm) and progressive generation algorithm (Incremental Algorithm ). .)
    2014-03-07 11:32:12下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载