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.

Particle Swarm Optimization for Solving Sine-Gordan Equation

The term‘optimization’refers to the process of maximizing the beneficial attributes of a mathematical function or system while minimizing the unfavorable ones.The majority of real-world situations can be modelled as an optimization problem.The complex nature of models restricts traditional optimization techniques to obtain a global optimal solution and paves the path for global optimization methods.Particle Swarm Optimization is a potential global optimization technique that has been widely used to address problems in a variety of fields.The idea of this research is to use exponential basis functions and the particle swarm optimization technique to find a numerical solution for the Sine-Gordan equation,whose numerical solutions show the soliton form and has diverse applications.The implemented optimization technique is employed to determine the involved parameter in the basis functions,which was previously approximated as a random number in the work reported till now in the literature.The obtained results are comparable with the results obtained in the literature.The work is presented in the form of figures and tables and is found encouraging.

Optimal Static State Estimation Using hybrid Particle Swarm-Differential Evolution Based Optimization

In this paper, swarm optimization hybridized with differential evolution (PSO-DE) technique is proposed to solve static state estimation (SE) problem as a minimization problem. The proposed hybrid method is tested on IEEE 5-bus, 14-bus, 30-bus, 57-bus and 118-bus standard test systems along with 11-bus and 13-bus ill-conditioned test systems under different simulated conditions and the results are compared with the same, obtained using standard weighted least square state estimation (WLS-SE) technique and general particle swarm optimization (GPSO) based technique. The performance of the proposed optimization technique for SE, in terms of minimum value of the objective function and standard deviations of minimum values obtained in 100 runs, is found better as compared to the GPSO based technique. The statistical error analysis also shows the superiority of the proposed PSO-DE based technique over the other two techniques.

A Hybrid Differential Evolution Algorithm Integrated with Particle Swarm Optimization

To implement self-adaptive control parameters, a hybrid differential evolution algorithm integrated with particle swarm optimization （PSODE） is proposed. In the PSODE, control parameters are encoded to be a symbiotic individual of original individual, and each original individual has its own symbiotic individual. Differential evolution （ DE） operators are used to evolve the original population. And, particle swarm optimization （PSO） is applied to co-evolving the symbiotic population. Thus, with the evolution of the original population in PSODE, the symbiotic population is dynamically and self-adaptively adjusted and the realtime optimum control parameters are obtained. The proposed algorithm is compared with some DE variants on nine functious. The results show that the average performance of PSODE is the best.

Multi-objective particle swarm optimization by fusing multiple strategies

To improve the convergence and distributivity of multi-objective particle swarm optimization,we propose a method for multi-objective particle swarm optimization by fusing multiple strategies(MOPSO-MS),which includes three strategies.Firstly,the average crowding distance method is proposed,which takes into account the influence of individuals on the crowding distance and reduces the algorithm’s time complexity and computational cost,ensuring efficient external archive maintenance and improving the algorithm’s distribution.Secondly,the algorithm utilizes particle difference to guide adaptive inertia weights.In this way,the degree of disparity between a particle’s historical optimum and the population’s global optimum is used to determine the value of w.With different degrees of disparity,the size of w is adjusted nonlinearly,improving the algorithm’s convergence.Finally,the algorithm is designed to control the search direction by hierarchically selecting the globally optimal policy,which can avoid a single search direction and eliminate the lack of a random search direction,making the selection of the global optimal position more objective and comprehensive,and further improving the convergence of the algorithm.The MOPSO-MS is tested against seven other algorithms on the ZDT and DTLZ test functions,and the results show that the MOPSO-MS has significant advantages in terms of convergence and distributivity.

Hybrid Global Optimization Algorithm for Feature Selection

This paper proposes Parallelized Linear Time-Variant Acceleration Coefficients and Inertial Weight of Particle Swarm Optimization algorithm(PLTVACIW-PSO).Its designed has introduced the benefits of Parallel computing into the combined power of TVAC(Time-Variant Acceleration Coefficients)and IW(Inertial Weight).Proposed algorithm has been tested against linear,non-linear,traditional,andmultiswarmbased optimization algorithms.An experimental study is performed in two stages to assess the proposed PLTVACIW-PSO.Phase I uses 12 recognized Standard Benchmarks methods to evaluate the comparative performance of the proposed PLTVACIWPSO vs.IW based Particle Swarm Optimization(PSO)algorithms,TVAC based PSO algorithms,traditional PSO,Genetic algorithms(GA),Differential evolution(DE),and,finally,Flower Pollination(FP)algorithms.In phase II,the proposed PLTVACIW-PSO uses the same 12 known Benchmark functions to test its performance against the BAT(BA)and Multi-Swarm BAT algorithms.In phase III,the proposed PLTVACIW-PSO is employed to augment the feature selection problem formedical datasets.This experimental study shows that the planned PLTVACIW-PSO outpaces the performances of other comparable algorithms.Outcomes from the experiments shows that the PLTVACIW-PSO is capable of outlining a feature subset that is capable of enhancing the classification efficiency and gives the minimal subset of the core features.

Hybrid Particle Swarm Optimization with Differential Evolution for Numerical and Engineering Optimization

In this paper, a hybrid particle swarm optimization （PSO） algorithm with differential evolution （DE） is proposed for numerical benchmark problems and optimization of active disturbance rejection controller （ADRC） parameters. A chaotic map with greater Lyapunov exponent is introduced into PSO for balancing the exploration and exploitation abilities of the proposed algorithm. A DE operator is used to help PSO jump out of stagnation. Twelve benchmark function tests from CEC2005 and eight real world opti- mization problems from CEC2011 are used to evaluate the performance of the proposed algorithm. The results show that statistically, the proposed hybrid algorithm has performed consistently well compared to other hybrid variants. Moreover, the simulation results on ADRC parameter optimization show that the optimized ADRC has better robustness and adaptability for nonlinear discrete-time systems with time delays.

PID Neural Net work Decoupling Control Based on Hybrid Particle Swarm Optimization and Differential Evolution

For complex systems with high nonlinearity and strong coupling,the decoupling control technology based on proportion integration differentiation(PID)neural network(PIDNN)is used to eliminate the coupling between loops.The connection weights of the PIDNN are easy to fall into local optimum due to the use of the gradient descent learning method.In order to solve this problem,a hybrid particle swarm optimization(PSO)and differential evolution(DE)algorithm(PSO-DE)is proposed for optimizing the connection weights of the PIDNN.The DE algorithm is employed as an acceleration operation to help the swarm to get out of local optima traps in case that the optimal result has not been improved after several iterations.Two multivariable controlled plants with strong coupling between input and output pairs are employed to demonstrate the effectiveness of the proposed method.Simulation results show t hat the proposed met hod has better decoupling capabilities and control quality than the previous approaches.

Statistical learning makes the hybridization of particle swarm and differential evolution more efficient-A novel hybrid optimizer

This brief paper reports a hybrid algorithm we developed recently to solve the global optimization problems of multimodal functions, by combining the advantages of two powerful population-based metaheuristics differential evolution （DE） and particle swarm optimization （PSO）. In the hybrid denoted by DEPSO, each individual in one generation chooses its evolution method, DE or PSO, in a statistical learning way. The choice depends on the relative success ratio of the two methods in a previous learning period. The proposed DEPSO is compared with its PSO and DE parents, two advanced DE variants one of which is suggested by the originators of DE, two advanced PSO variants one of which is acknowledged as a recent standard by PSO community, and also a previous DEPSO. Benchmark tests demonstrate that the DEPSO is more competent for the global optimization of multimodal functions due to its high optimization quality.

Supply Chain Production-distribution Cost Optimization under Grey Fuzzy Uncertainty

Most supply chain programming problems are restricted to the deterministic situations or stochastic environmcnts. Considering twofold uncertainty combining grey and fuzzy factors, this paper proposes a hybrid uncertain programming model to optimize the supply chain production-distribution cost. The programming parameters of the material suppliers, manufacturer, distribution centers, and the customers are integrated into the presented model. On the basis of the chance measure and the credibility of grey fuzzy variable, the grey fuzzy simulation methodology was proposed to generate input-output data for the uncertain functions. The designed neural network can expedite the simulation process after trained from the generated input-output data. The improved Particle Swarm Optimization （PSO） algorithm based on the Differential Evolution （DE） algorithm can optimize the uncertain programming problems. A numerical example was presented to highlight the significance of the uncertain model and the feasibility of the solution strategy.

A Perspective of Conventional and Bio-inspired Optimization Techniques in Maximum Likelihood Parameter Estimation

Maximum likelihood estimation is a method of estimating the parameters of a statistical model in statistics. It has been widely used in a good many multi-disciplines such as econometrics, data modelling in nuclear and particle physics, and geographical satellite image classification, and so forth. Over the past decade, although many conventional numerical approximation approaches have been most successfully developed to solve the problems of maximum likelihood parameter estimation, bio-inspired optimization techniques have shown promising performance and gained an incredible recognition as an attractive solution to such problems. This review paper attempts to offer a comprehensive perspective of conventional and bio-inspired optimization techniques in maximum likelihood parameter estimation so as to highlight the challenges and key issues and encourage the researches for further progress.

Performance Evaluation and Comparison of Multi - Objective Optimization Algorithms for the Analytical Design of Switched Reluctance Machines

This paper systematically evaluates and compares three well-engineered and popular multi-objective optimization algorithms for the design of switched reluctance machines.The multi-physics and multi-objective nature of electric machine design problems are discussed,followed by benchmark studies comparing generic algorithms(GA),differential evolution(DE)algorithms and particle swarm optimizations(PSO)on a 6/4 switched reluctance machine design with seven independent variables and a strong nonlinear multi-objective Pareto front.To better quantify the quality of the Pareto fronts,five primary quality indicators are employed to serve as the algorithm testing metrics.The results show that the three algorithms have similar performances when the optimization employs only a small number of candidate designs or ultimately,a significant amount of candidate designs.However,DE tends to perform better in terms of convergence speed and the quality of Pareto front when a relatively modest amount of candidates are considered.

电推进GEO卫星的改进粒子群轨道保持优化设计

针对地球同步轨道(GEO)卫星轨道保持问题,提出了一种基于改进粒子群算法(PSO)的序列电推力轨道保持方法。首先,建立了GEO卫星高精度非线性轨道动力学模型和序列电推力模型。然后,设计了GEO卫星相对轨道保持策略,建立了以燃料消耗为性能指标的序列电推力轨道保持问题优化模型并进行了离散化。接着,通过引入差分进化算法和维度学习策略对粒子群优化算法进行了适应性改进,同时对推力大小和作用时间进行寻优计算。最后,通过数值仿真对所提出的改进粒子群优化算法进行了对比校验。结果表明,该方法在完成GEO卫星轨道保持任务的同时具备燃料消耗低和收敛速度快等优点。

一种双L型梁电容式六维力传感器设计

为设计一款高性能电容式六维力传感器,结合T型梁和十字型双直梁的优点,构建了一种双L型结构弹性梁,传感器转换元件采用差动结构平行极板电容器以降低传感器的测量误差,以转换矩阵的条件数为目标函数,应用粒子群算法与有限元仿真相结合的方法对该传感器的结构参数进行优化设计,得到最优结构参数后进行仿真,结果显示该构型的电容式六维力传感器仿真精度为0.4258%。最后对该传感器进行加工与标定实验,结果显示该传感器的实验精度达到0.6376%。

基于逃逸角的多ASV微分博弈协同围捕方法

针对多个自主水面航行器(ASV)围捕单个主动逃逸的对抗性目标问题,利用微分博弈理论建立了多ASV协同围捕问题博弈模型,在含有距离项的支付函数中引入由逃逸角构成的合围项,从而降低目标中途逃逸的概率;然后将围捕问题转换为求解可实现策略的优化问题,利用粒子群优化(PSO)算法求解满足纳什均衡的最优策略,仿真和湖上试验结果均证明了基于PSO的微分博弈围捕算法的有效性。

混合差分和多种群粒子群算法的T-S模糊模型辨识

为提高T-S模型的辨识精度,针对基本粒子群优化(particle swarm optimization,PSO)算法T-S模型全局优化辨识问题,提出混合差分和多种群粒子群算法的T-S模糊模型辨识方法,将T-S模型前件参数和后件参数整体编码进行全局优化辨识.为避免基本粒子群的早熟收敛和后期收敛速度慢的缺陷对T-S模型辨识精度和速度的影响,算法将种群分为若干个子群,每个子群根据粒子适应度值自适应调整惯性权重,平衡了算法的开发和探索能力,对子群最优粒子,进行差分操作以增强算法的全局搜索能力,采用全局最优粒子替代随机子群的最优粒子以加强子群间的信息交流,维持粒子多样性.典型非线性系统和混沌系统的仿真结果表明,采用混合差分和多种群粒子群算法辨识的T-S模型具有更高的辨识精度.

基于差分进化粒子群混合算法的多无人机协同区域搜索策略

为提高无人机群在未知环境中的区域搜索效率,提出一种多无人机协同区域搜索策略。首先,根据区域搜索任务需求,建立包含区域覆盖率、区域不确定度、目标存在概率三种属性的区域信息地图;其次,以最大化搜索效率、同时最小化无人机搜索过程中的能耗为目标,建立无人机区域搜索滚动时域优化目标函数,指导无人机在线决策搜索路线;然后针对传统群智能优化算法易陷入局部最优的缺陷,设计差分进化粒子群混合算法在线求解该多目标优化问题,提高算法的寻优性能,从而提高无人机的搜索效率。最后,通过数值仿真实验,对所提算法进行验证,仿真结果表明,文中设计的基于差分进化粒子群混合算法的多无人机协同区域搜索策略与传统的群智能优化算法相比具有更高的区域搜索效率。

多阶段多属性配电网规划项目优选模型及求解

目前配电网规划项目优选方法很少考虑负荷增长速度快慢对项目供电效益和项目入选年的影响,也很少同时考虑项目的紧急程度、技术效益和经济效益,为此建立以技术效益和经济效益最大为目标的中低压配电网规划项目优选模型。根据项目的紧急程度对项目技术效益进行奖优罚劣,为衡量项目供电效益的逐年变化速度,采用差异化权重法得到项目投产后5a的供电效益综合水平。提出改进的多目标粒子群算法求解模型,得到一系列目标互有优势的项目组合方案,根据供电企业的目标偏好对项目组合方案集进行多级筛选,得到最优项目组合方案。以某地区配电网规划项目库为例,优选结果表明所提模型能更好地考虑项目的紧急程度和供电效益变化速度,并实现多区域多目标综合提升。

融合差分进化和Sine混沌的改进粒子群算法

将差分进化与Sine混沌相结合,提出一种改进的粒子群算法。利用Sine混沌映射对初始种群进行优化,提高了收敛速度;该算法通过引入非同步变化的学习因子的速度更新公式,引入随机惯性权重,使算法能够更好地兼顾全局搜索与局部优化;借鉴差分进化算法中的交叉操作,采用淘汰机制随机搜索策略,提高算法的全局搜索能力,提高算法收敛速度。为了验证融合差分进化和Sine混沌的改进粒子群算法(improved particle swarm optimization algorithm,IPSO)的性能,与基于压缩学习因子的粒子群算法(yield-based particle swarm optimization,YPSO)、自适应加权粒子群算法(self-adaptive particle swarm optimization,SPSO)等PSO相关算法以及蜘蛛蜂优化算法(spider wasp optimization,SWO)、能量谷算法(energy valley algorithm,EVA)等2023年最新算法相比较,验证融合差分进化和Sine混沌的改进粒子群算法(IPSO)的有效性。在不同维度下解决12个常用基准函数,对12个测试函数进行实验,并与其他的几种算法进行比较,实验结果表明,改进后的PSO算法收敛速度快,收敛精度高。

改进教与学算法的静压推力滑动轴承优化

为了使静压推力滑动轴承在运行过程中功率损失最小,提出了改进的教与学算法(DWTLBO),对静压推力滑动轴承进行优化设计。与其它经典的智能优化算法如粒子群算法(PSO)、差分进化算法(DE)和教与学算法(TLBO)相比,该算法在学习阶段引入差分进化算子增加了各组之间的交叉率,进一步提高算法的多样性和局部搜索能力,避免早熟收敛。通过建立推力轴承模型,设计了轴承阶梯半径,油槽凹口半径,润滑油粘度,润滑油流量四个设计变量,采用改进的教与学算法对模型的相关参数进行优化。优化结果表明,提出的改进算法与传统的教与学算法相比,获得模型的最优解更佳,有利于在以后的工程优化中提高模型的设计精度。