.png){kind=icon}
返回
Enhanced Moth Search Algorithm for the Set-Union Knapsack Problems
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2019.2956839.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
As an important and novel model with multitudinous practical applications, the set-union knapsack problem (SUKP) is a challenging issue in combinatorial optimization. In this paper, we present an enhanced moth search algorithm (EMS) for solving SUKP, which introduces an enhanced interaction operator (EIO) by integrating differential mutation into the global harmony search and then Levy flight is replaced by EIO. Comparative experimental results, which were conducted on three types of 30 popular SUKP benchmark instances, demonstrate that EMS algorithm is superior to or competitive with the other state-of-the-art metaheuristic algorithm. In particular, EMS reaches the best-known solutions for the great majority of test instances and improves the best-known solutions for six instances. Two critical ingredients of EIO is investigated to confirm their impact on the performance of EMS. The results show that both components have an important role in improving the performance of EMS.
Keyword:
Differential mutation
global harmony search
moth search algorithm
set-union knapsack problem
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
Moth-flame optimization algorithm: A novel nature-inspired heuristic paradigm蛾焰优化算法: 一种新的自然启发启发式范式
PREAI
分享收藏分享收藏Hybridizing harmony search algorithm with cuckoo search for global numerical optimization混合和声搜索算法与布谷鸟搜索的全局数值优化.png)
SOFT COMPUTING
SOFT COMPUTINGIF2.5
PREAI
分享收藏Deep Brain Stimulation in Persistent Vegetative States: Ethical Issues Governing Decision MakingOAAI
OAAI分享收藏
查看更多内容