A Chaotic Local Search-Based Particle Swarm Optimizer for Large-Scale Complex Wind Farm Layout Optimization

Wind energy has been widely applied in power generation to alleviate climate problems.The wind turbine layout of a wind farm is a primary factor of impacting power conversion efficiency due to the wake effect that reduces the power outputs of wind turbines located in downstream.Wind farm layout optimization(WFLO)aims to reduce the wake effect for maximizing the power outputs of the wind farm.Nevertheless,the wake effect among wind turbines increases significantly as the number of wind turbines increases in the wind farm,which severely affect power conversion efficiency.Conventional heuristic algorithms suffer from issues of low solution quality and local optimum for large-scale WFLO under complex wind scenarios.Thus,a chaotic local search-based genetic learning particle swarm optimizer(CGPSO)is proposed to optimize large-scale WFLO problems.CGPSO is tested on four larger-scale wind farms under four complex wind scenarios and compares with eight state-of-the-art algorithms.The experiment results indicate that CGPSO significantly outperforms its competitors in terms of performance,stability,and robustness.To be specific,a success and failure memories-based selection is proposed to choose a chaotic map for chaotic search local.It improves the solution quality.The parameter and search pattern of chaotic local search are also analyzed for WFLO problems.

Adaptive Multi-Updating Strategy Based Particle Swarm Optimization

Particle swarm optimization(PSO)is a stochastic computation tech-nique that has become an increasingly important branch of swarm intelligence optimization.However,like other evolutionary algorithms,PSO also suffers from premature convergence and entrapment into local optima in dealing with complex multimodal problems.Thus this paper puts forward an adaptive multi-updating strategy based particle swarm optimization(abbreviated as AMS-PSO).To start with,the chaotic sequence is employed to generate high-quality initial particles to accelerate the convergence rate of the AMS-PSO.Subsequently,according to the current iteration,different update schemes are used to regulate the particle search process at different evolution stages.To be specific,two different sets of velocity update strategies are utilized to enhance the exploration ability in the early evolution stage while the other two sets of velocity update schemes are applied to improve the exploitation capability in the later evolution stage.Followed by the unequal weightage of acceleration coefficients is used to guide the search for the global worst particle to enhance the swarm diversity.In addition,an auxiliary update strategy is exclusively leveraged to the global best particle for the purpose of ensuring the convergence of the PSO method.Finally,extensive experiments on two sets of well-known benchmark functions bear out that AMS-PSO outperforms several state-of-the-art PSOs in terms of solution accuracy and convergence rate.

Hybrid particle swarm optimization with differential evolution and chaotic local search to solve reliability-redundancy allocation problems

In order to solve reliability-redundancy allocation problems more effectively, a new hybrid algorithm named CDEPSO is proposed in this work, which combines particle swarm optimization （PSO） with differential evolution （DE） and a new chaotic local search. In the CDEPSO algorithm, DE provides its best solution to PSO if the best solution obtained by DE is better than that by PSO, while the best solution in the PSO is performed by chaotic local search. To investigate the performance of CDEPSO, four typical reliability-redundancy allocation problems were solved and the results indicate that the convergence speed and robustness of CDEPSO is better than those of PSO and CPSO （a hybrid algorithm which only combines PSO with chaotic local search）. And, compared with the other six improved meta-heuristics, CDEPSO also exhibits more robust performance. In addition, a new performance was proposed to more fairly compare CDEPSO with the same six improved recta-heuristics, and CDEPSO algorithm is the best in solving these problems.

A Learning Particle Swarm Optimization Algorithm for Odor Source Localization

This paper is concerned with the problem of odor source localization using multi-robot system. A learning particle swarm optimization algorithm, which can coordinate a multi-robot system to locate the odor source, is proposed. First, in order to develop the proposed algorithm, a source probability map for a robot is built and updated by using concentration magnitude information, wind information, and swarm information. Based on the source probability map, the new position of the robot can be generated. Second, a distributed coordination architecture, by which the proposed algorithm can run on the multi-robot system, is designed. Specifically, the proposed algorithm is used on the group level to generate a new position for the robot. A consensus algorithm is then adopted on the robot level in order to control the robot to move from the current position to the new position. Finally, the effectiveness of the proposed algorithm is illustrated for the odor source localization problem.

Enhanced Particle Swarm Optimization Based Local Search for Reactive Power Compensation Problem

This paper presents an enhanced Particle Swarm Optimization (PSO) algorithm applied to the reactive power compensation (RPC) problem. It is based on the combination of Genetic Algorithm (GA) and PSO. Our approach integrates the merits of both genetic algorithms (GAs) and particle swarm optimization (PSO) and it has two characteristic features. Firstly, the algorithm is initialized by a set of a random particle which traveling through the search space, during this travel an evolution of these particles is performed by a hybrid PSO with GA to get approximate no dominated solution. Secondly, to improve the solution quality, dynamic version of pattern search technique is implemented as neighborhood search engine where it intends to explore the less-crowded area in the current archive to possibly obtain more nondominated solutions. The proposed approach is carried out on the standard IEEE 30-bus 6-generator test system. The results demonstrate the capabilities of the proposed approach to generate true and well-distributed Pareto optimal nondominated solutions of the multiobjective RPC.

Quantum particle swarm optimization for micro-grid system with consideration of consumer satisfaction and benefit of generation side

Considering comprehensive benefit of micro-grid system and consumers,we establish a mathematical model with the goal of the maximum consumer satisfaction and the maximum benefit of power generation side in the view of energy management.An improved multi-objective local mutation adaptive quantum particle swarm optimization(MO-LM-AQPSO)algorithm is adopted to obtain the Pareto frontier of consumer satisfaction and the benefit of power generation side.The optimal solution of the non-dominant solution is selected with introducing the power shortage and power loss to maximize the benefit of power generation side,and its reasonableness is verified by numerical simulation.Then,translational load and time-of-use electricity price incentive mechanism are considered and reasonable peak-valley price ratio is adopted to guide users to actively participate in demand response.The simulation results show that the reasonable incentive mechanism increases the benefit of power generation side and improves the consumer satisfaction.Also the mechanism maximizes the utilization of renewable energy and effectively reduces the operation cost of the battery.

A Hybrid Optimizer Based On Firefly Algorithm And Particle Swarm Optimization Algorithm

As two widely used evolutionary algorithms,particle swarm optimization(PSO)and firefly algorithm(FA)have been successfully applied to diverse difficult applications.And extensive experiments verify their own merits and characteristics.To efficiently utilize different advantages of PSO and FA,three novel operators are proposed in a hybrid optimizer based on the two algorithms,named as FAPSO in this paper.Firstly,the population of FAPSO is divided into two sub-populations selecting FA and PSO as their basic algorithm to carry out the optimization process,respectively.To exchange the information of the two sub-populations and then efficiently utilize the merits of PSO and FA,the sub-populations share their own optimal solutions while they have stagnated more than a predefined threshold.Secondly,each dimension of the search space is divided into many small-sized sub-regions,based on which much historical knowledge is recorded to help the current best solution to carry out a detecting operator.The purposeful detecting operator enables the population to find a more promising sub-region,and then jumps out of a possible local optimum.Lastly,a classical local search strategy,i.e.,BFGS QuasiNewton method,is introduced to improve the exploitative capability of FAPSO.Extensive simulations upon different functions demonstrate that FAPSO is not only outperforms the two basic algorithm,i.e.,FA and PSO,but also surpasses some state-of-the-art variants of FA and PSO,as well as two hybrid algorithms.

Improved PSO-Extreme Learning Machine Algorithm for Indoor Localization

Wi Fi and fingerprinting localization method have been a hot topic in indoor positioning because of their universality and location-related features.The basic assumption of fingerprinting localization is that the received signal strength indication(RSSI)distance is accord with the location distance.Therefore,how to efficiently match the current RSSI of the user with the RSSI in the fingerprint database is the key to achieve high-accuracy localization.In this paper,a particle swarm optimization-extreme learning machine(PSO-ELM)algorithm is proposed on the basis of the original fingerprinting localization.Firstly,we collect the RSSI of the experimental area to construct the fingerprint database,and the ELM algorithm is applied to the online stages to determine the corresponding relation between the location of the terminal and the RSSI it receives.Secondly,PSO algorithm is used to improve the bias and weight of ELM neural network,and the global optimal results are obtained.Finally,extensive simulation results are presented.It is shown that the proposed algorithm can effectively reduce mean error of localization and improve positioning accuracy when compared with K-Nearest Neighbor(KNN),Kmeans and Back-propagation(BP)algorithms.

基于LPSO-GRNN模型的螺栓松紧状态预测研究

在轴重式动态汽车衡的服役状态下,由于受到重型货车频繁的加卸载循环冲击,会导致其内部螺栓发生松弛脱落,针对这一问题,提出了一种基于莱维飞行改进粒子群算法优化的广义回归神经网络(LPSO-GRNN)的轴重式动态汽车衡螺栓松紧状态预测模型,并结合振动信号特征提取,将该模型应用于汽车衡螺栓松紧状态的预测。首先,研究并提取了螺栓不同松紧状态下输出振动信号的波形指标、峰值指标、脉冲指标、峭度指标等信号特征,并将其作为模型的共同输入特征向量;然后,采用莱维飞行提高了粒子群优化算法的寻优能力,通过产生随机步长,提高了算法的全局寻优能力,避免算法陷入局部最优值;利用改进的算法对广义回归神经网络(GRNN)的光滑因子进行了优化,得到了全局最优的光滑因子;最后,通过设计实验,分别使用广义回归神经网络(GRNN)、粒子群算法优化广义回归神经网络(PSO-GRNN)和LPSO-GRNN,以此来对螺栓松紧状态进行了预测,并将预测结果与实际情况进行了对比分析。实验结果表明:基于LPSO-GRNN建立的螺栓松紧状态预测模型,其预测准确率可达到95%。研究结果表明:该螺栓松紧状态预测模型可以有效提高汽车衡螺栓松紧预测的准确率,同时有效解决粒子群算法容易陷入局部最优收敛的问题。

A joint optimization algorithm for focused energy delivery in precision electronic warfare

Focused energy delivery(FED) is a technique that can precisely bring energy to the specific region,which arouses wide attention in precision electronic warfare(PREW).This paper first proposes a joint optimization model with respect to the locations of the array and the transmitted signals to improve the performance of FED.As the problem is nonconvex and NP-hard,particle swarm optimization(PSO) is adopted to solve the locations of the array,while designing the transmitted signals under a feasible array is considered as a unimodular quadratic program(UQP) subproblem to calculate the fitness criterion of PSO.In the PSO-UQP framework established,two methods are presented for the UQP subproblem,which are more efficient and more accurate respectively than previous works.Furthermore,a threshold value is set in the framework to determine which method to adopt to take full advantages of the methods above.Meanwhile,we obtain the maximum localization error that FED can tolerate,which is significant for implementing FED in practice.Simulation results are provided to demonstrate the effectiveness of the joint optimization algorithm,and the correctness of the maximum localization error derived.

Three Dimensional Optimum Node Localization in Dynamic Wireless Sensor Networks

Location information plays an important role in most of the applications in Wireless Sensor Network(WSN).Recently,many localization techniques have been proposed,while most of these deals with two Dimensional applications.Whereas,in Three Dimensional applications the task is complex and there are large variations in the altitude levels.In these 3D environments,the sensors are placed in mountains for tracking and deployed in air for monitoring pollution level.For such applications,2D localization models are not reliable.Due to this,the design of 3D localization systems in WSNs faces new challenges.In this paper,in order to find unknown nodes in Three-Dimensional environment,only single anchor node is used.In the simulation-based environment,the nodes with unknown locations are moving at middle&lower layers whereas the top layer is equipped with single anchor node.A novel soft computing technique namely Adaptive Plant Propagation Algorithm(APPA)is introduced to obtain the optimized locations of these mobile nodes.Thesemobile target nodes are heterogeneous and deployed in an anisotropic environment having an Irregularity(Degree of Irregularity(DOI))value set to 0.01.The simulation results present that proposed APPAalgorithm outperforms as tested among other meta-heuristic optimization techniques in terms of localization error,computational time,and the located sensor nodes.

基于改进二进制粒子群算法优化DBN的轴承故障诊断

针对滚动轴承故障振动信号非平稳性的特点,对二进制粒子群优化算法(binary particles swarm optimization,BPSO)和深度信念网络(deep belief network,DBN)进行研究,提出一种基于局部均值分解(local mean decomposition,LMD)和IBPSO-DBN的轴承故障诊断方法。提出用加权惯性权重改进BPSO迭代过程中的固定权重,再用改进BPSO优化DBN的隐含层神经元个数和学习率。该方法先对信号进行LMD,提取出各PF分量的散布熵和时域指标,并构建特征矩阵,然后把特征矩阵输入改进BPSO-DBN模型中训练,实现滚动轴承故障诊断和分类。采用试验轴承数据做验证并与其他诊断方法对比,结果表明,基于LMD和BPSO-DBN的滚动轴承故障诊断方法具有较好的故障识别率。

陷阱标记联合懒蚂蚁的自适应粒子群优化算法

为解决现有粒子群改进策略无法帮助已陷入局部最优和过早收敛的粒子恢复寻优性能的问题,提出一种陷阱标记联合懒蚂蚁的自适应粒子群优化(adaptive particle swarm optimization based on trap label and lazy ant, TLLA-APSO)算法。陷阱标记策略为粒子群提供动态速度增量,使其摆脱最优解的束缚。利用懒蚂蚁寻优策略多样化粒子速度,提升种群多样性。通过惯性认知策略在速度更新中引入历史位置,增加粒子的路径多样性和提升粒子的探索性能,使粒子更有效地避免陷入新的局部最优。理论证明了引入历史位置的粒子群算法的收敛性。仿真实验结果表明,所提算法不仅能有效解决粒子群已陷入局部最优和过早收敛的问题,且与其他算法相比,具有较快的收敛速度和较高的寻优精度。

Longitudinal parameter identification of a small unmanned aerial vehicle based on modified particle swarm optimization

Abstract This paper describes a longitudinal parameter identification procedure for a small unmanned aerial vehicle （UAV） through modified particle swam optimization （PSO）. The proce- dure is demonstrated using a small UAV equipped with only an micro-electro-mechanical systems （MEMS） inertial mea,mring element and a global positioning system （GPS） receiver to provide test information. A small UAV longitudinal parameter mathematical model is derived and the modified method is proposed based on PSO with selective particle regeneration （SRPSO）. Once modified PSO is applied to the mathematical model, the simulation results show that the mathematical model is correct, and aerodynamic parameters and coefficients of the propeller can be identified accurately. Results are compared with those of PSO and SRPSO and the comparison shows that the proposed method is more robust and faster than the other methods for the longitudinal parameter identification of the small UAV. Some parameter identification results are affected slightly by noise, but the identification results are very good overall. Eventually, experimental validation is employed to test the proposed method, which demonstrates the usefulness of this method.

基于自适应模拟退火优化算法的集合式电容器局放定位研究

集合式电容器内部局部放电问题可能导致绝缘介质破坏和设备故障。已有的局部放电检测技术在集合式电容器中受到电磁干扰的限制。为此,提出了一种自适应模拟退火粒子群超声定位方法。该方法结合超声检测法克服电磁干扰对定位精度的影响,通过对粒子群参数进行自适应优化,并应用模拟退火和轮盘赌策略进行优化。为检测该方法的效果,通过对比实验表明,该方法提高了定位的准确性和稳定性,为集合式电容器局部放电定位问题提供了有效的解决方案。

基于CPSO-Elman神经网络矿井下可见光定位

针对传统矿井下定位方法精度偏低问题,提出一种混沌粒子群优化(CPSO)Elman神经网络矿井下可见光定位系统。由于Elman神经网络在初始化时存在参数设置的随机性导致预测精度不高,采用CPSO算法优化Elman神经网络,选取适合的各层的初始权值和阈值,用于提高神经网络拓扑的稳定性。仿真结果表明:在3.6 m×3.6 m×3.6 m的环境里,本文所提的算法的平均定位误差达到3.70 cm,最大定位误差为26.54 cm,在实验阶段的平均定位误差为5.91 cm,最大定位误差为36.95 cm,能够满足煤矿井下定位需求。

A PSO microseismic localization method based on group waves' time difference information

Aiming at the lower microseismic localization accuracy in underground shallow distributed burst point localization based on time difference of arriva（TDOA）,this paper presents a method for microseismic localization based on group waves’ time difference information Firstly, extract the time difference corresponding to direct P wavers dominant frequency by utilizing its propagation characteristics. Secondly, construct TDOA model with non-prediction velocity and identify objective function of particle swarm optimization （PSO）. Afterwards, construct the initial particle swarm by using time difference information Finally, search the localization results in optimal solution space. The results of experimental verification show that the microseismic localization method proposed in this paper effectively enhances the localization accuracy of microseismic explosion source with positioning error less than 50 cm, which can satisfy the localization requirements of shallow burst point and has definite value for engineering application in underground space positioning field.

基于优化领先狼群算法的微震源定位研究

为分析不同启发式方法对求解微震源定位精度问题的影响,提出一种优化领先狼群算法。该算法在领先狼群算法的基础上,调整搜索步长和围攻步长两个参数,提高了在搜索过程中跳出局部最优解的能力。通过理论模型反演和工程数据分析,验证了优化领先狼群算法的有效性。与常用的粒子群算法和模拟退火算法两种启发式算法相比,优化领先狼群算法收敛更快,精度更高,受P波波速误差影响更小。该算法为智能启发式算法应用于微震源定位提供了新思路。

融合爬山策略的改进粒子群混合路径规划算法

为了提高路径规划寻优能力,提出了一种混合路径规划算法。首先采用改进粒子群(PSO)算法搜寻路径,然后利用爬山算法在上一步的基础上精细化寻优。在粒子群算法中采用Tent混沌映射来初始化粒子种群,惯性权重采用随机更新策略、学习因子采用异步动态调整,在改进粒子群算法搜索结束后,采用爬山算法进一步寻优。通过4种不同复杂程度的地形场景下的仿真对比实验,验证了所提算法的可行性与有效性,所提算法将全局搜索与局部搜索相结合,提高了算法的整体搜索性能。

面向TDOA定位的分布式雷达部署策略优化方法研究

针对到达时间差被动定位任务,研究了分布式雷达的部署策略优化问题,以提升系统的定位和监视性能。现有研究大多仅关注节点位置的优化,而未充分考虑节点法线指向与系统监视性能间的耦合关系。文中结合实际应用场景,考虑了节点位置与法线指向的联合优化策略,构建了面向定位任务的单目标优化问题以及兼顾定位和监视任务的多目标优化问题。由于这些优化问题具有复杂耦合约束和非凸特性,解析解难以获得。文中提出一种区域约束多目标粒子群算法(RC-MOPSO),用以求解最优部署策略。该算法通过在粒子初始化和更新过程中引入约束区域,确保粒子在迭代过程中始终满足复杂耦合约束条件。仿真结果表明,所提方案实现了定位和监视性能的最优平衡,相较于随机部署方案表现出显著优势,同时对辐射源发射功率估计误差表现出较强的鲁棒性。