An Improved Artificial Rabbits Optimization Algorithm with Chaotic Local Search and Opposition-Based Learning for Engineering Problems and Its Applications in Breast Cancer Problem

Artificial rabbits optimization(ARO)is a recently proposed biology-based optimization algorithm inspired by the detour foraging and random hiding behavior of rabbits in nature.However,for solving optimization problems,the ARO algorithm shows slow convergence speed and can fall into local minima.To overcome these drawbacks,this paper proposes chaotic opposition-based learning ARO(COARO),an improved version of the ARO algorithm that incorporates opposition-based learning(OBL)and chaotic local search(CLS)techniques.By adding OBL to ARO,the convergence speed of the algorithm increases and it explores the search space better.Chaotic maps in CLS provide rapid convergence by scanning the search space efficiently,since their ergodicity and non-repetitive properties.The proposed COARO algorithm has been tested using thirty-three distinct benchmark functions.The outcomes have been compared with the most recent optimization algorithms.Additionally,the COARO algorithm’s problem-solving capabilities have been evaluated using six different engineering design problems and compared with various other algorithms.This study also introduces a binary variant of the continuous COARO algorithm,named BCOARO.The performance of BCOARO was evaluated on the breast cancer dataset.The effectiveness of BCOARO has been compared with different feature selection algorithms.The proposed BCOARO outperforms alternative algorithms,according to the findings obtained for real applications in terms of accuracy performance,and fitness value.Extensive experiments show that the COARO and BCOARO algorithms achieve promising results compared to other metaheuristic algorithms.

An Opposition-Based Learning-Based Search Mechanism for Flying Foxes Optimization Algorithm

The flying foxes optimization(FFO)algorithm,as a newly introduced metaheuristic algorithm,is inspired by the survival tactics of flying foxes in heat wave environments.FFO preferentially selects the best-performing individuals.This tendency will cause the newly generated solution to remain closely tied to the candidate optimal in the search area.To address this issue,the paper introduces an opposition-based learning-based search mechanism for FFO algorithm(IFFO).Firstly,this paper introduces niching techniques to improve the survival list method,which not only focuses on the adaptability of individuals but also considers the population’s crowding degree to enhance the global search capability.Secondly,an initialization strategy of opposition-based learning is used to perturb the initial population and elevate its quality.Finally,to verify the superiority of the improved search mechanism,IFFO,FFO and the cutting-edge metaheuristic algorithms are compared and analyzed using a set of test functions.The results prove that compared with other algorithms,IFFO is characterized by its rapid convergence,precise results and robust stability.

Modified Elite Opposition-Based Artificial Hummingbird Algorithm for Designing FOPID Controlled Cruise Control System

Efficient speed controllers for dynamic driving tasks in autonomous vehicles are crucial for ensuring safety and reliability.This study proposes a novel approach for designing a fractional order proportional-integral-derivative(FOPID)controller that utilizes a modified elite opposition-based artificial hummingbird algorithm(m-AHA)for optimal parameter tuning.Our approach outperforms existing optimization techniques on benchmark functions,and we demonstrate its effectiveness in controlling cruise control systems with increased flexibility and precision.Our study contributes to the advancement of autonomous vehicle technology by introducing a novel and efficient method for FOPID controller design that can enhance the driving experience while ensuring safety and reliability.We highlight the significance of our findings by demonstrating how our approach can improve the performance,safety,and reliability of autonomous vehicles.This study’s contributions are particularly relevant in the context of the growing demand for autonomous vehicles and the need for advanced control techniques to ensure their safe operation.Our research provides a promising avenue for further research and development in this area.

A Spider Monkey Optimization Algorithm Combining Opposition-Based Learning and Orthogonal Experimental Design

As a new bionic algorithm,Spider Monkey Optimization(SMO)has been widely used in various complex optimization problems in recent years.However,the new space exploration power of SMO is limited and the diversity of the population in SMO is not abundant.Thus,this paper focuses on how to reconstruct SMO to improve its performance,and a novel spider monkey optimization algorithm with opposition-based learning and orthogonal experimental design(SMO^(3))is developed.A position updatingmethod based on the historical optimal domain and particle swarmfor Local Leader Phase(LLP)andGlobal Leader Phase(GLP)is presented to improve the diversity of the population of SMO.Moreover,an opposition-based learning strategy based on self-extremum is proposed to avoid suffering from premature convergence and getting stuck at locally optimal values.Also,a local worst individual elimination method based on orthogonal experimental design is used for helping the SMO algorithm eliminate the poor individuals in time.Furthermore,an extended SMO^(3)named CSMO^(3)is investigated to deal with constrained optimization problems.The proposed algorithm is applied to both unconstrained and constrained functions which include the CEC2006 benchmark set and three engineering problems.Experimental results show that the performance of the proposed algorithm is better than three well-known SMO algorithms and other evolutionary algorithms in unconstrained and constrained problems.

An Improved Gorilla Troops Optimizer Based on Lens Opposition-Based Learning and Adaptive β-Hill Climbing for Global Optimization

Gorilla troops optimizer(GTO)is a newly developed meta-heuristic algorithm,which is inspired by the collective lifestyle and social intelligence of gorillas.Similar to othermetaheuristics,the convergence accuracy and stability of GTOwill deterioratewhen the optimization problems to be solved becomemore complex and flexible.To overcome these defects and achieve better performance,this paper proposes an improved gorilla troops optimizer(IGTO).First,Circle chaotic mapping is introduced to initialize the positions of gorillas,which facilitates the population diversity and establishes a good foundation for global search.Then,in order to avoid getting trapped in the local optimum,the lens opposition-based learning mechanism is adopted to expand the search ranges.Besides,a novel local search-based algorithm,namely adaptiveβ-hill climbing,is amalgamated with GTO to increase the final solution precision.Attributed to three improvements,the exploration and exploitation capabilities of the basic GTOare greatly enhanced.The performance of the proposed algorithm is comprehensively evaluated and analyzed on 19 classical benchmark functions.The numerical and statistical results demonstrate that IGTO can provide better solution quality,local optimumavoidance,and robustness compared with the basic GTOand five other wellknown algorithms.Moreover,the applicability of IGTOis further proved through resolving four engineering design problems and training multilayer perceptron.The experimental results suggest that IGTO exhibits remarkable competitive performance and promising prospects in real-world tasks.

基于改进布谷鸟搜索算法的光伏MPPT控制

复杂阴影情况下,光伏阵列的P-V特性曲线会出现多个峰值,传统的MPPT算法因不能准确识别局部峰值和全局峰值,而无法进行复杂阴影情况下的最大功率点跟踪。针对传统布谷鸟搜索(Cuckoo Search,CS)算法因鸟窝之间缺乏交流能力导致可能陷入局部最优的问题,提出了一种多策略改进布谷鸟搜索(EGICS)算法。将传统CS算法中发现概率值的选择自适应变化,提高算法的搜索能力;将步长因子自适应化,提高算法的收敛速度;引入高斯扰动和精英反向学习策略,增加种群多样性,避免算法陷入局部最优。对EGICS算法在单峰和多峰函数中进行性能测试,并将其应用于光伏系统MPPT控制中进行仿真验证。仿真结果表明,EGICS算法在收敛速度、跟踪精度以及动态稳定三个方面有更好的效果。

基于改进白鲸优化算法的D2D通信功率控制

D2D(Device-to-Device)通信作为未来移动通信网络的关键技术,为用户提供了直接通信的便利性和资源共享的高效性.然而,D2D通信的功率控制一直是影响通信质量和系统性能的关键问题.为解决这一问题,将精英反向学习、自适应权重两种策略引入到白鲸优化算法(Beluga Whale Optimization,BWO)中,并利用莱维飞行的随机步长策略来增加算法寻优的多样性,提出了基于改进白鲸优化算法的D2D通信功率控制方法.该方法利用最优解的信息引导搜索过程,可提高搜索效率和全局收敛,并能够有效提高通信效率和系统稳定性.为了验证所提出方法的有效性,开展了大量的数值仿真实验.结果显示,基于改进白鲸优化算法的D2D通信功率控制方法在增加系统吞吐量、减少干扰方面有显著的改善.同时,提出的算法相对于已有的算法有着更出色的收敛性与鲁棒性,在不同通信环境和参数设置下都能表现出更稳定的性能.

基于精英知识引导的多种群协作粒子群优化算法

目的为了解决粒子群优化(particle swarm optimization,PSO)算法易早熟收敛、后期收敛速度慢、精度低等问题,方法提出一种基于精英知识引导的多种群协作粒子群优化算法(multi-group cooperation particle swarm optimization algorithm,MGCPSO)。首先,采用基于幂函数约束的logistic映射得到分布均匀的初始种群,加快寻优速度并提高找到最优解的概率;其次,在算法执行阶段动态划分多种群,并利用精英知识引导劣势粒子飞行,实现粒子间的信息共享和协同进化,降低粒子在解空间探索的盲目性;最后,综合融入精英知识的反向学习和极值扰动策略对粒子施加变异,帮助粒子扩大搜索区域并加强对最优邻域的精细探索。结果为验证MGCPSO的性能,在30维和100维的基准测试函数上进行了仿真实验研究,结果表明,相比于其他几种改进算法,提出的算法在收敛速度和收敛精度上均有良好表现。结论多种群协作粒子群优化可以有效避免算法早熟收敛和陷入局部最优,同时可以提高算法的全局搜索能力和局部开发能力。

改进迭代贪婪算法求解可重入流水车间调度问题

可重入混合流水车间是在混合流水车间的基础上增加了可重入特性,具有更高的调度复杂性。为了求解可重入混合流水车间调度问题,首先建立了调度优化模型,优化目标为最小化最大完工时间,然后提出一种带精英调整的学习型迭代贪婪算法(LIG-EA)。LIG-EA算法采用基于工件的编码方式,对重组后的染色体进行解码。种群分为精英个体和普通个体两部分,对精英个体进行精英破坏重建和基于关键工件的染色体调整,对普通个体进行学习机制的构建和普通个体的破坏重建。为提高初始种群质量,采用NEH启发式算法进行种群初始化,并针对可重入混合流水车间的重入特性,在重建操作中增加了插入有效性判断,提高了算法的运行速度。通过大量实验表明LIG-EA算法能够有效求解可重入混合流水车间调度问题。

基于改进SCSO算法的光伏MPPT研究

在解决光伏阵列在局部遮挡时发电效率降低的问题时,传统最大功率点追踪(MPPT)方法容易追踪失败。为此,提出一种改进沙猫群优化算法的最大功率点追踪方法。该算法在标准沙猫群算法的基础上,引入了精英反向学习和自适应t分布,同时优化沙猫群算法(SCSO)的局部搜索并融合Jaya算法。通过对4种典型单峰、多峰函数的测试,证明该算法具有极高的收敛速度,容易跳出局部最优值。将算法应用于MPPT控制中,仿真结果表明:在静态遮荫情况下,所提方法的搜索最大功率点的时间更少;在动态遮荫条件下,重新搜寻到最大功率点的响应时间平均为0.2 s。实验表明所提算法可以适应动态变化的天气,解决了传统算法收敛速度和防止陷入局部最优等问题。

多策略融合的改进狮群算法及其工程优化

狮群算法是近年提出的一种智能优化算法,已经应用于多个领域,然而该算法仍存在搜索效率不足、易落入局部最优等问题.因此,基于狮群算法,提出了多策略融合的改进狮群算法.首先,使用Tent混沌种群的初始化方法,增强种群分布的均匀性的历遍性,提高算法初始解的质量和搜索效率;其次,采用柯西变异机制,在狮群最优位置采用柯西扰动操作,提升算法逃离局部极值的能力;再次,改进母狮位置更新方式和步长公式,提高算法后期的收敛精度;最后,融合精英反向学习,提高解的质量.选取国际通用的13个基准函数和部分CEC2014函数进行实验仿真,结果表明所提算法寻优性能和搜索精度有明显提升;另外通过对两个工程实例进行优化,结果表明改进算法在工程应用中具有优势.

混合多策略改进的樽海鞘群算法及其应用

针对标准的樽海鞘群算法(salp swarm algorithm, SSA)在寻优过程中易出现局部最优和收敛速度慢等问题,提出一种混合多策略改进的樽海鞘群算法(ISSA)。利用佳点集策略生成初始种群,使个体均匀分布于搜索空间;将反向学习的思想融入到领导者位置更新中,提高算法的搜索精度;加入自适应t分布,利用迭代次数iter作为其自由度参数,改善算法的全局探索能力;引入精英反向学习,筛选更好的种群,避免陷入局部最优。通过一组基准函数和Wilcoxin秩和检验来检测改进算法的性能,实验结果表明,改进算法的探索能力和优化精度都得到明显改善且算法之间存在显著差异,通过实际机械设计案例进一步验证ISSA算法的有效性。

引入精英反向学习和柯西变异的混沌蜉蝣算法

为提高蜉蝣算法的收敛速度,提升算法寻优能力,提出一种引入精英反向学习和柯西变异的混沌蜉蝣算法。利用Circle混沌映射序列优化初始种群使种群分布更加均匀,提高种群多样性。在蜉蝣更新阶段,对蜉蝣中的精英个体进行反向学习策略,防止算法陷入局部最优,提高算法收敛速度。为保证种群进化方向和扩大寻优范围,将自适应概率阈值和柯西变异的扰动机制相结合,对劣势蜉蝣个体附近生成更大的扰动。通过8个基准测试函数实验对比和Wilcoxon秩和检验,实验结果表明,混沌蜉蝣算法在收敛速度、求解精度以及稳定性等方面有较大提高。

基于改进麻雀搜索算法的PID参数整定系统设计

PID参数整定是PID控制中的一个关键步骤,常规的PID控制在一定程度上已被淘汰。为改善PID控制的效果和精度,文中将黄金正弦策略与精英反向学习策略相结合,提出一种改进的麻雀搜索算法。用23个标准函数对所提出的新方法进行了验证,实验结果证明了新方法的有效性。利用改进的麻雀搜索算法对PID控制参数进行了优化,并对该方法进行了仿真分析。结果表明,采用该方法进行PID参数整定时,其具有更好的稳定性、更高的精度和更好的性能。

基于改进帝王蝶算法的最大似然DOA估计

针对传统最大似然波达方向(maximum likelihood direction of arrival,ML-DOA)估计存在计算量大、估计精度差等问题,本文提出一种采用改进帝王蝶优化算法(improved monarch butterfly optimization algorithm,IMBO)的ML-DOA估计方法。IMBO算法通过精英反向学习策略对初始帝王蝶种群进行优化,得到适应度值较优的初始帝王蝶个体,进而能够改善帝王蝶种群的多样性;引入差分进化算法启发的变异操作以及自适应策略对帝王蝶个体的寻优方式进行改进,扩大了算法的搜索空间;引入了高斯-柯西变异算子,自适应调整变异步长,避免算法陷入局部最优。将IMBO应用于ML-DOA,实验表明,与传统的DOA估计算法相比,在不同信源数目、信噪比以及种群数量下,本文提出的算法收敛性能更好,均方根误差更低,运算量更小。

基于改进海洋捕食者算法的机械臂逆解求解

针对冗余机械臂逆运动学求解较难、精度较低的问题,在已有海洋捕食者算法(marine predators algorithm,MPA)基础上,引入Tent映射初始化策略、精英反向学习策略、自适应t分布变异机制,提出了改进海洋捕食者算法(IMPA),并将其应用于冗余机械臂逆解求解中。4个典型测试函数的测试结果表明,IMPA的求解精度和计算稳定性比MPA和另一种改进MPA更优;冗余机械臂逆解求解实例结果表明,IMPA的求解速度更快,求解精度和稳定性更佳,机械臂位姿精度提高,位姿误差降低,具有一定优势。

基于对称映射搜索策略的自适应金鹰算法及应用

金鹰优化算法(Golden Eagle Optimizer,GEO)是一种基于种群的元启发式算法,其模拟了金鹰的合作狩猎行为。针对GEO算法中存在的求解精度差和陷入局部最优等问题,文中提出了一种改进MERGEO(Mapped Elitist Reverse GEO)算法。在原算法基础上采用对称映射搜索策略、自适应精英策略和随机反向学习机制这3种方法平衡了算法的探索和开发阶段,获得了规避局部最优能力和较好的优化精度。在10个基准测试函数上对该算法进行独立策略有效性分析、可扩展性分析以及同其他算法的优化性能比较分析。实验结果表明,改进后的MERGEO算法具有较强的竞争力和良好的优化能力。将改进后的算法用于无线传感器网络的覆盖优化问题和压力容器设计问题研究,验证了其实际应用价值。

基于多策略融合灰狼算法的移动机器人路径规划

针对标准灰狼算法(GWO)在解决移动机器人路径规划问题时存在初始参数依赖性强、缺乏多样性及易陷入局部极值的缺陷,提出一种基于多策略融合灰狼算法(LTGWO)。首先运用精英化思想将Logistic-Tent复合混沌映射与反向学习结合,优化灰狼种群分布序列;然后引入sigmoid函数修改收敛因子a,平衡算法全局探索与局部开发能力,并改进控制参数C以更好地拟合灰狼实际捕猎过程;最后加入随适应度值变化的比例权重,提高灰狼个体搜索能力,同时采用种群淘汰策略,淘汰适应度值差的个体,促进种群进化。选用3组不同的栅格地图进行实验,实验结果表明:由LTGWO算法生成的平均路径长度、路径长度标准差都优于对比算法。

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.

轨道车辆补强板冲压成形的过程耦合参数优化

为了减小轨道车辆补强板拉延成形的最大减波率、提高补强板拉延成形质量,提出了基于精英蜂群算法的过程耦合参数优化方法。建立了补强板冲压成形的数值模拟模型,并基于厂家数据对模型精度进行了验证。建立了以表面起皱为约束、最小化最大减波率为目标的优化模型,分析了过程工艺参数的耦合性。通过类比,将过程耦合参数优化问题转化为蜂群算法优化问题。引入了社会群精英学习策略,定义了虚拟精英核的概念,使用基于虚拟精英核的蜜蜂引导更新方式,设计了基于精英蜂群算法的过程耦合参数优化步骤。经试验验证,精英蜂群算法优化后的补强板最大减波率均值比优化前(厂家产品)减小了25.24%,有效提高了补强板拉延成形质量。试验结果验证了精英蜂群算法在补强板拉延参数优化中的优越性。