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.

A novel particle swarm optimizer without velocity:Simplex-PSO

A simplex particle swarm optimization(simplex-PSO) derived from the Nelder-Mead simplex method was proposed to optimize the high dimensionality functions.In simplex-PSO,the velocity term was abandoned and its reference objectives were the best particle and the centroid of all particles except the best particle.The convergence theorems of linear time-varying discrete system proved that simplex-PSO is of consistent asymptotic convergence.In order to reduce the probability of trapping into a local optimal value,an extremum mutation was introduced into simplex-PSO and simplex-PSO-t(simplex-PSO with turbulence) was devised.Several experiments were carried out to verify the validity of simplex-PSO and simplex-PSO-t,and the experimental results confirmed the conclusions:(1) simplex-PSO-t can optimize high-dimension functions with 200-dimensionality;(2) compared PSO with chaos PSO(CPSO),the best optimum index increases by a factor of 1×102-1×104.

Energy transmission modes based on Tabu search and particle swarm hybrid optimization algorithm

In China, economic centers are far from energy storage bases, so it is significant to select a proper energy transferring mode to improve the efficiency of energy usage. To solve this problem, an optimal allocation model based on energy transfer mode was proposed after objective function for optimizing energy using efficiency was established, and then, a new Tabu search and particle swarm hybrid optimizing algorithm was proposed to find solutions. While actual data of energy demand and distribution in China were selected for analysis, the economic critical value in comparison between the long-distance coal transfer and electric power transmission was gained. Based on the above discussion, some proposals were put forward for optimal allocation of energy transfer modes in China. By comparing other three traditional methods that are based on regional price differences, freight rates and annual cost with the proposed method, the result indicates that the economic efficiency of the energy transfer can be enhanced by 3.14%, 5.78% and 6.01%, respectively.

Improved particle swarm optimization based on particles' explorative capability enhancement

Accelerating the convergence speed and avoiding the local optimal solution are two main goals of particle swarm optimization（PSO）. The very basic PSO model and some variants of PSO do not consider the enhancement of the explorative capability of each particle. Thus these methods have a slow convergence speed and may trap into a local optimal solution. To enhance the explorative capability of particles, a scheme called explorative capability enhancement in PSO（ECE-PSO） is proposed by introducing some virtual particles in random directions with random amplitude. The linearly decreasing method related to the maximum iteration and the nonlinearly decreasing method related to the fitness value of the globally best particle are employed to produce virtual particles. The above two methods are thoroughly compared with four representative advanced PSO variants on eight unimodal and multimodal benchmark problems. Experimental results indicate that the convergence speed and solution quality of ECE-PSO outperform the state-of-the-art PSO variants.

Integration of uniform design and quantum-behaved particle swarm optimization to the robust design for a railway vehicle suspension system under different wheel conicities and wheel rolling radii

This paper proposes a systematic method, integrating the uniform design (UD) of experiments and quantum-behaved particle swarm optimization (QPSO), to solve the problem of a robust design for a railway vehicle suspension system. Based on the new nonlinear creep model derived from combining Hertz contact theory, Kalker's linear theory and a heuristic nonlinear creep model, the modeling and dynamic analysis of a 24 degree-of-freedom railway vehicle system were investigated. The Lyapunov indirect method was used to examine the effects of suspension parameters, wheel conicities and wheel rolling radii on critical hunting speeds. Generally, the critical hunting speeds of a vehicle system resulting from worn wheels with different wheel rolling radii are lower than those of a vehicle system having original wheels without different wheel rolling radii. Because of worn wheels, the critical hunting speed of a running railway vehicle substantially declines over the long term. For safety reasons, it is necessary to design the suspension system parameters to increase the robustness of the system and decrease the sensitive of wheel noises. By applying UD and QPSO, the nominal-the-best signal-to-noise ratio of the system was increased from -48.17 to -34.05 dB. The rate of improvement was 29.31%. This study has demonstrated that the integration of UD and QPSO can successfully reveal the optimal solution of suspension parameters for solving the robust design problem of a railway vehicle suspension system.

Integrating Tabu Search in Particle Swarm Optimization for the Frequency Assignment Problem

In this paper, we address one of the issues in the frequency assignment problem for cellular mobile networks in which we intend to minimize the interference levels when assigning frequencies from a limited frequency spectrum. In order to satisfy the increasing demand in such cellular mobile networks, we use a hybrid approach consisting of a Particle Swarm Optimization(PSO) combined with a Tabu Search(TS) algorithm. This approach takes both advantages of PSO efficiency in global optimization and TS in avoiding the premature convergence that would lead PSO to stagnate in a local minimum. Moreover, we propose a new efficient, simple, and inexpensive model for storing and evaluating solution's assignment. The purpose of this model reduces the solution's storage volume as well as the computations required to evaluate thesesolutions in comparison with the classical model. Our simulation results on the most known benchmarking instances prove the effectiveness of our proposed algorithm in comparison with previous related works in terms of convergence rate, the number of iterations, the solution storage volume and the running time required to converge to the optimal solution.

A New Class of Hybrid Particle Swarm Optimization Algorithm

A new class of hybrid particle swarm optimization （PSO） algorithm is developed for solving the premature convergence caused by some particles in standard PSO fall into stagnation. In this algorithm, the linearly decreasing inertia weight technique （LDIW） and the mutative scale chaos optimization algorithm （MSCOA） are combined with standard PSO, which are used to balance the global and local exploration abilities and enhance the local searching abilities, respectively. In order to evaluate the performance of the new method, three benchmark functions are used. The simulation results confirm the proposed algorithm can greatly enhance the searching ability and effectively improve the premature convergence.

Drilling Path Optimization Based on Particle Swarm Optimization Algorithm

This paper presents a new approach based on the particle swarm optimization (PSO) algorithm for solving the drilling path optimization problem belonging to discrete space.Because the standard PSO algorithm is not guaranteed to be global convergence or local convergence,based on the mathematical algorithm model,the algorithm is improved by adopting the method of generate the stop evolution particle over again to get the ability of convergence to the global optimization solution.And the operators are improved by establishing the duality transposition method and the handle manner for the elements of the operator,the improved operator can satisfy the need of integer coding in drilling path optimization.The experiment with small node numbers indicates that the improved algorithm has the characteristics of easy realize,fast convergence speed,and better global convergence characteris- tics.hence the new PSO can play a role in solving the problem of drilling path optimization in drilling holes.

Stability,Convergence of Harmonious Particle Swarm Optimizer and Its Application

Particle swarm optimizer （PSO）, a new evolutionary computation algorithm, exhibits good performance for optimization problems, although PSO can not guarantee convergence of a global minimum, even a local minimum. However, there are some adjustable parameters and restrictive conditions which can affect performance of the algorithm. The sufficient conditions for asymptotic stability of an acceleration factor and inertia weight are deduced in this paper. The value of the inertia weight w is enhanced to （ - 1, 1）. Furthermore a new adaptive PSO algorithm--harmonious PSO （HPSO） is proposed and proved that HPSO is a global search algorithm. Finally it is focused on a design task of a servo system controller. Considering the existence of model uncertainty and noise from sensors, HPSO are applied to optimize the parameters of fuzzy PID controller. The experiment results demonstrate the efficiency of the methods.

A Novel Quantum-Behaved Particle Swarm Optimization Algorithm

The efficient management of ambulance routing for emergency requests is vital to save lives when a disaster occurs.Quantum-behaved Particle Swarm Optimization(QPSO)algorithm is a kind of metaheuristic algorithms applied to deal with the problem of scheduling.This paper analyzed the motion pattern of particles in a square potential well,given the position equation of the particles by solving the Schrödinger equation and proposed the Binary Correlation QPSO Algorithm Based on Square Potential Well(BC-QSPSO).In this novel algorithm,the intrinsic cognitive link between particles’experience information and group sharing information was created by using normal Copula function.After that,the control parameters chosen strategy gives through experiments.Finally,the simulation results of the test functions show that the improved algorithms outperform the original QPSO algorithm and due to the error gradient information will not be over utilized in square potential well,the particles are easy to jump out of the local optimum,the BC-QSPSO is more suitable to solve the functions with correlative variables.

Acceleration Factor Harmonious Particle Swarm Optimizer

A Particle Swarm Optimizer （PSO） exhibits good performance for optimization problems, although it cannot guarantee convergence to a global, or even local minimum. However, there are some adjustable parameters, and restrictive conditions, which can affect the performance of the algorithm. In this paper, the sufficient conditions for the asymptotic stability of an acceleration factor and inertia weight are deduced, the value of the inertia weight w is enhanced to （ 1, 1）. Furthermore a new adaptive PSO algorithm - Acceleration Factor Harmonious PSO （AFHPSO） is proposed, and is proved to be a global search algorithm. AFHPSO is used for the parameter design of a fuzzy controller for a linear motor driving servo system. The performance of the nonlinear model for the servo system demonstrates the effectiveness of the optimized fuzzy controller and AFHPSO.

Optimization on the Impeller of a Low-specific-speed Centrifugal Pump for Hydraulic Performance Improvement

In order to widen the high-efficiency operating range of a low-specific-speed centrifugal pump, an optimization process for considering efficiencies under 1.0Qd and 1.4Qd is proposed. Three parameters, namely, the blade outlet width b2, blade outlet angle β2, and blade wrap angle φ, are selected as design variables. Impellers are generated using the optimal Latin hypercube sampling method. The pump efficiencies are calculated using the software CFX 14.5 at two operating points selected as objectives. Surrogate models are also constructed to analyze the relationship between the objectives and the design variables. Finally, the particle swarm optimization algorithm is applied to calculate the surrogate model to determine the best combination of the impeller parameters. The results show that the performance curve predicted by numerical simulation has a good agreement with the experimental results. Compared with the efficiencies of the original impeller, the hydraulic efficiencies of the optimized impeller are increased by 4.18% and 0.62% under 1.0Qd and 1.4Qd, respectively. The comparison of inner flow between the original pump and optimized one illustrates the improvement of performance. The optimization process can provide a useful reference on performance improvement of other pumps, even on reduction of pressure fluctuations.

Common model analysis and improvement of particle swarm optimizer

Particle swarm optimizer （PSO）, a new evolutionary computation algorithm, exhibits good performance for optimization problems, although PSO can not guarantee convergence of a global minimum, even a local minimum. However, there are some adjustable parameters and restrictive conditions which can affect performance of the algorithm. In this paper, the algorithm are analyzed as a time-varying dynamic system, and the sufficient conditions for asymptotic stability of acceleration factors, increment of acceleration factors and inertia weight are deduced. The value of the inertia weight is enhanced to （-1, 1）. Based on the deduced principle of acceleration factors, a new adaptive PSO algorithm- harmonious PSO （HPSO） is proposed. Furthermore it is proved that HPSO is a global search algorithm. In the experiments, HPSO are used to the model identification of a linear motor driving servo system. An Akaike information criteria based fitness function is designed and the algorithms can not only estimate the parameters, but also determine the order of the model simultaneously. The results demonstrate the effectiveness of HPSO.

Multilayered feed forward neural network based on particle swarmopti mizer algorithm

BP is a commonly used neural network training method, which has some disadvantages, such as local minima, sensitivity of initial value of weights, total dependence on gradient information. This paper presents some methods to train a neural network, including standard particle swarm optimizer （PSO）, guaranteed convergence particle swarm optimizer （GCPSO）, an improved PSO algorithm, and GCPSO-BP, an algorithm combined GCPSO with BP. The simulation results demonstrate the effectiveness of the three algorithms for neural network training.

Wind Turbine Efficiency Under Altitude Consideration Using an Improved Particle Swarm Framework

In this work,the concepts of particle swarm optimization-based method,named non-Gaussian improved particle swarm optimization for minimizing the cost of energy(COE)of wind turbines(WTs)on high-altitude sites are introduced.Since the COE depends on site specification constants and initialized parameters of wind turbine,the focus was on the design optimization of rotor radius,hub height and rated power.Based on literature,the COE is converted to the Saudi Arabia context.Thus,the constrained wind turbine optimization problem is developed.Then,non-Gaussian improved particle swarm optimization is provided and compared with the conventional particle swarm optimization for solving the optimization design in wind turbine efficiency under different altitudes ranging from 2500 to 4000 m.The results show that as altitude rises,the optimal rotor radius grows,but the optimal hub height and rated power drop,resulting in an increase in COE.Further,the non-Gaussian method display a faster convergence compared to the classical particle swarm optimization.These findings will be useful as a reference for wind turbine design at high altitudes.Thus,it could be employed to optimize the initialized parameter of wind turbine for the planned and largest wind farm in Saudi Arabia in Dumat Al-Jandal selected site.

Performance Analysis of Optimization Based FOC and DTC Methods for Three Phase Induction Motor

Three-phase induction motors are becoming increasingly utilized in industrialfield due to their better efficiency and simple manufacture.The speed control of an induction motor is essential in a variety of applications,but it is dif-ficult to control.This research analyses the three-phase induction motor’s perfor-mance usingfield-oriented control(FOC)and direct torque control(DTC)techniques.The major aim of this work is to provide a critical evaluation of devel-oping a simple speed controller for induction motors with improving the perfor-mance of Induction Motor(IM).For controlling a motor,different optimization approaches are accessible;in this research,a Fuzzy Logic Controller(FLC)with Fractional Order Darwinian Particle Swarm Optimization(FODPSO)algorithm is presented to control the induction motor.The FOC and DTC are controlled using FODPSO,and their performance is compared to the traditional FOC and DTC technique.Each scheme had its own simulation model,and the results were com-pared using hardware experimental and MATLAB-Simulink.In terms of time domain specifications and torque improvement,the proposed technique surpasses the existing method.

An Adaptive Fruit Fly Optimization Algorithm for Optimization Problems

In this paper, we present a new fruit fly optimization algorithm with the adaptive step for solving unconstrained optimization problems, which is able to avoid the slow convergence and the tendency to fall into local optimum of the standard fruit fly optimization algorithm. By using the information of the iteration number and the maximum iteration number, the proposed algorithm uses the floor function to ensure that the fruit fly swarms adopt the large step search during the olfactory search stage which improves the search speed;in the visual search stage, the small step is used to effectively avoid local optimum. Finally, using commonly used benchmark testing functions, the proposed algorithm is compared with the standard fruit fly optimization algorithm with some fixed steps. The simulation experiment results show that the proposed algorithm can quickly approach the optimal solution in the olfactory search stage and accurately search in the visual search stage, demonstrating more effective performance.

基于改进T分布烟花-粒子群算法的AUV全局路径规划

针对传统粒子群算法在处理自主水下机器人(Autonomous Underwater Vehicle,AUV)全局路径规划时面临的寻优时间长、能耗高的问题,本文提出一种改进的T分布烟花-粒子群算法(T-distribution Fireworks-Particle Swarm Optimization Algorithm,TFWA-PSO),该算法融合了烟花算法的高效全局搜索能力和粒子群算法的快速局部寻优特性.在变异阶段,提出自适应T分布变异来扩大搜索范围,并在理论上证明了该变异方式能够使个体在局部最优解附近增强搜索能力.在选择阶段提出了适应度选择策略,淘汰适应度差的个体,解决了传统烟花算法易丢失优秀个体的问题,并对改进的T分布烟花算法与传统烟花算法的收敛速度进行对比.将改进算法的爆炸操作、变异操作和选择策略融合到粒子群算法中,对粒子群算法的速度更新公式进行了改进,同时从理论上对所改进的算法进行了收敛性证明.仿真实验结果表明,TFWA-PSO能够有效规划出一条最短路径,同时与给定的智能优化算法相比,TFWA-PSO在寻找最优路径的时间上平均降低了24.72%,能耗平均降低了17.33%,路径长度平均降低了16.96%.

基于粒子群算法的电机控制策略研究

针对电机速度控制存在的响应慢、精度差等问题,采用PSO优化PID控制器参数实现对无刷直流电机的速度控制。构建了直流电机的数学模型与控制模型,在此基础上提出了PSO优化PID参数的流程。在MATLAB/Simulink平台下搭建无刷直流电机控制系统仿真模型,对比传统PID控制、GA优化PID参数控制、PSO优化PID参数控制3种电机控制策略在电机空载工况、转速发生阶跃变化工况、电机负载发生阶跃工况下的仿真结果。结果表明,PSO优化PID参数控制相对于其它两种控制策略,其转速响应速度快、抗负载干扰能力强。

基于模型预测控制的静液压变速器转速控制研究

为提高静液压变速器(HST)控制系统的自适应性和鲁棒性,结合模型预测控制(MPC)与粒子群优化(PSO)算法对HST转速控制性能进行仿真和实验研究.首先,基于状态扩展空间方程建立HST的预测模型,引入PSO确定MPC的最佳超参数,获得综合性能指标最佳的模型预测控制器模型.然后,对HST进行阶跃响应与加减速控制仿真,同时搭建静液压传动实验平台对模型预测控制HST的可行性进行验证.结果表明:在阶跃响应和期望转速突变条件下,模型预测控制HST的输出转速均在较短时间内稳定在期望转速附近,且超调量最大不超过5%,具有较好的静态特性.期望转速突变时,MPC亦能快速准确地调控变量泵的排量,使马达转速迅速达到新的稳定状态,且调控过程的转速波动较小.所得实验结果与仿真结果一致,表明MPC在HST转速控制方面具有可行性.最后,针对更为复杂的工况(变化的输入功率、多变的期望转速以及突变的外部负载),采用仿真手段研究了MPC对HST的转速控制性能.结果表明:在复杂工况下,MPC亦能使HST具有较好的静动态特性,其转速波动得到有效降低,马达输出转速能稳定在期望值附近.