.png){kind=icon}
返回
Solving 0-1 knapsack problems by chaotic monarch butterfly optimization algorithm with Gaussian mutation
.png){kind=icon}
PRE
AI
DOI：10.1007/s12293-016-0211-4.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Recently, inspired by the migration behavior of monarch butterflies in nature, a metaheuristic optimization algorithm, called monarch butterfly optimization (MBO), was proposed. In the present study, a novel chaotic MBO algorithm (CMBO) is proposed, in which chaos theory is introduced in order to enhance its global optimization ability. Here, 12 one-dimensional classical chaotic maps are used to tune two main migration processes of monarch butterflies. Meanwhile, applying Gaussian mutation operator to some worst individuals can effectively prevent premature convergence of the optimization process. The performance of CMBO is verified and analyzed by three groups of large-scale 0-1 knapsack problems instances. The results show that the introduction of appropriate chaotic map and Gaussian perturbation can significantly improve the solution quality together with the overall performance of the proposed CMBO algorithm. The proposed CMBO can outperform the standard MBO and other eight state-of-the-art canonical algorithms.
Keyword:
Monarch butterfly optimization
Chaotic maps
Gaussian mutation operator
0-1 Knapsack problems
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.3
论文数:
458
被引数:
718
机构
引用论文
.png){kind=icon}
分享收藏
Use of chaotic sequences in a biologically inspired algorithm for engineering design optimization
PREAI
分享收藏
查看更多内容