采用随机变异步长的改进自组织迁移算法

自组织迁移算法是一种新型的进化算法。对自组织迁移算法的原理、实现及策略参数设置进行了详细分析,在此基础上提出了一种改进算法。通过在个体迁移过程中引入随机变异步长,寻优个体的行为变得多样化,加速了群体在多峰复杂空间中的寻优进程。仿真结果显示,该算法优于原自组织迁移算法和粒子群优化算法。     

一种采用线性递减步长的自组织迁移算法

自组织迁移算法（SOMA）是一种新型的群体智能算法。在对原始自组织迁移算法分析的基础上,针对基于随机变异步长的自组织迁移算法存在的不足,提出了线性递减步长策略,即有针对性地以线性方式动态调整步长,以满足群体迭代在不同阶段的需求,从而加速群体在多峰复杂空间中收敛速度的同时提高算法的局部搜索能力。实验结果表明,该算法优于原始自组织迁移算法和基于随机变异步长的自组织迁移算法。     

基于混合迁移行为的自组织迁移算法

自组织迁移算法(Self-organizing migrating algorithm,SOMA)是一种新型的进化算法.在对基本的自组织迁移算法分析的基础上提出了基于混合迁移行为的自组织迁移算法(Hybrid migrating behavior based self-organizing migrating algorithm,HBSOMA).该算法通过在个体迁移过程中引入了多种迁移方式,形成混合迁移行为,使得个体的行为变得多样化,增加了种群多样性,加速了群体在多峰复杂空间中的寻优进程.仿真结果显示,该算法优于原自组织迁移算法.     

信息筛选多任务优化自组织迁移算法

针对现有自组织迁移算法（SOMA）只能求解单个优化问题及其“隐并行性”未能被充分挖掘的缺陷,提出信息筛选多任务优化自组织迁移算法（SOMAMIF）实现同一时刻处理多个优化问题。首先,构造多任务统一搜索空间,并根据任务个数设置相应的子种群;然后,对各子种群当前最优适应值进行判断,当任务连续若干代停滞进化时则产生信息交互需求;接着,按概率从剩余子种群中筛选对自己有用的信息并过滤无用信息,从而在保证信息正向迁移同时实现种群结构的重新调整;最后对算法的时间复杂度和空间复杂度进行分析。实验结果表明,SOMAMIF在同时求解多个高维函数优化问题时均快速收敛至全局最优解0,而SOMAMIF与分形技术相结合同时提取不同户籍高校学生返乡关键制约因素时,其在两个数据集上得到的平均分类准确率与原始数据集的平均分类准确率相比分别提高了0.348 66个百分点和0.598 57个百分点。     

基于云免疫算法的认知无线网络参数优化

为了提高认知无线网络的参数优化效果,提出了一种基于免疫优化的认知引擎参数调整算法。免疫克隆优化是一种有效的智能优化算法,适合求解认知无线网络的引擎参数调整问题。免疫优化中,变异概率影响着算法的搜索能力;利用正态云模型云滴的随机性和稳定倾向性特点,提出了一种基于云模型的自适应变异概率调整方法,并用于认知无线网络的参数优化。在多载波环境下对算法进行了仿真实验。结果表明,所提算法收敛速度较快,参数调整结果与对目标函数的偏好一致,能够实现认知引擎参数优化。     

基于云免疫算法的认知无线网络参数优化

为了提高认知无线网络的参数优化效果,提出了一种基于免疫优化的认知引擎参数调整算法。免疫克隆优化是一种有效的智能优化算法,适合求解认知无线网络的引擎参数调整问题。免疫优化中,变异概率影响着算法的搜索能力;利用正态云模型云滴的随机性和稳定倾向性特点,提出了一种基于云模型的自适应变异概率调整方法,并用于认知无线网络的参数优化。在多载波环境下对算法进行了仿真实验。结果表明,所提算法收敛速度较快,参数调整结果与对目标函数的偏好一致,能够实现认知引擎参数优化。     

求解非线性方程组的社会认知算法

将非线性方程组的求解问题转化为函数优化问题,应用一种新的智能优化算法——社会认知算法求解此优化问题,实验结果表明了社会认知算法在求解非线性方程组时的可行性和有效性。     

基于粒子群算法的认知无线电参数优化及敏感度分析

认知无线电能根据环境变化和用户需求自适应调整工作参数。现有认知引擎大多采用遗传算法优化参数。但随着认知用户数的增加,遗传算法染色体增多,导致算法收敛时间过长,无法满足实时通信需求。将改进惯性因子的粒子群算法用于认知无线电工作参数的优化,并在不同通信模式下对传输参数进行敏感度分析,以便有选择性地从目标函数中剔除敏感度较低的参数,降低处理复杂度。仿真结果表明,采用粒子群算法的参数优化在收敛速度、搜索效率和算法稳定性等方面均优于遗传算法,仅需较小的进化代数就能找到最优参数解,从而减小了优化时间,满足了认知无线电实时处理的要求。     

基于二进制蚁群模拟退火算法的认知引擎

在认知无线电系统中,认知引擎依据通信环境的变化和用户需求动态配置无线电工作参数。针对认知引擎中的智能优化问题,提出一种二进制蚁群模拟退火（BAC&SA）算法用于认知无线电参数优化。该算法在二进制蚁群优化（BACO）算法中引入模拟退火（SA）算法,融合了BACO的快速寻优能力和SA的概率突跳特性,能有效避免BACO容易陷入局部最优解的缺陷。仿真实验结果表明,与遗传算法（GA）和BACO算法相比,基于BAC&SA算法的认知引擎在全局搜索能力和平均适应度等方面具有明显的优势。     

非线性约束优化的算法分析

针对非线性约束优化问题,运用了一种新的智能优化算法——社会认知优化算法。社会认知优化算法是一种基于社会认知理论的集群智能优化算法,它对目标函数的解析性质没有要求,适合于大规模约束问题处理的优点,使搜索不容易陷入局部最优。将该算法引入非线性约束问题,解决优化问题。通过实例和其他算法进行比较,对比数值实验结果表明,即使只有一个学习主体,该算法能够高效、稳定地得到解决方案,便于求解非线性约束优化问题。     

Self-organizing migration algorithm applied to machining allocation of clutch assembly

Tolerancing is an important issue in product and manufacturing process designs. The allocation of design tolerances between the components of a mechanical assembly and manufacturing tolerances in the intermediate machining steps of component fabrication can significantly affect the quality, robustness and life-cycle of a product. Stimulated by the growing demand for improving the reliability and performance of manufacturing process designs, the tolerance design optimization has been receiving significant attention from researchers in the field. In recent years, a broad class of meta-heuristics algorithms has been developed for tolerance optimization. Recently, a new class of stochastic optimization algorithm called self-organizing migrating algorithm (SOMA) was proposed in literature. SOMA works on a population of potential solutions called specimen and it is based on the self-organizing behavior of groups of individuals in a “social environment”. This paper introduces a modified SOMA approach based on Gaussian operator (GSOMA) to solve the machining tolerance allocation of an overrunning clutch assembly. The objective is to obtain optimum tolerances of the individual components for the minimum cost of manufacturing. Simulation results obtained by the SOMA and GSOMA approaches are compared with results presented in recent literature using geometric programming, genetic algorithm, and particle swarm optimization.     

Modified Nelder-Mead self organizing migrating algorithm for function optimization and its application

In this paper, a modified Nelder Mead Self Organizing Migrating Algorithm (mNM-SOMA) has been presented for solving unconstrained optimization problems. It is based on the hybridization of self organizing migrating algorithm (SOMA) with modified Nelder Mead (mNM) Crossover Operator. SOMA is a low population based technique that has good exploration and exploitation qualities, but sometimes converges premature to local optima solution due to lack of diversity preserve mechanism. In this paper an attempt has been made to improve the efficiency of SOMA using a modified NM crossover operator (mNM) for maintaining the diversity in the search space. mNM-SOMA has been tested on a set of 15 test problems, taken form literature and results are compared with the results obtained by self organizing migrating genetic algorithm (SOMGA), SOMA, genetic algorithm (GA) and particle swarm optimization (PSO). For better presentation, results are also analyzed graphically using a Performance Index. Besides this, mNM-SOMA has also been used to solve Frequency Modulation Sounds Parameter Identification Problem. Analysis of numerical results infers mNM-SOMA as a less expensive robust technique.     

一种改进的快速全局运动估计算法

结合两步法与传统梯度下降算法,提出一种改进的快速全局运动估计算法。采用稀疏抽样的MSEA快速块匹配算法估计局部运动矢量,使用迭代最小二乘法粗估计全局运动参数并排除外点(前景宏块),在排除外点的采样宏块集上选取特征像素,以上述两步法的全局运动估计参数为初始值,利用LM梯度下降算法对全局运动参数进行优化。实验结果表明,改进算法的估计速度达到11.42 ms/f,比FFRGMET算法快1.3倍,具有更高的全局运动估计精度。     

EXIT analysis of M-algorithm based MIMO detectors and LDPC code design optimization

This paper investigates joint design and optimization of both low density parity check (LDPC) codes and M-algorithm based detectors including iterative tree search (ITS) and soft-output M-algorithm (SOMA) in multiple-input multiple-output (MIMO) systems via the tool of extrinsic information transfer (EXIT) charts. First, we present EXIT analysis for ITS and SOMA. We indicate that the extrinsic information transfer curves of ITS obtained by Monte Carlo simulations based on output log-likelihood rations are not true EXIT curves, and the explanation for such a phenomenon is given, while for SOMA, the true EXIT curves can be computed, enabling the code design. Then, we propose a new design rule and method for LDPC code degree profile optimization in MIMO systems. The algorithm can make the EXIT curves of the inner decoder and outer decoder match each other properly, and can easily attain the desired code with the target rate. Also, it can transform the optimization problem into a linear one, which is computationally simple. The significance of the proposed optimization approach is validated by the simulation results that the optimized codes perform much better than standard non-optimized ones when used together with SOMA detector.     

Comparison of an self-organizing migration algorithm with simulated annealing and differential evolution for automated waveform tuning

In this article, the performance of a self-organizing migration algorithm (SOMA), a new stochastic optimization algorithm, has been compared with simulated annealing (SA) and differential evolution (DE) for an engineering application. This application is the automated deduction of 14 Fourier terms in a radio-frequency (RF) waveform to tune a Langmuir probe. Langmuir probes are diagnostic tools used to determine the ion density and the electron energy distribution in plasma processes. RF plasmas are inherently non-linear, and many harmonics of the driving fundamental can be generated in the plasma. RF components across the ion sheath formed around the probe distort the measurements made. To improve the quality of the measurements, these RF components can be removed by an active-compensation method. In this research, this was achieved by applying an RF signal to the probe tip that matches both the phase and amplitude of the RF signal generated from the plasma. Here, seven harmonics are used to generate the waveform applied to the probe tip. Therefore, 14 mutually interacting parameters (seven phases and seven amplitudes) had to be tuned on-line. In previous work SA and DE were applied successfully to this problem, and hence were chosen to be compared with the performance of SOMA. In this application domain, SOMA was found to outperform SA and DE.     

灾变粒子群优化算法及其在交通控制中的应用

城市交通系统是一个随机性很强的、复杂的巨型系统。为了获得良好的通行效率,必须对城市区域交通协调控制信号进行整体优化,但是到目前为止还没有一个能较好完成此项任务的、实用的实时智能优化方法。在粒子群优化算法中引入灾变策略和模型,开发了灾变粒子群优化算法,解决了基本粒子群算法易陷入局部极小点的缺陷,并将其应用于城市区域交通协调控制信号配时优化。仿真结果表明:与基本粒子群算法(在陷入局部极小点时)、固定周期法和遗传算法等配时方法相比,采用所开发的灾变粒子群优化算法对区域交通协调控制信号进行智能优化配时,被控区域的车辆平均延误可以分别平均减少25.2%、41%和11.5%,并可以大大提高路口的通行效率。开发的灾变粒子群优化算法也可以应用于其他许多对象的优化。     

基于粒子群的近邻传播算法

针对近邻传播（AP）算法中偏向参数与收敛系数对AP算法的聚类效果的局限性的问题,提出了一种基于粒子群的近邻传播算法（Pso—AP算法）．通过将AP算法中的偏向参数与收敛系数作为粒子,然后使用粒子群算法来对其进行智能地调整,进而提高AP算法的聚类效果．实验结果表明,该算法能有效地解决偏向参数与收敛系数对AP算法的聚类效果局限性,提高了聚类效果与收敛精度．     

求解非线性互补问题的熵函数认知优化算法

提出了一个求解非线性互补问题的熵函数社会认知优化算法。首先将非线性互补问题转化为非线性方程组来求解,然后利用熵函数法将非线性方程组求解转化为一个光滑的无约束优化问题,最后应用社会认知优化算法求解此优化问题。实验结果表明,该算法收敛速度快,稳定性好,是求解非线性互补问题的一种有效算法。