基于粒子群优化算法的阈值图像分割研究

研究将群体智能中的粒子群优化算法应用到图像分割中,提出了一种新的图像分割算法.新方法基于最佳熵阈值分割技术,用粒子群优化算法自适应选取分割阈值.仿真实验针对Lena图像分割问题,将遗传算法与粒子群优化算法分别独立运行,对得到的阈值以及均值、方差进行了比较,并将运行时间作为算法复杂度的评价指标.统计结果显示,论文算法不仅能够对图像进行准确的分割,而且运行时间明显较短.仿真结果表明,基于粒子群优化的图像分割算法是可行的、有效的.     

改进的混沌粒子群算法在TSP中的应用

针对基本粒子群(PSO)算法不能较好地解决旅行商优化问题(TSP),分析了基本粒子群算法的优化机理,在新定义粒子群进化方程中进化算子的基础上利用混沌运动的随机性、遍历性等特点,提出一种结合混沌优化和粒子群算法的改进混沌粒子群算法.该算法对惯性权重进行自适应调整,引入混沌载波调整搜索策略避免陷入局部最优,形成一种同时满足全局和局部寻优搜索的混合离散粒子群算法,使其适合解决TSP此类组合优化问题.利用MATLAB对其进行了仿真.仿真结果说明此算法的搜索精度、收敛速度及优化效率均较优,证明了此算法在TSP中应用的有效性,且为求解TSP提供了一种参考方法.     

基于MMTD算法的粒子群的解Ⅱ

粒子群算法是一种寻找最优解的算法,该算法在寻找的过程中需要粒子所得的目前解具有判断力和记忆力.然而正是由于该算法中的粒子对当前的解具有判断力,才能够使得粒子群中的粒子能够较快地找到最优解.粒子群中的粒子在求解过程中所得的结果可分为三种:优,中,差,这三种解的属性符合中介思想.然而MMTD的算法正是中介思想的一种应用,因此论文将MMTD算法在粒子群上进行应用,该算法能够对粒子群解的属性上做出判断.     

基于混沌粒子群优化的支持向量机训练方法

为使粒子群优化算法初始粒子均匀分布在解空间,通过对混沌运动的遍历性和粒子群优化算法中惯性权重的分析,提出一种混沌粒子群算法。该算法对Circle模型进行改进,将其引入粒子群算法中,避免了粒子群算法陷入局部最优。给出应用混沌粒子群算法训练SVM的方法,并将其应用于人脸识别。仿真实验结果表明,改进的CPSO SVM方法比CPSO SVM和PSO SVM方法有更好的识别性能。     

基于内分泌调节机制的粒子群算法

借鉴内分泌系统的高级调节机制,提出一种基于内分泌调节机理的粒子群算法.首先设计一种结合当前粒子群的最好适应度、平均适应度和局部适应度的情感评价方法,对下一代粒子群进行情感评价,然后用神经系统和内分泌系统共同作用,对粒子群的行为进行更新,在更新过程中。引入动量项减少局部收敛的发生.文中同时分析了算法的收敛性,并对几个典型函数优化问题和机器人路径规划进行实验,验证方法的有效性.     

基于博弈模型的合作式粒子群优化算法

粒子群算法作为一种新兴的进化优化方法,能够大大减轻复杂的大规模优化问题的计算负担. 根据博弈论的思想,在传统粒子群基础上提出了一种基于博弈模型的合作式粒子群优化算法,算法基于重复博弈模型,在重复博弈中利用一个博弈序列,使得每次博弈都能够产生最大效益,并得到了相应博弈过程的纳什均衡. 通过典型基准测试函数对算法的性能进行对比实验,实验结果表明算法是可行的、有效的,对拓展粒子群算法研究具有重要的理论意义与实际意义.     

基于自适应粒子群的SVM参数优化研究

针对粒子群算法在优化SVM参数时,存在着易陷入局部最优,早熟收敛的问题,首先提出了一种用自适应权重来代替惯性权重的粒子群算法,再引入自适应变异对粒子群算法进行优化,增强粒子的种群多样性,使其能够跳出局部最优解,从而达到全局最优.最后,将改进后的算法(GPSO-SVM)应用到UCI标准数据集上进行验证,实验结果表明,改进后的算法提高了粒子的搜索性能,是一种有效的SVM参数优化算法.     

基于MMTD算法的粒子群的解

粒子群算法是一种寻找最优解的算法,该算法在寻找的过程中需要粒子所得的目前解具有判断力和记忆力.然而正是由于该算法中的粒子对当前的解具有判断力,这才能够使得粒子群中的粒子能够较快地找到最优解.粒子群中的粒子在求解过程中所得的结果可分为三种：优,中,差,这三种解的属性符合中介思想.然而MMTD的算法正是中介思想的一种应用,因此本文将MMTD算法在粒子群上进行应用,该算法能够对粒子群解的属性上做出判断.     

基于PSO算法的电力一线员工绩效评价方法

本文针对电力一线员工绩效考核普遍存在的考核人员评测难、“过于量化”的问题, 提出了一套基于工单的绩效评价模型. 通过对同类工作项基于多维评价属性简单定性进行纵向计数量化, 对不同工作项基于班组长的主观评估权重进行横向聚类, 充分挖掘考核人员主观评估中隐含的价值信息. 同时, 本文提出基于平均度数的动态随机拓扑PSO算法对模型进行求解, 对算法中粒子编码方式、约束条件处理、策略具体实现等展开了深入的探究. 最后, 本文选取5个同类型班组采用该模型进行绩效测算, 验证了本文模型和算法的有效性, 为电力一线员工绩效考核提供了一个新的方法.     

混沌粒子群优化神经网络的井下人员无线定位方法研究

针对井下人员定位系统定位精度较低,不能满足智慧煤矿的需求,提出一种基于混沌粒子群算法优化Elman神经网络的井下人员无线定位方法。该定位方法首先在井下巷道无线网络环境中,利用无线终端采集一定数量的样本点指纹数据库。其次初始化Elman神经网络,利用混沌粒子群优化算法对神经网络权值和自连接反馈增益因子寻优。再次用指纹数据库对优化过的Elman神经网络进行训练和测试,建立神经网络定位算法模型。最后通过无线终端采集定位点的指纹数据,由神经网络定位算法模型进行实时定位。经试验表明,该井下人员无线定位方法平均定位误差为1.35 m;而混沌粒子群算法优化Elman神经网络定位算法,其算法全局搜索能力更强,更适合井下时变环境中应用。     

基于改进PSO-SVM的电能质量综合评估

针对现有电能质量评估方法存在的不足,提出了一种新的粒子群优化算法和支持向量机理论相结合的智能电能质量综合评估方法.根据电能质量国家标准,确定了电能质量评估指标,并针对目前电能质量等级过于模糊的缺点,提出了区间化电能质量的细化措施.利用惯性权重自适应调节方法对粒子群算法进行了改进,在此基础上建立了基于粒子群优化支持向量机的电能质量综合评估模型.仿真实例的评估结果表明,所建立的综合评估模型是合理有效的,评估结论与其他评估方法相比更为合理可信.     

微粒群神经网络在绩效评价系统中的应用

绩效评价系统是人力资源系统3P模型中的重要一环,是定期考察和评价个人或小组工作业绩的一种正式制度。利用微粒群算法对神经网络进行训练,再将此网络模型应用到人力资源管理系统中的绩效评价系统。最后通过在各级评价标准内按随机均匀分布方式生成的训练样本和测试样本来检测该微粒群神经网络。结果表明微粒群神经网络具有较强的泛化能力,应用在绩效评价系统中具有很高的评价准确率。     

覆盖表生成的粒子群算法:参数优化和自适应算法

组合测试是一种能有效检测由参数间相互作用所引发错误的软件测试方法,覆盖表的生成是该研究领域的一个重要问题.目前,很多方法已被应用于覆盖表生成,基于演化搜索的粒子群算法尽管能得到较优的解,但其性能容易受到配置参数的影响.本文首先使用试验设计的方法,对不同覆盖表生成的算法参数进行优化,系统分析了参数对算法性能的影响.同时,考虑到对不同的覆盖表,最优的算法参数往往不同,因此进一步提出了一种适用于覆盖表生成的自适应粒子群算法.实验结果表明,在一定的参数取值范围内粒子群算法都能获得较好的结果,且不存在一组对任意覆盖表都能有最优性能的算法参数.通过参数调优,能使粒子群算法获得比已有结果规模更小的覆盖表,同时,与经过参数调优后的算法相比,自适应粒子群算法在大部分情况下有更好的性能.     

QoS multicast routing using a quantum-behaved particle swarm optimization algorithm

QoS multicast routing in networks is a very important research issue in networks and distributed systems. It is also a challenging and hard problem for high-performance networks of the next generation. Due to its NP-completeness, many heuristic methods have been employed to solve the problem. This paper proposes the modified quantum-behaved particle swarm optimization (QPSO) method for QoS multicast routing. In the proposed method, QoS multicast routing is converted into an integer programming problem with QoS constraints and is solved by the QPSO algorithm combined with loop deletion operation. The QPSO-based routing method, along with the routing algorithms based on particle swarm optimization (PSO) and genetic algorithm (GA), is tested on randomly generated network topologies for the purpose of performance evaluation. The simulation results show the efficiency of the proposed method on QoS the routing problem and its superiority to the methods based on PSO and GA.     

Particle swarm optimisation for feature selection in classification: Novel initialisation and updating mechanisms

In classification, feature selection is an important data pre-processing technique, but it is a difficult problem due mainly to the large search space. Particle swarm optimisation (PSO) is an efficient evolutionary computation technique. However, the traditional personal best and global best updating mechanism in PSO limits its performance for feature selection and the potential of PSO for feature selection has not been fully investigated. This paper proposes three new initialisation strategies and three new personal best and global best updating mechanisms in PSO to develop novel feature selection approaches with the goals of maximising the classification performance, minimising the number of features and reducing the computational time. The proposed initialisation strategies and updating mechanisms are compared with the traditional initialisation and the traditional updating mechanism. Meanwhile, the most promising initialisation strategy and updating mechanism are combined to form a new approach (PSO(4-2)) to address feature selection problems and it is compared with two traditional feature selection methods and two PSO based methods. Experiments on twenty benchmark datasets show that PSO with the new initialisation strategies and/or the new updating mechanisms can automatically evolve a feature subset with a smaller number of features and higher classification performance than using all features. PSO(4-2) outperforms the two traditional methods and two PSO based algorithm in terms of the computational time, the number of features and the classification performance. The superior performance of this algorithm is due mainly to both the proposed initialisation strategy, which aims to take the advantages of both the forward selection and backward selection to decrease the number of features and the computational time, and the new updating mechanism, which can overcome the limitations of traditional updating mechanisms by taking the number of features into account, which reduces the number of features and the computational time.     

Classifier design for static security assessment using particle swarm optimization

Security is recognized as an important problem in planning, design and operation stages of electric power systems. Power system security assessment deals with the system’s ability to continue to provide service in the event of an unforeseen contingency. This paper proposes a particle swarm optimization (PSO) based classification for static security evaluation in power systems. A straightforward and quick procedure is used to select a small number of variables as features from a large set of variables which are normally available in power systems. A simple first order security function is designed using the selected features for classification. The training of weights in the classifier function (security function) is carried out by PSO technique. The PSO algorithm has minimized the error rate in classification. The procedure to determine the security function (classifier) is discussed. The performance of the algorithm is tested on IEEE 14 Bus, IEEE 57 Bus and IEEE 118 Bus systems. Simulation results show that the PSO classifier gives a fairly high classification accuracy and less misclassification rate.     

Communication latency tolerant parallel algorithm for particle swarm optimization

Particle swarm optimization (PSO) algorithm is a population-based algorithm for finding the optimal solution. Because of its simplicity in implementation and fewer adjustable parameters compared to the other global optimization algorithms, PSO is gaining attention in solving complex and large scale problems. However, PSO often requires long execution time to solve those problems. This paper proposes a parallel PSO algorithm, called delayed exchange parallelization, which improves performance of PSO on distributed environment by hiding communication latency efficiently. By overlapping communication with computation, the proposed algorithm extracts parallelism inherent in PSO. The performance of our proposed parallel PSO algorithm was evaluated using several applications. The results of evaluation showed that the proposed parallel algorithm drastically improved the performance of PSO, especially in high-latency network environment.     

Improved particle swarm optimization algorithm and its application in text feature selection

Text feature selection is an importance step in text classification and directly affects the classification performance. Classic feature selection methods mainly include document frequency (DF), information gain (IG), mutual information (MI), chi-square test (CHI). Theoretically, these methods are difficult to get improvement due to the deficiency of their mathematical models. In order to further improve effect of feature selection, many researches try to add intelligent optimization algorithms into feature selection method, such as improved ant colony algorithm and genetic algorithms, etc. Compared to the ant colony algorithm and genetic algorithms, particle swarm optimization algorithm (PSO) is simpler to implement and can find the optimal point quickly. Thus, this paper attempt to improve the effect of text feature selection through PSO. By analyzing current achievements of improved PSO and characteristic of classic feature selection methods, we have done many explorations in this paper. Above all, we selected the common PSO model, the two improved PSO models based respectively on functional inertia weight and constant constriction factor to optimize feature selection methods. Afterwards, according to constant constriction factor, we constructed a new functional constriction factor and added it into traditional PSO model. Finally, we proposed two improved PSO models based on both functional constriction factor and functional inertia weight, they are respectively the synchronously improved PSO model and the asynchronously improved PSO model. In our experiments, CHI was selected as the basic feature selection method. We improved CHI through using the six PSO models mentioned above. The experiment results and significance tests show that the asynchronously improved PSO model is the best one among all models both in the effect of text classification and in the stability of different dimensions.     

基于PSO算法的某型飞机起飞阶段参数辨识及性能分析

飞机性能分析是飞行训练评估的重要组成部分具有重要的应用价值。结合某型军用战机起飞阶段飞参数据,研究了利用粒子群算法(PSO)进行参数辨识并进行飞机性能分析的问题。首先通过动力学建立了起飞性能数学模型;然后将动力学方程转化为以速度的平方为输入量,速度增量为输出量的状态方程,利用PSO进行识别并得到了待辨识的参数,并具有较高的精度;最后将辨识的参数代入动力学方程针对影响起飞性能的起飞质量和温度进行了分析,得到在极端条件下飞机起飞性能。可以为日后选择最佳性能飞机作战出动提供决策参考。     

基因变异的群智能优化算法研究

粒子群优化（Particle Swarm Optimization,PSO）是一种重要的群智能（Swarm Intelligence,SI）方法。早期收敛和较低的局部搜索能力是PSO的不足。提出一种新颖的基因变异PSO（Gene Mutation PSO,GMPSO）,依据概率使粒子的分量发生变异,并做了大量的实验。研究和实验的结果表明,该方法可显著改变PSO的性能,在理论上是可靠的,技术上是可行的。