基于量子粒子群算法的电力系统负荷多目标优化分配

针对电力系统经济负荷优化分配问题,提出了一种基于量子粒子群的多目标优化算法.该算法通过将改进后的量子进化算法融合到粒子群中,采用量子位对粒子的当前位置进行编码,用量子旋转门实现对粒子最优位置的搜索,用量子非门实现粒子位置的变异以避免早熟收敛.这种搜索机制能够遍历解空间,增强种群的多样性,并能用量子位的概率幅将最优解表述为解空间中的多种表述形式,从而增强全局最优的可能性.最后,通过算例进行仿真分析,结果表明算法的搜索能力和优化效率均优于普通粒子群算法.     

基于粒子群优化的神经网络预测模型

BP学习算法多采用梯度下降法调整权值,针对其易陷入局部极小、收敛速度慢和易引起振荡的固有缺陷,提出了一种改进粒子群神经网络算法.其基本思想是:首先采用改进粒子群优化算法反复优化BP神经网络模型的权值参数组合,再用BP算法对得到的网络参数进一步精确优化,最后用得到精确的最优参数组合进行预测.实验结果表明,该算法在股指预测中的预测性能明显提高.     

基于混沌粒子群优化算法的灰色GM(1,1)模型在地下水埋深预测中的应用

将混沌优化算法与粒子群优化算法相结合,形成新的混沌粒子群优化算法.利用混沌运动的遍历性,避免陷入局部最优.同时,粒子群算法能加快混沌优化算法的收敛速度,使搜索效率得到提高.用混沌粒子群优化算法优化灰色GM(1,1)模型中的参数,通过横向和纵向比较,优化效果良好,模型预测精度得到了提高.运用该模型对三江平原地下水埋深进行动态预测,预测结果可为有关决策部门提供参考.     

基于粒子群算法的大型网络计划资源优化

现有求解网络计划资源优化的方法中,解析法不能解决大型复杂网络优化问题,启发式方法过多依赖具体问题、求解效率低,遗传算法生成新一代优化解种群依据的三个算子的实现参数选择,大部分依靠经验并严重影响解的品质,粒子群算法存在大型网络计划资源优化计算量过大和缺少大型网络计划资源优化算例问题.借助设计网络计划时间参数的计算机算法、建立评价函数、设计进化方程等基础工作,选择与工作开始时间相关的变量作为粒子空间位置,用蒙特卡洛方法和限制条件优化初始粒子群,设置可行解范围,用二维动态数组解决大型网络计划资源优化运行image超限问题,通过粒子群算法进化,寻求大型网络计划资源优化解,算例表明基于粒子群算法的大型网络计划资源优化效果明显,粒子群算法参数分析表明:粒子群算法的参数会影响网络计划资源优化结果,而且初始粒子群限制条件和优化目标设置的影响程度较大.     

粒子群优化的收敛分析及在广义预测控制中的应用

在进行粒子群优化的收敛性理论分析的基础上,推出了保证粒子群优化算法收敛性的参数设置区域,合理选择粒子群算法的关键参数,将粒子群优化与广义预测控制有机融合,用粒子群算法来解决广义预测控制的优化问题,提出基于粒子群优化的广义预测控制算法,通过工业过程对象的仿真并和传统的广义预测控制算法进行了对比分析,表明了该算法的有效性,特别是算法具有良好的输出跟踪精度和较强的鲁棒性.     

一种使用单纯形法优化的粒子群算法

根据单纯形法和粒子群算法的各自特点,提出了一种使用单纯形法优化的粒子群算法,算法利用单纯形法来对粒子群算法的初始值进行处理.数值实验表明,优化后的粒子群算法具有更好的的寻优能力.     

求解高维复合体函数的智能优化算法

由于粒子群算法在处理高维复杂函数时存在容易陷入局部最优的问题,提出了多种群子空间学习粒子群算法(SLPSO),采用多种群进化模式,在粒子更新公式中加入了全局最优粒子,加快了粒子收敛速度,同时在种群之间采用了交叉学习的方法,大大提高了算法的全局搜索能力.另外,还增加了一种子空间学习方法,充分地利用粒子的历史经验,有效地避免了陷入局部最优的问题.通过在高维基准测试函数的仿真实验表明,SLPSO算法的测试结果都明显优于其他两种算法,随着函数维数增加,SLPSO算法测试结果的下降幅度明显低于其他两种算法.在6个极其复杂的复合函数的测试中,SLPSO算法有2个测试函数结果非常接近理论值,其他4个也明显优于其他三种算法.     

不同大小粒子之间相互作用的直接数值模拟

应用改进的拉格朗日乘子/虚拟区域算法对不同大小的两个圆形粒子在二维方槽中的沉降过程和相互作用进行了直接数值模拟,并进行了实验验证．结果表明不同大小的两个粒子在沉降过程中的相互作用可以描述为追尾、接触、旋转和分离4个过程,只有当两个粒子尺度差异很小时,才会重复进行DKT过程．在两个粒子相互作用的过程中,小粒子的运动受到大粒子的影响更剧烈一些,而相反大粒子运动包括运动轨迹和速度所受到的影响则相对较小．     

基于混沌粒子群算法的Tikhonov正则化参数选取

Tikhonov正则化方法是求解不适定问题最为有效的方法之一,而正则化参数的最优选取是其关键.本文将混沌粒子群优化算法与Tikhonov正则化方法相结合,基于Morozov偏差原理设计粒子群的适应度函数,利用混沌粒子群优化算法的优点,为正则化参数的选取提供了一条有效的途径.数值实验结果表明,本文方法能有效地处理不适定问题,是一种实用有效的方法.     

基于PCA和改进的PSO-SVM的机器人移动方向分类

随着人们创新水平的不断提高,为了更加准确的实现机器人的导航任务,提出了一种基于改进的粒子群优化支持向量机中的参数的方法.首先利用主成分分析法对数据进行降维,然后利用改进的粒子群优化算法,对SVM中的惩罚参数c和核函数的参数g进行优化,最后代入到SVM中,以此来达到运用SVM对机器人的导航任务进行分类识别.相对于其他算法,容易发现改进的粒子群优化算法优化后的支持向量机可以达到很好的效果.这种识别分类可以帮助人们很好的对机器人进行导航,对今后机器人的研究具有很大的应用价值.     

Modified particle swarm optimization algorithm with simulated annealing behavior and its numerical verification

The hybrid algorithm that combined particle swarm optimization with simulated annealing behavior (SA-PSO) is proposed in this paper. The SA-PSO algorithm takes both of the advantages of good solution quality in simulated annealing and fast searching ability in particle swarm optimization. As stochastic optimization algorithms are sensitive to their parameters, proper procedure for parameters selection is introduced in this paper to improve solution quality. To verify the usability and effectiveness of the proposed algorithm, simulations are performed using 20 different mathematical optimization functions with different dimensions. The comparative works have also been conducted among different algorithms under the criteria of quality of the solution, the efficiency of searching for the solution and the convergence characteristics. According to the results, the SA-PSO could have higher efficiency, better quality and faster convergence speed than compared algorithms.     

Particle swarm optimization with age-group topology for multimodal functions and data clustering

This paper proposes particle swarm optimization with age-group topology (PSOAG), a novel age-based particle swarm optimization (PSO). In this work, we present a new concept of age to measure the search ability of each particle in local area. To keep population diversity during searching, we separate particles to different age-groups by their age and particles in each age-group can only select the ones in younger groups or their own groups as their neighbourhoods. To allow search escape from local optima, the aging particles are regularly replaced by new and randomly generated ones. In addition, we design an age-group based parameter setting method, where particles in different age-groups have different parameters, to accelerate convergence. This algorithm is applied to nonlinear function optimization and data clustering problems for performance evaluation. In comparison against several PSO variants and other EAs, we find that the proposed algorithm provides significantly better performances on both the function optimization problems and the data clustering tasks.     

含悬浮固粒射流界面稳定性研究

利用气固两相耦合模型,理论推导出含悬浮固粒射流的稳定性方程,通过数值计算得到了两相射流稳定性特征曲线、固气扰动速度比值幅值曲线及固气相位差曲线,进而得到了关于固粒对流场中扰动增长和传播的影响及失稳过程中固粒扰动特性的结论。这些结论对于两相射流发展的认识和工程实际中实施对两相射流场的人工控制有重要意义。     

System identification and control using adaptive particle swarm optimization

This paper presents a methodology for finding optimal system parameters and optimal control parameters using a novel adaptive particle swarm optimization (APSO) algorithm. In the proposed APSO, every particle dynamically adjusts inertia weight according to feedback taken from particles’ best memories. The main advantages of the proposed APSO are to achieve faster convergence speed and better solution accuracy with minimum incremental computational burden. In the beginning we attempt to utilize the proposed algorithm to identify the unknown system parameters the structure of which is assumed to be known previously. Next, according to the identified system, PID gains are optimally found by also using the proposed algorithm. Two simulated examples are finally given to demonstrate the effectiveness of the proposed algorithm. The comparison to PSO with linearly decreasing inertia weight (LDW-PSO) and genetic algorithm (GA) exhibits the APSO-based system’s superiority.     

基于遗传算法的神经网络参数优化研究

神经网络和遗传算法是软计算领域中最重要的方法.采用MATLAB的神经网络工具箱和遗传算法工具,研究二者的结合使用,对两个工具箱的基本应用以及将二者结合的相关技术都作了介绍,并应用实例进行了分析研究,提出了使用遗传算法优化神经网络参数的不同结论,对于如何有效使用遗传算法优化神经网络具有一定的借鉴作用.     

Identification of ground water flow patterns using particle models

Particle models are often used to simulate transport processes in ground water. The ground water flow pattern is one of the driving parameters of the transport model. In this paper a parameter identification algorithm is developed for particle type models to identify the underlying flow pattern from concentration measurements. The estimation problem is solved with a gradient based algorithm. For each generated particle track, the adjoint track is determined to efficiently compute gradient of the criterion.     

The Alive Particle Filter and Its Use in Particle Markov Chain Monte Carlo

In the following article, we investigate a particle filter for approximating Feynman–Kac models with indicator potentials and we use this algorithm within Markov chain Monte Carlo (MCMC) to learn static parameters of the model. Examples of such models include approximate Bayesian computation (ABC) posteriors associated with hidden Markov models (HMMs) or rare-event problems. Such models require the use of advanced particle filter or MCMC algorithms to perform estimation. One of the drawbacks of existing particle filters is that they may “collapse,” in that the algorithm may terminate early, due to the indicator potentials. In this article, using a newly developed special case of the locally adaptive particle filter, we use an algorithm that can deal with this latter problem, while introducing a random cost per-time step. In particular, we show how this algorithm can be used within MCMC, using particle MCMC. It is established that, when not taking into account computational time, when the new MCMC algorithm is applied to a simplified model it has a lower asymptotic variance in comparison to a standard particle MCMC algorithm. Numerical examples are presented for ABC approximations of HMMs.     

Application of bacterial colony chemotaxis optimization algorithm and RBF neural network in thermal NDT/E for the identification of defect parameters

The identification of defect parameters in thermal non-destructive test and evaluation (NDT/E) was considered as a kind of inverse heat transfer problem (IHTP). However, it can be further considered as a shape optimization problem, and then a structure design optimization problem, and the design results should meet the surface temperature profile of the apparatus with defects. A bacterial colony chemotaxis (BCC) optimization algorithm and a radial basis function (RBF) neural network (NN) are applied to the thermal NDT/E for the identification of defects parameters. The RBFNN is a precise and convenient surrogate model for the time costly finite element computation, which obtains the surface temperature with different defect parameters. The BCC optimization algorithm is derivatively-free, and the convergence speed is fast. Then a simple but complete multi-disciplinary design optimization (MDO) framework is constructed for the sake of generality and flexibility. This method is applied to a simple verification case and the result is acceptable. The algorithm is also compared with the particle swarm optimization (PSO) algorithm, and the BCC algorithm can access the optimum with faster speed.     

基于粒子群-支持向量机定量降水集合预报方法

首先对ECMWF不同物理量场预报因子群进行自然正交展开,选取能充分反映每个预报因子场主要信息的第一主分量作为模型输入.进一步利用粒子群算法对支持向量回归机的相关参数进行优化,以南宁市8个气象站单站逐日降水作为预报对象,建立粒子群-支持向量回归集合预报模型,进行单站逐日降水的数值预报产品释用预报方法研究.利用模型对2015年5-6月南宁市8站进行了逐日降水预报业务试验,结果表明,模型具有较好的预报效果.并提出了利用隶属函数建立可信度函数对不同的预报模型进行评价.