基于量子粒子群算法的结构模态参数识别

以由结构输入输出数据计算所得实测频响函数与理论频响函数差值最小化为优化目标,通过对理论频响函数中所含结构模态参数搜索取值使目标函数最小,即将结构模态参数识别问题转化为优化问题。采用量子粒子群算法对此过程优化计算,获得结构模态参数。用数值模拟六层框架结构对该方法进行验证。结果表明,量子粒子群可有效识别结构模态参数。     

量子粒子群结合小波变换识别结构模态参数

通过对结构响应进行连续小波变换将多自由度模态参数识别转化为多个单自由度模态参数识别。建立小波骨架理论公式与由结构输出信号计算而得的小波骨架之差为目标函数的优化问题,通过搜索包含于小波骨架理论公式中的模态参数的取值而使目标值最小,从而将优化问题转化为模态参数识别问题。量子粒子群算法是一种基于群体智能理论的优化算法。将量子粒子群算法应用到上述方法中一次性识别出结构的频率、阻尼和振型。最后采用数值模拟的简支梁对该方法进行有效性验证。结果表明,量子粒子群算法结合连续小波变换可以有效地识别环境激励下的结构模态参数。     

应用优化限制带宽经验模态分解法识别电力变压器绕组模态参数

电力变压器绕组的模态参数识别与绕组结构振动特性及其优化设计、绕组振动故障诊断密切相关,因此,准确识别电力变压器绕组的模态参数意义重大。根据某10 kV实体变压器绕组的轴向模态实验结果,提出一种基于粒子群的优化带宽限制经验模态分解算法对变压器绕组的模态参数进行识别。该方法首先在实测振动信号的经验模态分解中引入屏蔽信号,然后使用粒子群优化算法确定最佳的屏蔽信号频率,从而有效地抑制了现有经验模态分解算法中的模态混叠现象,提高了绕组模态参数的准确率。与目前通用的频域识别方法 PolyMax法的识别结果的对比结果表明:该方法能够准确地识别出变压器绕组的前四阶固有频率和阻尼比,且具有较强的抗干扰能力,适合于识别变压器绕组这类结构复杂的模态参数。     

粒子群优化算法在电网规划中的应用

粒子群算法适合求解连续变量优化问题,本文提出了粒子群算法的新离散化方法。常规粒子群算法在电力系统优化问题中取得了成功,但有"趋同性"。本文提出了改进多粒子群优化算法(IPPSO),IPPSO是两层结构:底层用多个粒子群相互独立地搜索解空间以扩大搜索范围;上层用1个粒子群追逐当前全局最优解以加快收敛。粒子群以及粒子状态更新策略不要求相同。     

二轴倾转旋翼无人机的设计及实现

该文结合多旋翼无人机和固定翼无人机的优点设计了二轴倾转旋翼无人机,这是一款摒弃传统设计观念的新型无人机。采用碳纤维复合材料以及巴尔沙木材,在最大程度减重的同时又保证了机体的强度。通过机载STM32处理器引导输出不同宽度的PWM波脉控制舵机带动发动机吊舱实现倾转。在垂直飞行姿态下,其最大推重比可达2,在水平飞行姿态下,其续航时间为52 min。其凭借着大推重比和高续航时间,可在山区、灾区等复杂环境中进行勘察、巡航等作业。     

基于粒子群算法的改进模态参数识别方法

针对一类多模态振动衰减信号的模态参数识别,结合奇异值分解(singular value decomposition,SVD)、解析模态分解(analytical mode decomposition,AMD)、自回归功率谱和粒子群优化(particle swarm optimization,PSO)算法,提出了一种改进...     

粒子群算法的混沌优化

粒子群算法具有较强的普适性、鲁棒性、全局搜索性等特点,在求解复杂问题时具有明显的优越性,本文对粒子群算法进行混沌优化,使其为决策者提供一种有效的优化工具。     

一种改进的粒子群优化粒子滤波算法

粒子群优化粒子滤波方法容易陷入局部最优,针对这一问题,提出一种改进的粒子群优化粒子滤波算法,该算法对惯性权重和位置更新采用模糊控制,增强粒子全局搜索的能力,防止粒子陷入局部最优,提高估计精度。     

粒子群优化算法在水文科学中的应用进展

介绍了粒子群算法的标准算法及流程,探讨了粒子群算法在水库优化调度、水电站经济运行、参数优选等水文领域中的研究成果和存在的问题,指出未来应该加强粒子群算法改进机理和收敛性能的研究,并与其他算法技术相比较、结合,拓展其在水文科学领域的应用范围,为解决水文领域中大量优化问题提供新途径。     

粒子群优化算法综述

粒子群优化（PSO）算法是一种新兴的优化技术,其思想来源于人工生命和演化计算理论。PSO通过粒子追随自己找到的最好解和整个群的最好解来完成优化。该算法简单易实现,可调参数少,已得到广泛研究和应用。详细介绍了PSO的基本原理、各种改进技术及其应用等,并对其未来的研究提出了一些建议。     

Self-regulating and self-evolving particle swarm optimizer

In this article, a novel self-regulating and self-evolving particle swarm optimizer (SSPSO) is proposed. Learning from the idea of direction reversal, self-regulating behaviour is a modified position update rule for particles, according to which the algorithm improves the best position to accelerate convergence in situations where the traditional update rule does not work. Borrowing the idea of mutation from evolutionary computation, self-evolving behaviour acts on the current best particle in the swarm to prevent the algorithm from prematurely converging. The performance of SSPSO and four other improved particle swarm optimizers is numerically evaluated by unimodal, multimodal and rotated multimodal benchmark functions. The effectiveness of SSPSO in solving real-world problems is shown by the magnetic optimization of a Halbach-based permanent magnet machine. The results show that SSPSO has good convergence performance and high reliability, and is well matched to actual problems.     

A decreasing inertia weight particle swarm optimizer

It has been over ten years since the pioneering work of particle swarm optimization (PSO) espoused by Kennedy and Eberhart. Since then, various modifications, well suited to particular application areas, have been reported widely in the literature. The evolutionary concept of PSO is clear-cut in nature, easy to implement in practice, and computationally efficient in comparison to other evolutionary algorithms. The above-mentioned merits are primarily the motivation of this article to investigate PSO when applied to continuous optimization problems. The performance of conventional PSO on the solution quality and convergence speed deteriorates when the function to be optimized is multimodal or with a large problem size. Toward that end, it is of great practical value to develop a modified particle swarm optimizer suitable for solving high-dimensional, multimodal optimization problems. In the first part of the article, the design of experiments (DOE) has been conducted comprehensively to examine the influences of each parameter in PSO. Based upon the DOE results, a modified PSO algorithm, termed Decreasing-Weight Particle Swarm Optimization (DW-PSO), is addressed. Two performance measures, the success rate and number of function evaluations, are used to evaluate the proposed method. The computational comparisons with the existing PSO algorithms show that DW-PSO exhibits a noticeable advantage, especially when it is performed to solve high-dimensional problems.     

基于动态改变权重粒子群算法的球度误差评定

为了实现对球形工件球度误差的精确评定,在4种球度误差评定数学模型的基础上,对文献提供的两组数据采用一种动态改变权重的粒子群算法(PSO)进行计算,这种算法在优化迭代过程中使惯性权重值随粒子的位置和目标函数的性质而更新。与基本PSO算法、最小二乘法、遗传算法和一种改进的PSO算法进行了比较。实验结果显示,相比其他方法,在最小包容区域法模型下使用动态改变权重粒子群算法得到的球度误差最小,第1组数据只需迭代30代左右,约50ms即可收敛,第2组数据收敛也很迅速,且多次实验显示其稳定性很高。因此,所提算法可精确快速地评价球度误差。     

A new multi-objective particle swarm optimizer using empirical movement and diversified search strategies

Most real-world optimization problems involve the optimization task of more than a single objective function and, therefore, require a great amount of computational effort as the solution procedure is designed to anchor multiple compromised optimal solutions. Abundant multi-objective evolutionary algorithms (MOEAs) for multi-objective optimization have appeared in the literature over the past two decades. In this article, a new proposal by means of particle swarm optimization is addressed for solving multi-objective optimization problems. The proposed algorithm is constructed based on the concept of Pareto dominance, taking both the diversified search and empirical movement strategies into account. The proposed particle swarm MOEA with these two strategies is thus dubbed the empirical-movement diversified-search multi-objective particle swarm optimizer (EMDS-MOPSO). Its performance is assessed in terms of a suite of standard benchmark functions taken from the literature and compared to other four state-of-the-art MOEAs. The computational results demonstrate that the proposed algorithm shows great promise in solving multi-objective optimization problems.     

A particle swarm optimizer for constrained multi-objective engineering design problems

This article presents a particle swarm optimizer (PSO) capable of handling constrained multi-objective optimization problems. The latter occur frequently in engineering design, especially when cost and performance are simultaneously optimized. The proposed algorithm combines the swarm intelligence fundamentals with elements from bio-inspired algorithms. A distinctive feature of the algorithm is the utilization of an arithmetic recombination operator, which allows interaction between non-dominated particles. Furthermore, there is no utilization of an external archive to store optimal solutions. The PSO algorithm is applied to multi-objective optimization benchmark problems and also to constrained multi-objective engineering design problems. The algorithmic effectiveness is demonstrated through comparisons of the PSO results with those obtained from other evolutionary optimization algorithms. The proposed particle swarm optimizer was able to perform in a very satisfactory manner in problems with multiple constraints and/or high dimensionality. Promising results were also obtained for a multi-objective engineering design problem with mixed variables.     

Hybrid particle swarm optimizer for a class of dynamic fitness landscape

This article presents the use of particle swarm optimization (PSO) for a class of non-stationary environments. The dynamic problems studied in this work are restricted to one of the possible types of changes that can be produced over the fitness landscape. A hybrid PSO approach (called HPSO_dyn) is proposed, which uses a dynamic macromutation operator to maintain diversity. In order to validate the approach, a test case generator previously proposed in the specialized literature was adopted. Such a test case generator allows the creation of different types of dynamic environments with a varying degree of complexity. The main goals of this research were to analyze the ability of HPSO_dyn to react to the changes in the environment, to study the influence of the dynamic macromutation operator on the algorithm's performance and finally, to analyze the algorithm's behavior in the presence of high multimodality.     

Dynamic multi-swarm particle swarm optimizer using parallel PC cluster systems for global optimization of large-scale multimodal functions

This article presents a novel parallel multi-swarm optimization (PMSO) algorithm with the aim of enhancing the search ability of standard single-swarm PSOs for global optimization of very large-scale multimodal functions. Different from the existing multi-swarm structures, the multiple swarms work in parallel, and the search space is partitioned evenly and dynamically assigned in a weighted manner via the roulette wheel selection (RWS) mechanism. This parallel, distributed framework of the PMSO algorithm is developed based on a master–slave paradigm, which is implemented on a cluster of PCs using message passing interface (MPI) for information interchange among swarms. The PMSO algorithm handles multiple swarms simultaneously and each swarm performs PSO operations of its own independently. In particular, one swarm is designated for global search and the others are for local search. The first part of the experimental comparison is made among the PMSO, standard PSO, and two state-of-the-art algorithms (CTSS and CLPSO) in terms of various un-rotated and rotated benchmark functions taken from the literature. In the second part, the proposed multi-swarm algorithm is tested on large-scale multimodal benchmark functions up to 300 dimensions. The results of the PMSO algorithm show great promise in solving high-dimensional problems.     

Process identification using a new component analysis model and particle swarm optimization

A novel component analysis model is proposed to identify the mixed process signals which are frequently encountered in the statistical process control (SPC) and engineering process control (EPC) practice. Based upon one of existing state-of-the-art evolutionary algorithms, called particle swarm optimization (PSO), the proposed model provides a solution (i.e., demixing matrix) by maximizing the determinant of the corresponding second-order moment (variance–covariance) matrix of the reconstructed signals. Then, the estimated demixing matrix is used to separate mixed signals arising from several original process signals. The process signals considered in this paper include inconsistent variance series, autoregressive (AR) series, step change, and Gaussian noises in the process data. In practice, most of industrial manufacturing processes can be well characterized by a mixture of these four types of data. By following the proposed model, the blind signal separation framework can be cast into a nonlinear constrained optimization problem, where only the demixing matrix appears as unknown. Several illustrative examples involving linear mixtures of the process signals with different statistical characteristics are demonstrated to justify the new component analysis model.     

倾转旋翼/机翼耦合系统过渡状态气弹动力学试验研究

研制了半展长的倾转旋翼／机翼耦合系统动力学模型,进行了模型的机翼基阶挥舞弯曲／扭转耦合振动随倾转角变化的气弹动力学特性分析及风洞试验,研究倾转角及前吹风速度对倾转旋翼／机翼耦合系统的机翼基阶挥舞弯曲／扭转耦合振动气弹动力学特性的影响。理论分析与试验结果表明：随试验模型从直升机模式倾转过渡到飞机模式,倾转旋翼／机翼耦合系统的机翼基阶挥舞弯曲／扭转耦合振动频率将会提高;在小前进比的前吹风倾转过程中,倾转旋翼／机翼耦合系统的机翼基阶挥舞弯曲／扭转耦合振动的阻尼随倾转角位置的不同而显著变化,随试验模型从直升机模式过渡到飞机模式,倾转旋翼／机翼耦合系统的机翼基阶挥舞弯曲／扭转耦合振动的阻尼明显降低。