4.7 Article

A balanced whale optimization algorithm for constrained engineering design problems

期刊

APPLIED MATHEMATICAL MODELLING
卷 71, 期 -, 页码 45-59

出版社

ELSEVIER SCIENCE INC
DOI: 10.1016/j.apm.2019.02.004

关键词

Whale optimization algorithm; Levy flight; Chaotic local search; Fixed-dimension functions; Complex optimization tasks; Welded beam

资金

  1. Science and Technology Plan Project of Wenzhou of China [ZG2017019]
  2. Zhejiang Provincial Natural Science Foundation of China [LY17F020012]
  3. Guangdong Natural Science Foundation [2018A030313339]
  4. Characteristic Innovation Projects of Universities in Guangdong [2017GKTSCX063]
  5. MOE (Ministry of Education in China) Youth Fund Project of Humanities and Social Sciences [17YJCZH261]
  6. National Natural Science Foundation of China [61471133, 61871475]

向作者/读者索取更多资源

In this study, two novel effective strategies composed of Levy flight and chaotic local search are synchronously introduced into the whale optimization algorithm (WOA) to guide the swarm and further promote the harmony between the inclusive exploratory and neighborhood-informed capacities of the conventional technique and investigate the core searching capabilities of WOA in dealing with optimization tasks. However, the conventional WOA may simply be stuck at local optima or the global best may not be obtained successfully when tackling more complex optimization landscapes, including the multimodal and high dimensional scenarios. To substantiate the efficacy of the enhanced method, it is compared to a set of well-regarded variants of particle swarm optimization and differential evolution. The used benchmark problems are composed of unimodal, multimodal, and fixed-dimensions multimodal functions. Additionally, the proposed balanced method is applied to realize three practical, well-known mathematical models such as tension/compression spring, welded beam, pressure vessel design, three-bar truss design, and I-beam design problems. The experimental results and analysis reveal that the proposed algorithm can outperform other competitors in terms of the convergence speed and the quality of solutions. Promisingly, the proposed method can be treated as an effective and efficient auxiliary tool for more complex optimization models and scenarios. (C) 2019 Published by Elsevier Inc.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据