共查询到19条相似文献,搜索用时 203 毫秒
1.
2.
粒子群优化算法在自适应偏振模色散补偿中的性能研究 总被引:1,自引:0,他引:1
反馈控制算法是偏振模色散的自适应补偿器的关键组成部分,将粒子群优化算法(PSO)引入到偏振模色散自适应补偿系统中。该算法的优点是具有快速收敛到全局最佳值的能力、避免搜索陷入局部极值的能力、抗噪声能力和多自由度控制能力。理论上分析了粒子群优化算法的两个分类———全局邻居结构粒子群优化(GPSO)和局部邻居结构粒子群优化(LPSO)在搜索全局最佳值方面的能力优劣,给出了局部邻居结构粒子群优化算法成功率达100%的三种邻居拓扑结构。实验表明:在补偿一阶偏振模色散时,全局邻居结构和局部邻居结构搜索全局最佳的成功率都能满足要求,全局邻居结构算法收敛速度快。而在补偿二阶偏振模色散时,全局邻居结构成功率降低,而局部邻居结构仍可以满足要求。 相似文献
3.
4.
人工蜂群算法作为一种新兴的群体智能算法,在解决复杂连续问题时表现突出。但是由于算法本身内在运行机制的原因,算法在搜索上表现出优异的性能,却疏于开发。为了平衡搜索和开发二者之间的矛盾,提出了一种基于遗传模型改进的人工蜂群算法,并成功运用到了阵列综合领域。算法先将全局最优解引入邻域搜索过程,指导蜂群寻找最佳蜜源,加速算法收敛。为了避免人工蜂群算法陷入局部最优,需要提高其开发能力,通过借鉴遗传算法中的进化机制,建立了遗传模型,对采取最佳保留后的蜜源进行遗传操作,丰富蜜源的多样性。在一组广泛使用的数值函数上对改进人工蜂群算法进行了测试,实验数据表明,该算法相较于其他算法具有很强的竞争力。将该算法运用于线性阵列的稀疏优化,旨在降低阵列的峰值旁瓣电平,在同样的阵列约束下与其他算法进行了优化对比,仿真结果进一步证明了算法的有效性。 相似文献
5.
6.
遗传算法具有很强的自适应性、鲁棒性和全局搜索能力,但其局部搜索能力相对较弱,计算后期易出现进化缓慢、过早收敛等问题,蚁群算法是近几年迅速发展起来的一种新的全局优化算法,具有正反馈机制,但是计算初期由于信息素差别小,初始收敛速度较慢.本文将这两种优化方法结合起来,充分发挥各自的优势,形成了遗传-蚁群混合算法,并选用测试函数对算法的优化性能作了对比计算,最后以高温超导匀场磁体为实际应用目标,以绕制磁体所用超导带长度为目标函数对磁体结构进行优化设计,优化方案比原始方案节省7.32%的超导带材用量. 相似文献
7.
布里渊散射谱参数提取问题的混合优化算法研究与应用 总被引:2,自引:0,他引:2
提出了一种将Particle Swarm Optimization(PSO)算法和Levenberg-Marquardt(LM)算法按概率混合优化的新算法,将其用于Pseudo-Voigt型布里渊散射谱以提高其拟合度和频移提取精度。新算法以PSO算法为主框架,首先用PSO算法进行全局搜索,在优化一定次数后每次优化随机产生一个概率rand(0,1),若rand(0,1)小于或等于事先设定的概率P,则把PSO算法得到的最优解作为LM算法的初值进行局部深度搜索,将LM算法得到的最优解替换先前PSO算法的最优解,继续使用PSO算法进行全局搜索;若rand(0,1)大于P则仍然用PSO算法搜索,等待下一次优化产生随机概率rand(0,1)进行判断,交替使用两种算法直至获得理想的全局最优解。仿真分析和实验表明,新算法克服了单一算法的缺点,提高了布里渊散射谱的拟合度和频移提取的精度,充分证明了新算法的实用性和可行性。 相似文献
8.
针对分数阶达尔文微粒群优化(FDPSO)算法收敛速度慢,收敛精度不高的问题,改进其算法中分数阶速度更新策略,同时引入Logistic型混合分数阶自适应动态调整策略,得到一种改进的自适应分数阶达尔文粒子群优化(LFDPSO)算法,通过理论分析,证明了该算法在给定条件下的收敛性,并由数值实验表明,Logistic型混合自适应分数阶达尔文粒子群(LFDPSO)算法在收敛精度和收敛速度上得到了有效改善与提高,粒子在局部最优时的逃逸能力、全局寻优及智能搜索能力显著增强。 相似文献
9.
10.
11.
12.
为了改进引力搜索算法求解箱式约束优化问题的性能,提出了一类自适应引力搜索算法,新算法定义了算法停滞系数,当算法陷入停滞时,可以自适应的修改引力参数,帮助算法跳出停滞状态;定义了个体相似系数,当种群陷入局部最优时,通过变异策略改善种群的多样性。数值试验结果表明,新算法有效的平衡了全局开发和局部搜索能力,具有更强的全局寻优能力,适于求解复杂优化问题。 相似文献
13.
14.
基于TTDF和CNS算法的多路BOTDR散射谱信息高精度分析研究 总被引:3,自引:0,他引:3
传统的BOTDR光纤传感系统采用单路传感光纤实现对信息特征的测量,交叉敏感等不可控因素会使散射谱拟合精度较低,信息分析偏差较大。设计了一种同时对多路传感信息进行检测的BOTDR系统。针对基于布里渊光时域反射(BOTDR) 的多路传感散射谱高精度特征提取的要求,提出了一种三次数据融合(TTDF)与布谷鸟牛顿搜索(CNS)相结合的散射谱信息分析方法。该方法利用TTDF对信息数据的融合能力,根据狄克逊准则和格拉布斯准则,剔除了异常值的影响,减小了传感信号的误差;采用布谷鸟牛顿搜索算法进行频谱拟合,不仅通过布谷鸟的智能搜索能力得到全局最优解,而且以该最优解作为牛顿算法的初值进行局部寻优,保证了频谱拟合的精度,提高了布里渊散射谱信息分析的准确度。在温度信息散射谱线性权重比为1∶9的情况下,分析了不同线宽散射谱信息的提取。采用该方法进行多路数据融合的方差约为0.003 0,散射谱的中心频率约为11.213 GHz,温度误差小于0.15 K。理论分析和仿真结果表明,将此方法用于基于布里渊光时域反射的多路分布式光纤传感系统,可有效提高多路传感信号的准确度和布里渊散射谱信息分析的精确度。 相似文献
15.
This paper proposes a hybrid Rao-Nelder–Mead (Rao-NM) algorithm for image template matching is proposed. The developed algorithm incorporates the Rao-1 algorithm and NM algorithm serially. Thus, the powerful global search capability of the Rao-1 algorithm and local search capability of NM algorithm is fully exploited. It can quickly and accurately search for the high-quality optimal solution on the basis of ensuring global convergence. The computing time is highly reduced, while the matching accuracy is significantly improved. Four commonly applied optimization problems and three image datasets are employed to assess the performance of the proposed method. Meanwhile, three commonly used algorithms, including generic Rao-1 algorithm, particle swarm optimization (PSO), genetic algorithm (GA), are considered as benchmarking algorithms. The experiment results demonstrate that the proposed method is effective and efficient in solving image matching problems. 相似文献
16.
In this paper, a multi-strategy adaptive comprehensive learning particle swarm optimization algorithm is proposed by introducing the comprehensive learning, multi-population parallel, and parameter adaptation. In the proposed algorithm, a multi-population parallel strategy is designed to improve population diversity and accelerate convergence. The population particle exchange and mutation are realized to ensure information sharing among the particles. Then, the global optimal value is added to velocity update to design a new velocity update strategy for improving the local search ability. The comprehensive learning strategy is employed to construct learning samples, so as to effectively promote the information exchange and avoid falling into local extrema. By linearly changing the learning factors, a new factor adjustment strategy is developed to enhance the global search ability, and a new adaptive inertia weight-adjustment strategy based on an S-shaped decreasing function is developed to balance the search ability. Finally, some benchmark functions and the parameter optimization of photovoltaics are selected. The proposed algorithm obtains the best performance on 6 out of 10 functions. The results show that the proposed algorithm has greatly improved diversity, solution accuracy, and search ability compared with some variants of particle swarm optimization and other algorithms. It provides a more effective parameter combination for the complex engineering problem of photovoltaics, so as to improve the energy conversion efficiency. 相似文献
17.
在能量色散X荧光分析技术分析中,对谱信息的处理一直是研究的重点,谱光滑、寻峰、峰面积处理都是重中之重,本工作基于模拟退火算法原理,建立一种新的寻峰模型算法,该算法利用模拟退火寻找全局最优点的收敛特性,以Metropolis准则作为峰谷判断的基础,引入新的判定标准和峰谷数组,同时从谱道址两端同时收敛,以收敛到同一最优解为终止条件。同时,利用该算法与简单比较法、三阶导数法进行对比实验,结果证明该算法在X荧光光谱寻峰中有较强能力,在实际生产中具有一定价值。 相似文献
18.
结合模拟退火算法和遗传算法的优点,在遗传算法中加入模拟退火算子,运用这种混合算法对子孔径结构进行了优化。以阵列的子调制传递函数覆盖点间距最大化及最小冗余度来设计目标函数,实现了单圆周孔径阵列和双圆周孔径阵列的优化排列。使用仿真程序对优化阵列的光学传递函数进行了分析,将优化结果与相同子孔径数目的单圆周结构进行仿真实验和比较。结果表明,采用这种混合算法是可以很好的解决光学合成孔径结构的优化问题,优化结果接近全局最优解,优化后的双圆周阵列接近Golay阵列,具有更大的实际空间截止频率。 相似文献
19.
Fundus segmentation is an important step in the diagnosis of ophthalmic diseases, especially glaucoma. A modified particle swarm optimization algorithm for optic disc segmentation is proposed, considering the fact that the current public fundus datasets do not have enough images and are unevenly distributed. The particle swarm optimization algorithm has been proved to be a good tool to deal with various extreme value problems, which requires little data and does not require pre-training. In this paper, the segmentation problem is converted to a set of extreme value problems. The scheme performs data preprocessing based on the features of the fundus map, reduces noise on the picture, and simplifies the search space for particles. The search space is divided into multiple sub-search spaces according to the number of subgroups, and the particles inside the subgroups search for the optimal solution in their respective sub-search spaces. The gradient values are used to calculate the fitness of particles and contours. The entire group is divided into some subgroups. Every particle flies in their exploration for the best solution. During the iteration, particles are not only influenced by local and global optimal solutions but also additionally attracted by particles between adjacent subgroups. By collaboration and information sharing, the particles are capable of obtaining accurate disc segmentation. This method has been tested with the Drishti-GS and RIM-ONE V3 dataset. Compared to several state-of-the-art methods, the proposed method substantially improves the optic disc segmentation results on the tested datasets, which demonstrates the superiority of the proposed work. 相似文献