登录
首页 » matlab » PSO-and-HS--

PSO-and-HS--

于 2020-10-28 发布 文件大小:10KB
0 215
下载积分: 1 下载次数: 204

代码说明:

  结合粒子群优化算法和和声搜索算法的优点,有效将群智能思想和随机全局搜索相融合,在几个函数优化问题中得到了验证 (Combining particle swarm optimization algorithm and harmony search algorithm advantage, effective will swarm intelligence thought and random global search phase fusion, in several function optimization problem has been proved )

文件列表:

PSO和HS混合算法测试函数
.......................\PSONHSH1.m,1768,2012-02-16
.......................\PSONHSH2.m,1794,2012-04-21
.......................\PSONHSH3.m,1893,2012-02-24
.......................\PSONHSH4.m,1917,2012-02-11
.......................\PSONHSH5.m,1876,2012-02-24
.......................\PSONHSH6.m,1677,2012-04-21
.......................\PSONHSH7.m,1893,2012-04-21
.......................\PSONHSH8.m,1846,2012-02-24
.......................\PSONHSJ1.m,2065,2012-02-22
.......................\PSONHSJ2.m,1869,2012-02-22
.......................\PSONHSJ3.m,1858,2012-02-22
.......................\PSONHSJ4.m,1833,2012-02-22

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

发表评论

0 个回复

  • gonglvjisuan
    此程序为潮流计算的最后一部分功率计算程序。(This program is the last part of the power flow calculation calculation program.)
    2009-09-15 20:42:08下载
    积分:1
  • IBVS-master
    MATLAB 下的视觉伺服算法,主要是基于图像的视觉伺服(visual servo alrigritho,mainly is the image based visual servo)
    2020-11-21 19:09:35下载
    积分:1
  • co2
    fluent中关于co2的真实气体模型的自定义程序(fluent in about co2 real gas model custom program)
    2020-12-13 21:59:15下载
    积分:1
  • mosqp
    MATLAB,多目标优化,使用SQP算法(MATLAB, multi-objective optimization using SQP Algorithm)
    2017-02-14 09:18:47下载
    积分:1
  • high-resolution-one-dimension
    高分辨率要求系统具有大的带宽,瞬时带宽的增加必将提高系统对硬件的要求,本文采用方便灵活的步进频率波形信号。脉间频率步进波形通过子脉冲载频的步进变化来获得大的有效带宽,使成像具有高分辨率,采用加窗和补零方法提高信噪比,但该信号对目标径向速度非常敏感。采用补零方法提高距离取样分辨率,使距离像细化,并用公式说明了补零只能提高距离取样分辨率,并不能改变频率步进信号的距离分辨能力。该信号波形对目标径向速度的敏感,使目标能量分散到邻近的距离单元造成距离分辨率下降,如果不事先进行速度补偿,直接对回波信号进行逆傅立叶变换,将使所成一维距离像发生频谱展宽,并伴有距离像发生平移。本文证明了当目标有径向速度时仍采用对回波信号直接进行逆傅立叶变换的方法将使一维距离像发生频谱展宽并伴有距离像发生频移,从而严重影响了一维距离像的质量。(high-resolution requirements of the system with large bandwidth, the increased instantaneous bandwidth will improve the system of hardware, In this paper, a flexible and convenient step frequency signals. Pulse frequency step-pulse waveform through the carrier frequency step to achieve great changes in the effective bandwidth. make imaging with high resolution, increasing the window and fill methods to improve signal-to-noise ratio is, However, the signal on the target radial velocity is very sensitive. Using zero-distance sampling method to improve resolution, so that distance as refinement, and formulates a zero-distance sampling can improve resolution, does not alter the frequency of the signal from stepping resolution capabilities. The signal waveform on the target radial velocity sens)
    2007-04-07 22:15:33下载
    积分:1
  • 1_2_3维均值聚类
    简单地实现了一、二、三维的K均值聚类,效果还不错,适合初步学习模式识别的同志们(Simple implementation of one, two, three - dimensional k-means clustering, the effect is not bad, it is suitable for the initial learning pattern recognition comrades)
    2020-07-02 04:00:01下载
    积分:1
  • PID-algrithm
    对于PID算法给予了通俗易懂的讲解,有利于初学者快速掌握PID的要领(I give the PID algorithm the understandable explanation,which will help beginners to quickly master the PID essentials)
    2012-12-21 15:21:32下载
    积分:1
  • surferce_wave
    本人上传的为线性拉东变换方法,它能够提取面波的频散曲线(I uploaded is of linear radon transform method, it can extract of surface wave dispersion curves)
    2012-10-24 17:15:55下载
    积分:1
  • 11087 统逆序对
    说明:  Description 设a[0…n-1]是一个包含n个数的数组,若在ia[j],则称(i, j)为a数组的一个逆序对(inversion)。 比如 有5个逆序对。请采用类似“合并排序算法”的分治思路以O(nlogn)的效率来实现逆序对的统计。 一个n个元素序列的逆序对个数由三部分构成: (1)它的左半部分逆序对的个数,(2)加上右半部分逆序对的个数,(3)再加上左半部分元素大于右半部分元素的数量。 其中前两部分(1)和(2)由递归来实现。要保证算法最后效率O(nlogn),第三部分(3)应该如何实现? 此题请勿采用O(n^2)的简单枚举算法来实现。 并思考如下问题: (1)怎样的数组含有最多的逆序对?最多的又是多少个呢? (2)插入排序的运行时间和数组中逆序对的个数有关系吗?什么关系? 输入格式 第一行:n,表示接下来要输入n个元素,n不超过10000。 第二行:n个元素序列。 输出格式 逆序对的个数。 输入样例 5 2 3 8 6 1 输出样例 5(Set a[0... N-1] is a n array containing n numbers. If there is a [i] > a [j] i n the case of I < j, then (i, j) is a n inversion pair of a array. For example, has five reverse pairs. Please use the idea of "merge sorting algorithm" to achieve the statistics of inverse pairs with O (nlogn) efficiency. The number of inverse pairs of a sequence of n elements consists of three parts: (1) The number of reverse pairs in the left half, (2) the number of reverse pairs in the right half, (3) the number of elements in the left half is greater than that in the right half. The first two parts (1) and (2) are implemented by recursion. To ensure the final efficiency of the algorithm O (nlogn), how should the third part (3) be implemented? Do not use O (n ^ 2) simple enumeration algorithm to solve this problem.)
    2019-01-07 23:52:06下载
    积分:1
  • [emuch.net][1658947]Console6
    计算材料学中用相场法模拟合金凝固相变的程序(Computational Materials Science using phase-field simulation of solidification phase change process)
    2021-01-28 16:38:34下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载