基于文化粒子群算法的广义OPM测向

在引入合成导向矢量和合成导向矩阵的基础上建立了一种更通用的阵列数据模型,提出了广义正交传播算子测向算法。该方法在不损失阵列孔径的前提下可有效估计相干信源和独立信源。为快速求解所提基于四阶累积量的广义OPM算法,在文化算法中使用和粒子群演进进化机制,提出了一种多维搜索的文化粒子群算法。Monte-Carlo仿真试验证明了所设计的测向算法可有效解决使用高阶累积量不能直接测相干信源的局限,所提算法在检测性能上与现有一些算法比较有较大的优势。     

基于自适应惯性权重粒子群优化的多跳频信号盲源分离

针对跳频通信中多跳频信号的盲源分离问题,提出了一种基于自适应惯性权重粒子群的盲源分离算法。该算法将分离信号的负熵作为目标函数,依据迭代前后每个粒子适应度值间差值自适应地调节惯性权重。把适应度值变差的粒子惯性权重设成零,以消除惯性分量不利影响,这样可以减少无效迭代次数,提高收敛速度。应用于盲源分离时,比经典算法分离效果好且克服了激活函数选取难题。实验结果表明该算法用于多跳频信号盲分离时性能稳定且收敛速度快,与经典算法比较优势明显,为智能算法在盲源分离方面的研究提供了一定的参考。     

基于互信息下粒子群优化的属性约简算法

最小属性约简是粗糙集理论中属性约简的优化问题.在寻找最小属性约简的问题上,基于粒子群优化的属性约简算法（ARPSO算法）优于传统的属性约简算法.在现有的ARPSO算法中,正域部分通常被作为启发式信息,但是它并不能够很好地衡量不确定性,而互信息是粗糙集理论中一种更有效的度量不确定信息的重要工具.为此,提出基于互信息下的粒子群优化的属性约简算法（MIPSO算法）,该算法把互信息作为适应度函数,通过增强粒子能迅速靠近吸引子的这一特性,改进了内嵌区域震荡搜索的粒子群优化算法（简记为RSPSO算法）,防止算法较早的陷入局部最优,使得粒子群中的粒子更快的找到最优值,因此使得算法尽可能实现全局收敛.实验结果表明,该算法不仅提高了寻优的能力,加快了算法的速度,提升了算法的精度,而且也能够使得约简后剩余属性的互信息值与约简前所有属性的互信息值近似相等.     

基于PPSO-GRADS算法的盲信号分离

该文将联姻策略应用在粒子群算法中,提出一种并行分阶段的基于粒子群优化算法的盲信号分离方法(PPSO-GRADS)。该算法具有收敛速度快,分离精度高的特点。通过仿真证明该算法比未使用联姻策略的粒子群算法有更好的性能,在收敛速度和分离效果上比传统的梯度算法,遗传算法都有较明显的改善。     

一种改进的灰狼优化算法

灰狼优化算法是最近提出的一种较有竞争力的优化技术.然而,它的位置更新方程存在开发能力强而探索能力弱的缺点.受差分进化和粒子群优化算法的启发,构建一个修改的个体位置更新方程以增强算法的探索能力;受粒子群优化算法的启发,提出一种控制参数a随机动态调整策略.此外,为了提高算法的全局收敛速度,用混沌初始化方法产生初始种群.采用18个高维测试函数进行仿真实验,结果表明：对于绝大多数情形,在相同最大适应度函数评价次数下,本文算法的性能明显优于标准灰狼优化算法.     

采用改进梯度互信息和粒子群优化算法的红外与可见光图像配准算法

针对传统互信息图像配准容易产生局部极值,以及传统梯度互信息配准方法计算量大等问题,在互信息和梯度方法基础上构建了一种改进的梯度互信息方法,该方法直接统计梯度图像的互信息,有效地将图像梯度信息和灰度信息结合起来,不仅保证了配准精度,而且较传统梯度互信息方法减少了计算量。在参量优化的过程中,针对传统粒子群优化算法易陷入局部极值的缺点,提出了改进的粒子群优化算法,该算法在传统粒子群优化算法基础上引入混沌优化思想和遗传算法中的杂交思想,不仅能够有效抑制局部极值,而且加快了收敛速度。多种红外与可见光图像配准实验结果证明,文中提出的算法能够有效提高配准精度和速度。     

Investigation on the evolutionary algorithms with their applications in MIMO detecting systems

In this paper, with the purpose of integrating the advantages of both the genetic algorithm and the particle swarm optimization, a new genetic particle swarm optimization (GPSO) algorithm is proposed. Furthermore, these three evolutionary algorithms are successfully applied to address the MIMO detection problem. Simulation results reveal that the GPSO‐based detection algorithm takes much less population size and iteration number when compared with the particle swarm optimization‐based detection method and the genetic algorithm‐based detection method. Besides, when compared with the optimal maximum likelihood detection method, the GPSO‐based detection algorithm can strike a much better balance between the BER performance and the computational complexity. Copyright © 2012 John Wiley & Sons, Ltd.     

数字调制识别SVM分类器参数优化及仿真

对于基于SVM数字信号调制识别分类器,参数选取过程中如何优化惩罚因子和径向基核函数参数问题,提出了一种改进算法。该算法将自适应惯性权重粒子群算法和k折交叉验证法结合,利用交叉验证法计算粒子适应度值,通过粒子群算法实现最优参数值搜索,最终得到分类器惩罚因子和径向基核函数参数最优值。仿真结果表明,该算法性能明显优于网格搜索法和遗传算法。     

基于QPSO算法的信道分配方法

由于传统的信道分配方法存在频率利用率低下和处理速度慢的缺点,为此,提出基于量子计算的PSO算法（QPSO）来快速实现信道最优化分配方法。这种优化方法利用了量子计算的并行计算能力强、全局收敛、运算速度极快等特点,主要包括初始化代表每个信道的粒子的速度和位置,根据信道分配的教学模型计算保证信道各种约束条件的适应度函数,根据量子粒子群的规律进行粒子位置更新,直至找到最佳信道分配方案等步骤。仿真结果表明其方法是行之有效的,优化效果优于基于遗传算法和PSO算法的信道分配方法。     

参数自适应混沌粒子群算法在盲源分离中的应用

独立分量分析(ICA)是盲源信号分离中应用最为广泛技术,其应用过程需要对目标函数进行优化,传统粒子算法(PSO)对其进行优化时,存在易陷入局部最优、稳定性差等缺陷,针对此问题,提出采用参数自适应混沌粒子群算法对ICA进行优化.首先采用对PSO的参数进行自适应调整,提高粒子的搜索能力,然后对粒子群进行混沌扰动,提高算法收敛速度.仿真结果表明,使用参数自适应混沌粒子群算法可以有效解决ICA的目标函数优化问题,极大提高了盲源信号的分离效果.     

New method of traffic flow forecasting based on quantum particle swarm optimization strategy for intelligent transportation system

Traffic flow forecasting is one of the essential means to realize smart cities and smart transportation. The accurate and effective prediction will provide an important basis for decision‐making in smart transportation systems. This paper proposes a new method of traffic flow forecasting based on quantum particle swarm optimization (QPSO) strategy for intelligent transportation system (ITS). We establish a corresponding model based on the characteristics of the traffic flow data. The genetic simulated annealing algorithm is applied to the quantum particle swarm algorithm to obtain the optimized initial cluster center, and is applied to the parameter optimization of the radial basis neural network prediction model. The function approximation of radial basis neural network is used to obtain the required data. In addition, in order to compare the performance of the algorithms, a comparison study with other related algorithms such as QPSO radial basis function (QPSO‐RBF) is also performed. Simulation results show that compared with other algorithms, the proposed algorithm can reduce prediction errors and get better and more stable prediction results.     

粒子群算法用于盲信号分离的研究

提出一种采用粒子群优化算法进行盲信号分离的新方法,为盲信号分离领域提供一种新的研究思路与方法。该方法采用峰度作为适应度函数,利用粒子群算法对由多个源信号混合而成的信号进行盲信号分离。与自然梯度法盲信号分离相比,粒子群算法精度更高,收敛速度更快,实例仿真成功地对两个图像混合信号进行了盲分离,表明了算法的有效性和优越性。     

Synthesis of linear antenna arrays using Jaya,self-adaptive Jaya and chaotic Jaya algorithms

This work aims to show the effectiveness of a recently proposed population-based optimization algorithm known as Jaya algorithm and its variants named as self-adaptive Jaya algorithm (SJaya) and Chaotic-Jaya (CJaya) algorithm to synthesize linear antenna arrays which are widely used in the communication systems. Three case studies of synthesis of linear antenna arrays are formulated by considering different topologies. In addition, two case studies of synthesis of dipole antenna arrays are formulated and all the case studies are solved using Jaya, SJaya and CJaya algorithms. The results of Jaya, SJaya and CJaya algorithms are compared with those of cat swarm optimization (CSO) algorithm, particle swarm optimization (PSO), Cauchy mutated cat swarm optimization (CMCSO) algorithm, harmony search based differential evolution algorithm (HSDEA), dynamic differential evolution algorithm (DDE), improved genetic algorithm (IGA), modified real genetic algorithm (MGA) and accelerated particle swarm optimization (APSO) algorithm. The Jaya, SJaya and CJaya algorithms achieved a better side lobe level suppression as compared to the other optimization algorithms while maintaining the vital antenna parameters within permissible limits.     

A Class of Sequential Blind Source Separation Method in Order Using Swarm Optimization Algorithm

We consider the problem of sequential, blind source separation in some specific order from a mixture of sub- and sup-Gaussian sources. Three methods of separation are developed, specifically, kurtosis maximization using (a) particle swarm optimization, (b) differential evolution, and (c) artificial bee colony algorithm, all of which produce the separation in decreasing order of the absolute kurtosis based on the maximization of the kurtosis cost function. The validity of the methods was confirmed through simulation. Moreover, compared with other conventional methods, the proposed method separated the various sources with greater accuracy. Finally, we performed a real-world experiment to separate electroencephalogram (EEG) signals from a super-determined mixture with Gaussian noise. Whereas the conventional methods separate simultaneously EEG signals of interest along with noise, the result of this example shows the proposed methods recover from the outset solely those EEG signals of interest. This feature will be of benefit in many practical applications.     

求解多输入多输出检测新算法——遗传粒子群优化

设计两种基于粒子群优化算法(PSO)和基于遗传算法(GA)的多输入多输出(MIMO)系统检测算法.提出一种新的融合GA和PSO进化机制的遗传粒子群进化(GPSO)算法,并将其应用于MIMO系统检测问题求解.新算法改善了初始化种群,并将每一代粒子划为精英粒子、次优粒子和糟糕粒子三部分,对这三种粒子分别采用极值扰动、PSO...     

MIMO系统中改进的二进制粒子群天线选择算法

在多输入多输出系统中,发射端和接收端的多天线配置提高了信道容量和传输可靠性,而天线选择技术能在保持系统优点的同时有效地降低运算复杂度以及硬件成本。为了能在时变的信道条件下快速地选择出一组最优的天线子集,提出了一种基于二进制粒子群算法的改进的天线选择算法。推导出了二进制粒子群联合收发端天线选择的信道容量公式,并将其作为粒子群算法的适应度函数,使天线选择问题转换成二进制编码串的组合优化问题。通过改进模糊函数提高粒子群算法的收敛性,让二进制粒子群尽可能地收敛于全局最优位置。仿真结果表明,改进的算法能在降低运算复杂度的同时提高收敛性,且系统信道容量趋近于最优算法。     

Pareto Optimal Microwave Filter Design Using Multiobjective Differential Evolution

Microwave filters play an important role in modern wireless communications. A novel method for the design of multilayer dielectric and open loop ring resonator (OLRR) filters under constraints is presented. The proposed design method is based on generalized differential evolution (GDE3), which is a multiobjective extension of differential evolution (DE). GDE3 algorithm can be applied for global optimization to any engineering problem with an arbitrary number of objective and constraint functions. GDE3 is compared against other evolutionary multiobjective algorithms like nondominated sorting genetic algorithm-II (NSGA-II), multiobjective particle swarm optimization (MOPSO) and multiobjective particle swarm optimization with fitness sharing (MOPSO-fs) for a number of microwave filter design cases. In the multilayer dielectric filter design case a predefined database of low loss dielectric materials is used. The results indicate the advantages of this approach and the applicability of this design method.      

多策略差分进化的元胞多目标粒子群算法

为了增加Pareto解集的多样性,平衡多目标优化的全局搜索和局部寻优的能力,提出一种多策略差分进化的元胞多目标粒子群算法.该算法在分析粒子群优化原理基础上,将元胞自动机理论融入粒子群算法,研究粒子种群的交流结构和信息传递机制.为了避免粒子飞行速度过快陷入局部收敛,提出一种限制粒子飞行速度的策略,并引入一种多策略差分进化选择算子增加对粒子的扰动.实验证明,该算法相对于比较算法,有更好的收敛性和多样性.     

联合非高斯性和非线性自相关的有噪盲源分离算法

现有的盲源分离算法往往利用信号某一方面的统计特性来分离信号,例如:利用信号的非高斯特性,或者利用信号的时序特性。在实际应用中,信号往往是具有这两种特性信号的混合,采用信号某一方面的特性往往不能够成功的分离出信号。现有的盲源分离算法往往不考虑噪声的影响,但在实际应用中,噪声的影响是不可避免的。当源信号具有非高斯性和非线性自相关特性时,提出了联合非高斯性和非线性自相关特性的有噪盲源分离算法。计算机仿真表明了提出算法的有效性,和现有的基于非高斯性和非线性自相关特性的有噪盲源分离算法相比,提出算法具有更好的信号分离性能。      

基于粒子群优化的宽带同心圆环阵型优化方法

同心圆环传声器阵列广泛应用于声成像阵列系统,能有效地抑制干扰并确定声源位置。在限定阵元数量、阵列最大孔径和最小阵元间距等条件下,提出了一种利用粒子群算法设计宽带低旁瓣同心圆环传声器阵列的方法。该方法通过构造一个反映宽带信号在扫描区域内旁瓣水平的适应度函数,以圆环半径和阵元偏转角作为联合优化参数,基于粒子群优化算法实现了阵型的快速优化求解。仿真实验表明,该方法获得的优化阵型在扫描范围内的整体旁瓣水平低于以最高旁瓣级为适应度函数得到的最优阵型,也低于仅优化圆环半径获得的最优阵型,这说明了该优化方法的可行性和有效性。