首页> 外文期刊>Computational intelligence and neuroscience >A Hybrid SSA and SMA with Mutation Opposition-Based Learning for Constrained Engineering Problems
【24h】

A Hybrid SSA and SMA with Mutation Opposition-Based Learning for Constrained Engineering Problems

机译:基于突变对立学习的SSA和SMA混合制约工程问题

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

Based on Salp Swarm Algorithm (SSA) and Slime Mould Algorithm (SMA), a novel hybrid optimization algorithm, named Hybrid Slime Mould Salp Swarm Algorithm (HSMSSA), is proposed to solve constrained engineering problems. SSA can obtain good results in solving some optimization problems. However, it is easy to suffer from local minima and lower density of population. SMA specializes in global exploration and good robustness, but its convergence rate is too slow to find satisfactory solutions efficiently. Thus, in this paper, considering the characteristics and advantages of both the above optimization algorithms, SMA is integrated into the leader position updating equations of SSA, which can share helpful information so that the proposed algorithm can utilize these two algorithms' advantages to enhance global optimization performance. Furthermore, Levy flight is utilized to enhance the exploration ability. It is worth noting that a novel strategy called mutation opposition-based learning is proposed to enhance the performance of the hybrid optimization algorithm on premature convergence avoidance, balance between exploration and exploitation phases, and finding satisfactory global optimum. To evaluate the efficiency of the proposed algorithm, HSMSSA is applied to 23 different benchmark functions of the unimodal and multimodal types. Additionally, five classical constrained engineering problems are utilized to evaluate the proposed technique's practicable abilities. The simulation results show that the HSMSSA method is more competitive and presents more engineering effectiveness for real-world constrained problems than SMA, SSA, and other comparative algorithms. In the end, we also provide some potential areas for future studies such as feature selection and multilevel threshold image segmentation.
机译:该文在Salp Swarm算法(SSA)和Slime Mould算法(SMA)的基础上,提出了一种新的混合优化算法,即Hybrid Slime Mould Salp Swarm Algorithm(HSMSSA),用于求解约束工程问题。SSA在解决一些优化问题时可以获得良好的效果。然而,它很容易受到局部最小值和人口密度较低的影响。SMA专注于全局探索,鲁棒性好,但收敛速度太慢,无法有效找到满意的解决方案。因此,该文综合考虑上述两种优化算法的特点和优势,将SMA集成到SSA的领先位置更新方程中,可以共享有用的信息,使所提算法能够利用这两种算法的优势来增强全局寻优性能。此外,利用Levy飞行来增强勘探能力。值得一提的是,该文提出了一种名为基于突变反对的学习策略,以增强混合优化算法在过早收敛、探索和利用阶段之间的平衡以及找到令人满意的全局最优方面的性能。为了评估所提算法的有效性,将HSMSSA应用于单模态和多模态类型的23个不同的基准函数。此外,利用5个经典约束工程问题对所提技术的实用能力进行了评价。仿真结果表明,与SMA、SSA等比较算法相比,HSMSSA方法在实际约束问题中更具竞争力,工程效率更高。最后,我们还为未来的研究提供了一些潜在的领域,如特征选择和多级阈值图像分割。

著录项

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号