Artificial Searching Swarm Algorithm and Its Performance Analysis

Artificial Searching Swarm Algorithm (ASSA) is a new optimization algorithm. ASSA simulates the soldiers to search an enemy’s important goal, and transforms the process of solving optimization problem into the process of searching optimal goal by searching swarm with set rules. This work selects complicated and highn dimension functions to deeply analyse the performance for unconstrained and constrained optimization problems and the results produced by ASSA, Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Artificial Fish-Swarm Algorithm (AFSA) have been compared. The main factors which influence the performance of ASSA are also discussed. The results demonstrate the effectiveness of the proposed ASSA optimization algorithm.

基于ESMD-FE-AJSO-LSTM算法的水闸深基坑变形预测

水闸深基坑开挖变形具有明显的非线性和非稳定性特征,基于此,引入极点对称模态分解算法(extremepoint symmetric mode decomposition method,ESMD)对水闸深基坑开挖变形原型监测序列进行多模态分解,并基于模糊熵(fuzzy entropy, FE)理论对各分解分量进行模糊多模态相空间重构,从而有效甄别水闸基坑变形不同时间尺度有效物理特征。构建基于人工水母搜索算法(artificial jellyfish search optimizer,AJSO)优化的长短期记忆(long short-term memory,LSTM)人工神经网络模型,以重构后的各重构子序列为基础进行优化训练,并把训练后的各预测模态分量合并,实现对水闸基坑开挖变形动态预测和分析。以张家港市十一圩江边枢纽改建工程基坑开挖变形监测为例,采用上述方法对该枢纽工程基坑开挖过程变形进行预测和分析。结果表明:基于ESMD-FE-AJSOLSTM算法的水闸深基坑变形预测方法能够有效预测基坑开挖变形非线性特征,相比传统LSTM、循环神经网络(recurrent neural network, RNN)和支持向量机(support vector machine,SVM)等算法具有更高的预测精度和稳定性,为实现对基坑开挖安全性态实时科学诊断和分析提供技术参考。

An Improved Lung Cancer Segmentation Based on Nature-Inspired Optimization Approaches

The distinction and precise identification of tumor nodules are crucial for timely lung cancer diagnosis andplanning intervention. This research work addresses the major issues pertaining to the field of medical imageprocessing while focusing on lung cancer Computed Tomography (CT) images. In this context, the paper proposesan improved lung cancer segmentation technique based on the strengths of nature-inspired approaches. Thebetter resolution of CT is exploited to distinguish healthy subjects from those who have lung cancer. In thisprocess, the visual challenges of the K-means are addressed with the integration of four nature-inspired swarmintelligent techniques. The techniques experimented in this paper are K-means with Artificial Bee Colony (ABC),K-means with Cuckoo Search Algorithm (CSA), K-means with Particle Swarm Optimization (PSO), and Kmeanswith Firefly Algorithm (FFA). The testing and evaluation are performed on Early Lung Cancer ActionProgram (ELCAP) database. The simulation analysis is performed using lung cancer images set against metrics:precision, sensitivity, specificity, f-measure, accuracy,Matthews Correlation Coefficient (MCC), Jaccard, and Dice.The detailed evaluation shows that the K-means with Cuckoo Search Algorithm (CSA) significantly improved thequality of lung cancer segmentation in comparison to the other optimization approaches utilized for lung cancerimages. The results exhibit that the proposed approach (K-means with CSA) achieves precision, sensitivity, and Fmeasureof 0.942, 0.964, and 0.953, respectively, and an average accuracy of 93%. The experimental results prove thatK-meanswithABC,K-meanswith PSO,K-meanswith FFA, andK-meanswithCSAhave achieved an improvementof 10.8%, 13.38%, 13.93%, and 15.7%, respectively, for accuracy measure in comparison to K-means segmentationfor lung cancer images. Further, it is highlighted that the proposed K-means with CSA have achieved a significantimprovement in accuracy, hence can be utilized by researchers for improved segmentation processes of medicalimage datasets for identifying the targeted region of interest.

An Improved Jellyfish Algorithm for Multilevel Thresholding of Magnetic Resonance Brain Image Segmentations

Image segmentation is vital when analyzing medical images,especially magnetic resonance(MR)images of the brain.Recently,several image segmentation techniques based on multilevel thresholding have been proposed for medical image segmentation;however,the algorithms become trapped in local minima and have low convergence speeds,particularly as the number of threshold levels increases.Consequently,in this paper,we develop a new multilevel thresholding image segmentation technique based on the jellyfish search algorithm(JSA)(an optimizer).We modify the JSA to prevent descents into local minima,and we accelerate convergence toward optimal solutions.The improvement is achieved by applying two novel strategies:Rankingbased updating and an adaptive method.Ranking-based updating is used to replace undesirable solutions with other solutions generated by a novel updating scheme that improves the qualities of the removed solutions.We develop a new adaptive strategy to exploit the ability of the JSA to find a best-so-far solution;we allow a small amount of exploration to avoid descents into local minima.The two strategies are integrated with the JSA to produce an improved JSA(IJSA)that optimally thresholds brain MR images.To compare the performances of the IJSA and JSA,seven brain MR images were segmented at threshold levels of 3,4,5,6,7,8,10,15,20,25,and 30.IJSA was compared with several other recent image segmentation algorithms,including the improved and standard marine predator algorithms,the modified salp and standard salp swarm algorithms,the equilibrium optimizer,and the standard JSA in terms of fitness,the Structured Similarity Index Metric(SSIM),the peak signal-to-noise ratio(PSNR),the standard deviation(SD),and the Features Similarity Index Metric(FSIM).The experimental outcomes and the Wilcoxon rank-sum test demonstrate the superiority of the proposed algorithm in terms of the FSIM,the PSNR,the objective values,and the SD;in terms of the SSIM,IJSA was competitive with the others.

Optimal fuzzy PID controller with adjustable factors based on flexible polyhedron search algorithm

A new kind of optimal fuzzy PID controller is proposed, which contains two parts. One is an on line fuzzy inference system, and the other is a conventional PID controller. In the fuzzy inference system, three adjustable factors x p, x i , and x d are introduced. Their functions are to further modify and optimize the result of the fuzzy inference so as to make the controller have the optimal control effect on a given object. The optimal values of these adjustable factors are determined based on the ITAE criterion and the Nelder and Mead′s flexible polyhedron search algorithm. This optimal fuzzy PID controller has been used to control the executive motor of the intelligent artificial leg designed by the authors. The result of computer simulation indicates that this controller is very effective and can be widely used to control different kinds of objects and processes.

BHJO: A Novel Hybrid Metaheuristic Algorithm Combining the Beluga Whale, Honey Badger, and Jellyfish Search Optimizers for Solving Engineering Design Problems

Hybridizing metaheuristic algorithms involves synergistically combining different optimization techniques to effectively address complex and challenging optimization problems.This approach aims to leverage the strengths of multiple algorithms,enhancing solution quality,convergence speed,and robustness,thereby offering a more versatile and efficient means of solving intricate real-world optimization tasks.In this paper,we introduce a hybrid algorithm that amalgamates three distinct metaheuristics:the Beluga Whale Optimization(BWO),the Honey Badger Algorithm(HBA),and the Jellyfish Search(JS)optimizer.The proposed hybrid algorithm will be referred to as BHJO.Through this fusion,the BHJO algorithm aims to leverage the strengths of each optimizer.Before this hybridization,we thoroughly examined the exploration and exploitation capabilities of the BWO,HBA,and JS metaheuristics,as well as their ability to strike a balance between exploration and exploitation.This meticulous analysis allowed us to identify the pros and cons of each algorithm,enabling us to combine them in a novel hybrid approach that capitalizes on their respective strengths for enhanced optimization performance.In addition,the BHJO algorithm incorporates Opposition-Based Learning(OBL)to harness the advantages offered by this technique,leveraging its diverse exploration,accelerated convergence,and improved solution quality to enhance the overall performance and effectiveness of the hybrid algorithm.Moreover,the performance of the BHJO algorithm was evaluated across a range of both unconstrained and constrained optimization problems,providing a comprehensive assessment of its efficacy and applicability in diverse problem domains.Similarly,the BHJO algorithm was subjected to a comparative analysis with several renowned algorithms,where mean and standard deviation values were utilized as evaluation metrics.This rigorous comparison aimed to assess the performance of the BHJOalgorithmabout its counterparts,shedding light on its effectiveness and reliability in solving optimization problems.Finally,the obtained numerical statistics underwent rigorous analysis using the Friedman post hoc Dunn’s test.The resulting numerical values revealed the BHJO algorithm’s competitiveness in tackling intricate optimization problems,affirming its capability to deliver favorable outcomes in challenging scenarios.

考虑需求响应的微电网最优经济运行及改进人工蜂群算法

为降低微电网并网对大电网的影响并降低微电网的发电成本,提出一种基于负荷转移的激励型需求响应微电网最优经济运行模型.在此基础上,针对人工蜂群算法寻优精度不高、易陷入局部最优等不足,提出一种多策略改进人工蜂群算法.首先,提出双精英个体引导的新搜索方程降低搜索的随机性和盲目性;其次,提出免疫-提前自适应转换机制,平衡全局搜索性能和局部开发能力;最后,引入基于Levy飞行的变邻域搜索策略,强化算法跳出局部最优的能力,通过仿真实例验证了所提模型和算法的可行性和有效性.试验结果表明,所提模型实现削峰填谷的同时可以有效降低发电成本;通过与其他算法在微电网算例上收敛速度和寻优精度的比较,验证了多策略改进人工蜂群算法的优越性.

基于多策略融合的人工水母算法的瑞雷面波反演研究

为了快速、准确地通过反演得到浅地表地层结构,本文将人工水母搜索算法引入到瑞雷波频散曲线反演问题,并对其进行了相应的改进。在水母跟随洋流运动阶段引入莱维飞行扰动与指数递减型惯性权重,可以扩大算法的全局搜索能力,提高算法的寻优收敛速度;在水母被动运动阶段引入指数递减型惯性权重,并结合黄金正弦算法,可以提升算法的探索寻优能力。本文对多策略融合人工水母算法在瑞雷面波频散曲线反演问题中的效率和精度进行了研究,将人工水母搜索算法、多策略融合人工水母算法与传统非线性粒子群算法分别应用于速度递增层、含低速软夹层与含高速硬夹层三个典型的四层理论地质模型,对理论频散曲线和加随机测试误差的频散曲线进行了反演研究,验证了多策略融合人工水母算法在瑞雷面波反演研究中的有效性与稳定性。

Enhanced Hybrid Equilibrium Strategy in Fog-Cloud Computing Networks with Optimal Task Scheduling

More devices in the Intelligent Internet of Things(AIoT)result in an increased number of tasks that require low latency and real-time responsiveness,leading to an increased demand for computational resources.Cloud computing’s low-latency performance issues in AIoT scenarios have led researchers to explore fog computing as a complementary extension.However,the effective allocation of resources for task execution within fog environments,characterized by limitations and heterogeneity in computational resources,remains a formidable challenge.To tackle this challenge,in this study,we integrate fog computing and cloud computing.We begin by establishing a fog-cloud environment framework,followed by the formulation of a mathematical model for task scheduling.Lastly,we introduce an enhanced hybrid Equilibrium Optimizer(EHEO)tailored for AIoT task scheduling.The overarching objective is to decrease both the makespan and energy consumption of the fog-cloud system while accounting for task deadlines.The proposed EHEO method undergoes a thorough evaluation against multiple benchmark algorithms,encompassing metrics likemakespan,total energy consumption,success rate,and average waiting time.Comprehensive experimental results unequivocally demonstrate the superior performance of EHEO across all assessed metrics.Notably,in the most favorable conditions,EHEO significantly diminishes both the makespan and energy consumption by approximately 50%and 35.5%,respectively,compared to the secondbest performing approach,which affirms its efficacy in advancing the efficiency of AIoT task scheduling within fog-cloud networks.

求解工程优化问题的多种智能优化算法仿真

探究新型优化算法的寻优性能和工程优化问题求解能力,选取6种智能算法:天鹰优化器(AO)、算术优化算法(AOA)、非洲秃鹫优化算法(AVOA)、人工大猩猩部队优化器(GTO)、饥饿游戏搜索算法(HGS)、野马优化器(WHO),对其进行仿真对比。首先阐述新型算法的主体框架;然后,选取6个基准测试函数并测试其寻优性能;最后,用其求解2种典型的工程优化问题,并且分析其改进方向和应用前景。对于测试函数的仿真结果分析,GTO算法的寻优能力最强,多次获取测试函数理论值,且运行时间较短;在工程优化问题的仿真中,GTO算法与WHO算法的寻优能力较为突出,寻优时间短,可靠性高。

融合多策略人工水母算法及工程应用研究

针对人工水母群算法(JS)在求解较为复杂问题和部分工程问题时存在易陷入局部最优和寻优精度低等问题,提出一种融合多策略的人工水母算法。首先,该算法利用莱维飞行的扰动策略对洋流运动和被动运动阶段位置更新方式进行扰动,增强算法跳出局部最优的能力;其次,对水母跟随洋流和群内被动运动阶段引入指数递减惯性权重,使算法扩大全局搜索范围,提高寻优收敛速度;最后,将黄金正弦引导机制引入至被动运动阶段,替换原有被动运动位置更新方式,提升算法在探索和开发阶段的寻优能力。通过对6个基准测试函数进行测试分析,采用Wilcoxon秩和检验证明改进算法的寻优能力强、收敛速度快,将其应用于压力弹簧设计工程实际问题中,进一步验证了改进算法的适应性和有效性。

基于改进人工水母搜索算法的电液伺服系统控制研究

电液伺服系统是工业制造领域不可或缺的一部分,它是一个复杂的时变非线性系统,常规PID在实际工业控制中存在参数调节难度大、效率低等问题,很难达到理想的控制结果。针对以上问题,提出一种改进人工水母搜索算法来优化PID控制器参数的方法,将蝴蝶算法中随机移动概念引入到人工水母算法中,并将其和PSO算法、标准人工水母搜索算法进行对比分析,利用MATLAB软件搭建PID控制模型。仿真结果表明:运用改进人工水母搜索算法能高效、精确、快速地寻优出PID控制器的最佳参数,并展现出了鲁棒性好、调节时间少、运行相对稳定等优点,系统的控制性能得到了显著提升。

基于Pareto支配的改进人工大猩猩部队多目标优化

针对二维和三维多目标优化的解易陷入次优和分布不规则问题,引入Pareto支配方法并提出了结合改进策略的人工大猩猩部队优化算法(MOGTO)以改善多目标优化问题。首先,利用外部档案集存储互不支配解集以防止种群经过一次寻优迭代后,删除劣解的同时错误去除非支配解。其次,加入蒙特卡洛树搜索对种群探索阶段的三种机制进行优化,增加算法全局搜索能力。同时,结合天牛须算法的左右须寻优原理及黄金正弦寻优策略对开发阶段的两种机制进行优化,生成左右须解和促进个体位置更新,引导个体扩大搜索范围以防止最优解陷入局部最优。最后,通过12个基准测试函数对所提算法进行验证并将所提算法与其他6种常见算法进行对比,实验结果表明所提算法在多目标问题的寻优能力较对比算法有较大的提升。通过曲柄摇杆机构优化设计案例测试分析,验证了所提算法在实际工程应用中的可行性和实用性。

基于ISSA-BP神经网络的激光甲烷传感器温度补偿研究

为有效提高宽温应用环境下激光甲烷传感器的探测精度,提出基于改进麻雀搜索算法优化BP神经网络的温度补偿模型,并利用实测大规模数据集进行验证。在模型框架上,提出具有全局寻优能力的ISSA-BP算法:利用准反射学习策略初始化麻雀种群以提高麻雀种群多样性,引入变色龙算法、Levy飞行策略和人工兔扰动策略分别对探索者位置、反捕食者位置和每代麻雀个体位置进行更新,避免算法陷入局部最优。在数据上,通过建立不同温度、不同浓度的传感器大规模实验数据集,提升温度补偿模型的训练效果并减小模型的预测误差。在-20℃~65℃温度范围内利用15800组传感器测量数据分别对BP、PSO-BP、SSA-BP和ISSA-BP四种模型进行对比。结果表明,基于ISSA-BP神经网络的温度补偿模型预测值最大相对误差仅为0.52%,比BP、PSO-BP和SSA-BP模型分别减少了7.70%、2.46%和0.74%,MAE、MAPE、RMSE和RE量化评价指标均远优于BP、PSO-BP和SSA-BP模型。本文算法可大幅提高宽温应用环境下激光甲烷传感器探测精度,对提升激光甲烷传感器的环境适用性具有重要的参考意义。

基于离线搜索的人工免疫动态多目标优化算法

为了能在环境快速变化后迅速找到新环境下的Pareto解,提出了一种基于离线搜索与在线优化相结合的人工免疫动态多目标进化算法。首先,所提算法预估优化过程中可能会出现的动态环境。其次,算法搜寻到上述预估环境下的近似Pareto解,并将其存储在离线解集中。动态发生后,所提算法采用基于离线解集的动态响应策略来重新获得一组高质量的初始种群。随后,基于抗体消灭抗原的免疫思想设计了一种子代生成策略,使重新获得的初始种群快速靠近当前环境下优化问题的真实Pareto解,进而提高算法的优化效率。为了验证该算法的有效性,在动态多目标优化问题标准测试集上进行对比实验。实验结果表明,所提算法能够更快速准确地跟踪动态环境下的Pareto前沿。

基于人工鱼群算法的电力系统无功优化

尝试将人工鱼群算法(AFSA)用于电力系统无功优化,建立了相应的优化模型,对IEEE6、IEEE14节点系统及某地区实际电力系统进行了无功优化计算,并与遗传算法(GA)、改进Tabu搜索算法(MTSA)进行了比较,结果表明AFSA鲁棒性强,全局收敛性好,用于电力系统无功优化计算是有效、可行的。

基于混沌局部搜索算子的人工蜂群算法

在求解函数优化问题时,为了提升人工蜂群算法局部搜索能力,提出了一种新颖的混沌蜂群算法。新算法设计了一种混沌局部搜索算子,并将其嵌入蜂群算法框架中;该算子不仅能够实现在最优食物源周围局部搜索,还能够随着进化代数增加使搜索范围不断缩小。仿真实验结果表明,与人工蜂群算法相比,新算法在Rosenbrock函数上,求解精度和收敛速度明显占优;此外新算法在多模函数Griewank和Rastrigin上,收敛速度明显占优。

改进的万有引力搜索算法在函数优化中的应用

万有引力搜索算法应用于函数优化问题时易陷入局部最优解且优化精度不高。针对这些问题,提出了一种改进的万有引力搜索算法。该算法通过引入反向学习策略、精英策略和边界变异策略,显著地提高了万有引力搜索算法中粒子的探索能力与开发能力,获得了较强的全局优化能力和局部优化能力。通过对6个非线性基准函数进行仿真实验,结果表明:与基本的万有引力搜索算法、加权的万有引力搜索算法和人工蜂群算法相比,改进的万有引力搜索算法在求解复杂函数的优化问题时具有更好的优化性能。

求解旅行商问题的离散人工萤火虫算法

针对旅行商问题,提出了一种结合变邻域搜索算法思想的离散人工萤火虫算法.文中通过引入交换子和交换序的概念对人工萤火虫算法中的距离进行了重新定义;为了增加萤火虫群的多样性,避免算法过早陷入局部最优,采用了基于变邻域搜索算法的扰动机制.在多个旅行商问题上的测试结果表明,与文献中的算法相比,文中提出的离散人工萤火虫算法具有较好的求解性能.

基于极值优化策略的改进的人工蜂群算法

为提高人工蜂群算法在求解优化问题中的性能,结合极值优化策略提出一种改进的人工蜂群算法。改进算法基于极值优化策略高效率的寻优机制重新设计了原算法中跟随蜂的局部搜索方案,并具体给出了新方案的组元变异算子和最差组元判定规则。通过对优化问题中8个典型测试函数的仿真实验表明,与基本人工蜂群算法和已有的典型改进算法相比,改进算法在寻优精度和收敛速度上均有明显提高,在优化问题求解中体现出较强的寻优能力。