首页> 外文期刊>Journal of supercomputing >Efficient hybrid algorithm based on moth search and fireworks algorithm for solving numerical and constrained engineering optimization problems
【24h】

Efficient hybrid algorithm based on moth search and fireworks algorithm for solving numerical and constrained engineering optimization problems

机译:基于飞蛾搜索和烟花算法的高效混合算法解决数值和约束工程优化问题的算法

获取原文
获取原文并翻译 | 示例
       

摘要

The moth search algorithm (MS) is a novel intelligent optimization algorithm based on moth population behavior, which can solve many problems in different fields. However, the algorithm is easy to fall into local optimization when solving complex optimization problems. This study develops a new hybrid moth search-fireworks algorithm (MSFWA) to solve numerical and constrained engineering optimization problems. The explosion and mutation operators from the fireworks algorithm are introduced into the MS, which not only preserves the advantages of fast convergence and strong exploitation capability of the algorithm, but also significantly enhances the exploration capability. The performance of the MSFWA is tested using 23 benchmark functions. The hybrid algorithm is superior to other highly advanced metaheuristic algorithms for most benchmark functions, demonstrating the characteristics of fast convergence and high stability. Finally, the ability of the MSFWA to solve practical constrained problems is evaluated on six well-known engineering application problems. Compared with other optimization algorithms, the MSFWA is very competitive in its solution of these complex and constrained practical problems.
机译:MOTH搜索算法(MS)是一种基于蛾类人口行为的新型智能优化算法,可以解决不同领域的许多问题。然而,在解决复杂优化问题时,该算法容易下降到局部优化中。本研究开发了一种新的混合蛾搜索 - 烟花算法(MSFWA)来解决数值和约束工程优化问题。从烟花算法的爆炸和突变算子被引入MS,这不仅可以保留了快速收敛性和算法的强开采能力,而且显着提高了勘探能力。使用23个基准函数测试MSFWA的性能。混合算法优于其他高度高级的成群质算法,用于大多数基准功能,展示了快速收敛性和高稳定性的特点。最后,在六种知名工程应用问题上评估了MSFWA解决实际受限问题的能力。与其他优化算法相比,MSFWA在其对这些复杂的解决方案和受限的实际问题的解决方案中非常竞争。

著录项

  • 来源
    《Journal of supercomputing》 |2020年第12期|9404-9429|共26页
  • 作者单位

    Taiyuan Univ Technol Dept Automat Coll Elect & Power Engn 79 Yingze West St Taiyuan 030024 Shanxi Peoples R China;

    Taiyuan Univ Technol Dept Automat Coll Elect & Power Engn 79 Yingze West St Taiyuan 030024 Shanxi Peoples R China;

    Taiyuan Univ Technol Dept Automat Coll Elect & Power Engn 79 Yingze West St Taiyuan 030024 Shanxi Peoples R China;

    Taiyuan Univ Technol Dept Automat Coll Elect & Power Engn 79 Yingze West St Taiyuan 030024 Shanxi Peoples R China;

    Taiyuan Univ Technol Dept Automat Coll Elect & Power Engn 79 Yingze West St Taiyuan 030024 Shanxi Peoples R China|Taiyuan Univ Sci & Technol Sch Elect & Informat Engn Taiyuan 030024 Shanxi Peoples R China;

    Taiyuan Univ Technol Dept Automat Coll Elect & Power Engn 79 Yingze West St Taiyuan 030024 Shanxi Peoples R China;

  • 收录信息 美国《科学引文索引》(SCI);美国《工程索引》(EI);
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

    Constrained engineering optimization problem; Moth search-fireworks algorithm; Exploitation; Exploration; Explosion and mutation operators;

    机译:受限的工程优化问题;蛾查寻 - 烟花算法;剥削;探索;爆炸和突变算子;
  • 入库时间 2022-08-18 21:28:33

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号