Multi-Strategy-Driven Salp Swarm Algorithm for Global Optimization

In response to the shortcomings of the Salp Swarm Algorithm (SSA) such as low convergence accuracy and slow convergence speed, a Multi-Strategy-Driven Salp Swarm Algorithm (MSD-SSA) was proposed. First, food sources or random leaders were associated with the current bottle sea squirt at the beginning of the iteration, to which Levy flight random walk and crossover operators with small probability were added to improve the global search and ability to jump out of local optimum. Secondly, the position mean of the leader was used to establish a link with the followers, which effectively avoided the blind following of the followers and greatly improved the convergence speed of the algorithm. Finally, Brownian motion stochastic steps were introduced to improve the convergence accuracy of populations near food sources. The improved method switched under changes in the adaptive parameters, balancing the exploration and development of SSA. In the simulation experiments, the performance of the algorithm was examined using SSA and MSD-SSA on the commonly used CEC benchmark test functions and CEC2017-constrained optimization problems, and the effectiveness of MSD-SSA was verified by solving three real engineering problems. The results showed that MSD-SSA improved the convergence speed and convergence accuracy of the algorithm, and achieved good results in practical engineering problems.

Multi-objective reservoir operation using particle swarm optimization with adaptive random inertia weights

Based on conventional particle swarm optimization(PSO),this paper presents an efficient and reliable heuristic approach using PSO with an adaptive random inertia weight(ARIW)strategy,referred to as the ARIW-PSO algorithm,to build a multi-objective optimization model for reservoir operation.Using the triangular probability density function,the inertia weight is randomly generated,and the probability density function is automatically adjusted to make the inertia weight generally greater in the initial stage of evolution,which is suitable for global searches.In the evolution process,the inertia weight gradually decreases,which is beneficial to local searches.The performance of the ARIWPSO algorithm was investigated with some classical test functions,and the results were compared with those of the genetic algorithm(GA),the conventional PSO,and other improved PSO methods.Then,the ARIW-PSO algorithm was applied to multi-objective optimal dispatch of the Panjiakou Reservoir and multi-objective flood control operation of a reservoir group on the Luanhe River in China,including the Panjiakou Reservoir,Daheiting Reservoir,and Taolinkou Reservoir.The validity of the multi-objective optimization model for multi-reservoir systems based on the ARIW-PSO algorithm was verified.

Pilot Allocation Optimization Using Enhanced Salp Swarm Algorithm for Sparse Channel Estimation

Pilot pattern has a significant effect on the performance of channel estimation based on compressed sensing.However,because of the influence of the number of subcarriers and pilots,the complexity of the enumeration method is computationally impractical.The meta-heuristic algorithm of the salp swarm algorithm(SSA)is employed to address this issue.Like most meta-heuristic algorithms,the SSA algorithm is prone to problems such as local optimal values and slow convergence.In this paper,we proposed the CWSSA to enhance the optimization efficiency and robustness by chaotic opposition-based learning strategy,adaptive weight factor,and increasing local search.Experiments show that the test results of the CWSSA on most benchmark functions are better than those of other meta-heuristic algorithms.Besides,the CWSSA algorithm is applied to pilot pattern optimization,and its results are better than other methods in terms of BER and MSE.

Optimization of Cognitive Radio System Using Self-Learning Salp Swarm Algorithm

CognitiveRadio(CR)has been developed as an enabling technology that allows the unused or underused spectrum to be used dynamically to increase spectral efficiency.To improve the overall performance of the CR systemit is extremely important to adapt or reconfigure the systemparameters.The Decision Engine is a major module in the CR-based system that not only includes radio monitoring and cognition functions but also responsible for parameter adaptation.As meta-heuristic algorithms offer numerous advantages compared to traditional mathematical approaches,the performance of these algorithms is investigated in order to design an efficient CR system that is able to adapt the transmitting parameters to effectively reduce power consumption,bit error rate and adjacent interference of the channel,while maximized secondary user throughput.Self-Learning Salp Swarm Algorithm(SLSSA)is a recent meta-heuristic algorithm that is the enhanced version of SSA inspired by the swarming behavior of salps.In this work,the parametric adaption of CR system is performed by SLSSA and the simulation results show that SLSSA has high accuracy,stability and outperforms other competitive algorithms formaximizing the throughput of secondary users.The results obtained with SLSSA are also shown to be extremely satisfactory and need fewer iterations to converge compared to the competitive methods.

Hybrid Chaotic Salp Swarm with Crossover Algorithm for Underground Wireless Sensor Networks

Resource management in Underground Wireless Sensor Networks(UWSNs)is one of the pillars to extend the network lifetime.An intriguing design goal for such networks is to achieve balanced energy and spectral resource utilization.This paper focuses on optimizing the resource efficiency in UWSNs where underground relay nodes amplify and forward sensed data,received from the buried source nodes through a lossy soil medium,to the aboveground base station.A new algorithm called the Hybrid Chaotic Salp Swarm and Crossover(HCSSC)algorithm is proposed to obtain the optimal source and relay transmission powers to maximize the network resource efficiency.The proposed algorithm improves the standard Salp Swarm Algorithm(SSA)by considering a chaotic map to initialize the population along with performing the crossover technique in the position updates of salps.Through experimental results,the HCSSC algorithm proves its outstanding superiority to the standard SSA for resource efficiency optimization.Hence,the network’s lifetime is prolonged.Indeed,the proposed algorithm achieves an improvement performance of 23.6%and 20.4%for the resource efficiency and average remaining relay battery per transmission,respectively.Furthermore,simulation results demonstrate that the HCSSC algorithm proves its efficacy in the case of both equal and different node battery capacities.

Research on Optimization of Freight Train ATO Based on Elite Competition Multi-Objective Particle Swarm Optimization

In view of the complex problems that freight train ATO (automatic train operation) needs to comprehensively consider punctuality, energy saving and safety, a dynamics model of the freight train operation process is established based on the safety and the freight train dynamics model in the process of its operation. The algorithm of combining elite competition strategy with multi-objective particle swarm optimization technology is introduced, and the winning particles are obtained through the competition between two elite particles to guide the update of other particles, so as to balance the convergence and distribution of multi-objective particle swarm optimization. The performance comparison experimental results verify the superiority of the proposed algorithm. The simulation experiments of the actual line verify the feasibility of the model and the effectiveness of the proposed algorithm.

Dynamic Multi-objective Optimization of Chemical Processes Using Modified BareBones MOPSO Algorithm

Dynamic multi-objective optimization is a complex and difficult research topic of process systems engineering. In this paper,a modified multi-objective bare-bones particle swarm optimization( MOBBPSO) algorithm is proposed that takes advantage of a few parameters of bare-bones algorithm. To avoid premature convergence,Gaussian mutation is introduced; and an adaptive sampling distribution strategy is also used to improve the exploratory capability. Moreover, a circular crowded sorting approach is adopted to improve the uniformity of the population distribution.Finally, by combining the algorithm with control vector parameterization,an approach is proposed to solve the dynamic optimization problems of chemical processes. It is proved that the new algorithm performs better compared with other classic multiobjective optimization algorithms through the results of solving three dynamic optimization problems.

Interactive Multi-objective Optimization Design for the Pylon Structure of an Airplane

The pylon structure of an airplane is very complex, and its high-fidelity analysis is quite time-consuming. If posterior preference optimization algorithm is used to solve this problem, the huge time consumption will be unacceptable in engineering practice due to the large amount of evaluation needed for the algorithm. So, a new interactive optimization algorithm-interactive multi-objective particle swarm optimization （IMOPSO） is presented. IMOPSO is efficient, simple and operable. The decision-maker can expediently determine the accurate preference in IMOPSO. IMOPSO is used to perform the pylon structure optimization design of an airplane, and a satisfactory design is achieved after only 12 generations of IMOPSO evolutions. Compared with original design, the maximum displacement of the satisfactory design is reduced, and the mass of the satisfactory design is decreased for 22%.

A hybrid discrete particle swarm optimization-genetic algorithm for multi-task scheduling problem in service oriented manufacturing systems

To cope with the task scheduling problem under multi-task and transportation consideration in large-scale service oriented manufacturing systems(SOMS), a service allocation optimization mathematical model was established, and then a hybrid discrete particle swarm optimization-genetic algorithm(HDPSOGA) was proposed. In SOMS, each resource involved in the whole life cycle of a product, whether it is provided by a piece of software or a hardware device, is encapsulated into a service. So, the transportation during production of a task should be taken into account because the hard-services selected are possibly provided by various providers in different areas. In the service allocation optimization mathematical model, multi-task and transportation were considered simultaneously. In the proposed HDPSOGA algorithm, integer coding method was applied to establish the mapping between the particle location matrix and the service allocation scheme. The position updating process was performed according to the cognition part, the social part, and the previous velocity and position while introducing the crossover and mutation idea of genetic algorithm to fit the discrete space. Finally, related simulation experiments were carried out to compare with other two previous algorithms. The results indicate the effectiveness and efficiency of the proposed hybrid algorithm.

Particle Swarm Optimization Algorithm Based on Chaotic Sequences and Dynamic Self-Adaptive Strategy

To deal with the problems of premature convergence and tending to jump into the local optimum in the traditional particle swarm optimization, a novel improved particle swarm optimization algorithm was proposed. The self-adaptive inertia weight factor was used to accelerate the converging speed, and chaotic sequences were used to tune the acceleration coefficients for the balance between exploration and exploitation. The performance of the proposed algorithm was tested on four classical multi-objective optimization functions by comparing with the non-dominated sorting genetic algorithm and multi-objective particle swarm optimization algorithm. The results verified the effectiveness of the algorithm, which improved the premature convergence problem with faster convergence rate and strong ability to jump out of local optimum.

Dynamic Self-Adaptive Double Population Particle Swarm Optimization Algorithm Based on Lorenz Equation

In order to improve some shortcomings of the standard particle swarm optimization algorithm, such as premature convergence and slow local search speed, a double population particle swarm optimization algorithm based on Lorenz equation and dynamic self-adaptive strategy is proposed. Chaotic sequences produced by Lorenz equation are used to tune the acceleration coefficients for the balance between exploration and exploitation, the dynamic self-adaptive inertia weight factor is used to accelerate the converging speed, and the double population purposes to enhance convergence accuracy. The experiment was carried out with four multi-objective test functions compared with two classical multi-objective algorithms, non-dominated sorting genetic algorithm and multi-objective particle swarm optimization algorithm. The results show that the proposed algorithm has excellent performance with faster convergence rate and strong ability to jump out of local optimum, could use to solve many optimization problems.

Availability Capacity Evaluation and Reliability Assessment of Integrated Systems Using Metaheuristic Algorithm

Contemporarily,the development of distributed generations(DGs)technologies is fetching more,and their deployment in power systems is becom-ing broad and diverse.Consequently,several glitches are found in the recent studies due to the inappropriate/inadequate penetrations.This work aims to improve the reliable operation of the power system employing reliability indices using a metaheuristic-based algorithm before and after DGs penetration with feeder system.The assessment procedure is carried out using MATLAB software and Mod-ified Salp Swarm Algorithm(MSSA)that helps assess the Reliability indices of the proposed integrated IEEE RTS79 system for seven different configurations.This algorithm modifies two control parameters of the actual SSA algorithm and offers a perfect balance between the exploration and exploitation.Further,the effectiveness of the proposed schemes is assessed using various reliability indices.Also,the available capacity of the extended system is computed for the best configuration of the considered system.The results confirm the level of reli-able operation of the extended DGs along with the standard RTS system.Speci-fically,the overall reliability of the system displays superior performance when the tie lines 1 and 2 of the DG connected with buses 9 and 10,respectively.The reliability indices of this case namely SAIFI,SAIDI,CAIDI,ASAI,AUSI,EUE,and AEUE shows enhancement about 12.5%,4.32%,7.28%,1.09%,4.53%,12.00%,and 0.19%,respectively.Also,a probability of available capacity at the low voltage bus side is accomplished a good scale about 212.07 times/year.

Design Optimization of Permanent Magnet Eddy Current Coupler Based on an Intelligence Algorithm

The permanent magnet eddy current coupler(PMEC)solves the problem of flexible connection and speed regulation between the motor and the load and is widely used in electrical transmission systems.It provides torque to the load and generates heat and losses,reducing its energy transfer efficiency.This issue has become an obstacle for PMEC to develop toward a higher power.This paper aims to improve the overall performance of PMEC through multi-objective optimization methods.Firstly,a PMEC modeling method based on the Levenberg-Marquardt back propagation(LMBP)neural network is proposed,aiming at the characteristics of the complex input-output relationship and the strong nonlinearity of PMEC.Then,a novel competition mechanism-based multi-objective particle swarm optimization algorithm(NCMOPSO)is proposed to find the optimal structural parameters of PMEC.Chaotic search and mutation strategies are used to improve the original algorithm,which improves the shortcomings of multi-objective particle swarm optimization(MOPSO),which is too fast to converge into a global optimum,and balances the convergence and diversity of the algorithm.In order to verify the superiority and applicability of the proposed algorithm,it is compared with several popular multi-objective optimization algorithms.Applying them to the optimization model of PMEC,the results show that the proposed algorithm has better comprehensive performance.Finally,a finite element simulation model is established using the optimal structural parameters obtained by the proposed algorithm to verify the optimization results.Compared with the prototype,the optimized PMEC has reduced eddy current losses by 1.7812 kW,increased output torque by 658.5 N·m,and decreased costs by 13%,improving energy transfer efficiency.

基于双层优化VMD-LSTM的农村超短期电力负荷预测

稳定的供电是农村发展建设的有力保障,而电力负荷水平是建设效果的重要衡量标准,因此建立精确的负荷预测模型可以更准确直观显现电力负荷情况,为供电公司制定决策提供有力支撑。由于LSTM负荷预测模型在数据预测方面存在收敛性差、预测精度不高等问题,为提高模型的预测精度,提出一种基于双层优化VMD-LSTM的超短期电力负荷预测方法。首先提出麻雀算法优化变分模态分解(sparrow variational mode decomposition,SVMD),通过SVMD将原始数据转化为模态分量(intrinsic mode functions,IMF);其次采用改进樽海鞘群算法(association salp swarm algorithm,ASSSA)优化LSTM模型。通过引入4种策略增强标准樽海鞘算法优化能力;最后将各模态分量分别代入到新模型并进行叠加预测。选取辽宁省某市某乡村10kV变压器真实历史负荷数据,以均方根误差(RMSE)、平均绝对误差(MAE)、平均绝对百分比误差(MAPE)、拟合度(R^(2))作为评价指标,并与其他基础预测模型进行对比,结果表明,改进后的算法在计算精度、稳定性方面均优于其他基础预测模型。

路径规划问题的多策略改进樽海鞘群算法研究

针对移动机器人寻找最优路径问题,提出了一种融合无标度网络、自适应权重和黄金正弦算法变异策略的樽海鞘群算法BAGSSA(Adaptive Salp Swarm Algorithm with Scale-free of BA Network and Golden Sine)。首先,生成一个无标度网络来映射跟随者的关系,增强算法全局寻优的能力,在追随者进化过程中集成自适应权重ω,以实现算法探索和开发的平衡;同时选用黄金正弦算法变异进一步提高解的精度。其次,对12个基准函数进行仿真求解,实验数据表明平均值、标准差、Wilcoxon检验和收敛曲线均优于基本樽海鞘群和其他群体智能算法,证明了所提算法具有较高的寻优精度和收敛速度。最后,将BAGSSA应用于移动机器人路径规划问题中,并在两种测试环境中进行仿真实验,仿真结果表明,改进樽海鞘群算法较其他算法所寻路径更优,并具有一定理论与实际应用价值。

基于改进樽海鞘群算法的含瓦斯煤破裂过程信号特征识别

针对标准樽海鞘群算法存在的计算精度不足、易陷入局部停滞等缺陷,提出一种多策略融合的樽海鞘群算法。在初始化阶段,引入线性同余法随机发生器;利用野马算法优化樽海鞘领导者位置;采用金豺算法改进樽海鞘种群追随机制。通过测试函数寻优对比实验,证明多策略融合的樽海鞘群算法相比于其他智能算法在鲁棒性与稳定性方面均有显著提升。将多策略融合的樽海鞘群算法应用到含瓦斯煤破裂过程信号特征识别,实验结果表明:提出的含瓦斯煤破裂过程信号特征识别模型具有更好的表现,准确率可达93.33%,相比其他识别模型,识别率更高。

井下电力电缆故障定位研究

针对传统井下电力电缆故障定位方法依赖主观参数选择和抗噪性能较差,无法满足强噪声背景下井下电力电缆故障精确定位要求的问题,提出了一种基于樽海鞘群算法(SSA)优化变分模态分解(VMD)并结合改进型Teager能量算子(NTEO)的井下电力电缆故障定位方法。针对VMD在信号分解上存在的模态混叠、过分解和欠分解问题,采用SSA以模糊熵为适应度函数对VMD模态数K和惩罚因子α2个参数进行优化,得到更能反映故障特征信息的本征模态函数;采用NTEO对本征模态函数进行首波波头标定,得到首末两端的波头到达时刻,根据双端测距法得出故障位置。采用PSCAD/EMTDC进行井下电力电缆故障仿真,模拟具有强背景噪声的井下故障信号,结果表明:①在理想电流信号中加入9,12 dB噪声后,SSA-VMD的信噪比最低,皮尔逊相关系数最大,说明SSA-VMD在最大程度降噪的同时,能很好地保留信号的特征信息。②在不同过渡电阻下,SSA-VMD-NTEO的定位精度较高。③在不同故障相角下,SSA-VMD-NTEO在采样点上出现不同,但定位位置没有改变,依旧保持较高的定位精度。④在不同故障距离下,SSA-VMD-NTEO均能保证较高的定位精度。⑤在井下较大噪声和10 MHz采样频率下,SSA-VMD-NTEO较小波模极大值和VMD+NTEO 2种方法的定位精度具有明显优势。

基于改进SSA结合模糊RBF神经网络的悬臂梁振动主动控制

随着航空航天事业的发展,为了节省燃料,同时提高航天器速度,航天器采用更轻的材料来减少质量。然而,此举也引入了柔性振动,灵活的振动增加了姿态控制的时间,导致姿态精度控制不尽如人意。因此,有效抑制柔性振动以实现高精度姿态控制非常重要。论文以柔性压电悬臂梁作被控对象,并利用压电薄膜(Polyvinylidene Fluoride,PVDF)作传感器和致动器,分析其振动的控制问题。基于PID和模糊理论的局限性,结合模糊控制器能模仿专家经验和径向基神经网络(Radial Basis Function Network,RBFNN)善于学习的优点,设计了模糊径向基(Fuzzy Radial Basis Function,FRBF)神经网络控制器来抑制悬臂梁的振动,并采用混沌映射的种群初始化策略、疯狂算子的领导者位置更新策略、精英保留及动态惯性权重的追随者位置更新策略改进的樽海鞘群算法(Salp Swarm Algorithm,SSA)来优化模糊神经网络权值。将改进后的控制方法在Matlab软件环境下进行了数值仿真,仿真结果表明,应用改进的模糊径向基神经网络控制器可以有效地提升主动控制的振动效果。

基于改进樽海鞘群算法的多目标柔性作业车间调度问题研究

针对多目标柔性作业车间调度问题,构建了以最小化总能耗、最小化生产成本及最小化惩罚值为优化目标的数学模型,并设计改进的多目标樽海鞘群算法(IMSSA)进行求解。改进算法主要由樽海鞘领导者和樽海鞘追随者两部分构成,其中,领导者位置更新结合正余弦算法来实现,追随者位置更新基于线性微分递减的惯性权重方法来完成。此外,引入食物源存储库用于保留非支配解。最后通过对比实验证明了所提策略及改进算法的有效性。

基于改进多输出支持向量的船舶航迹预测

为保障智能船舶快速、安全、可靠地进行避碰工作,提出了一种基于改进樽海鞘群算法(salp swarm algorithm,SSA)的多输出支持向量的船舶航迹预测模型。本文采用的多输出支持向量模型可以对船舶进行整体建模,所构建的模型可以对船舶航迹状态进行多输出预测,对于模型中存在的超参数采用改进的SSA进行寻优,算法加入了自适应权重与离群象算法,避免了算法早熟与高维易陷入局部最优的问题。最后,实验选取了实测数据对所提方法进行验证,并与其他常见模型进行对比实验,结果表明了所提方法的可行性与有效性。