.png){kind=icon}
Return
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}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Differential mutation
global harmony search
moth search algorithm
set-union knapsack problem
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.6
Papers:
9.8W
Citations:
29.4W
Organization
View more organizations
Cited Papers
ShareSaveHybridizing harmony search algorithm with cuckoo search for global numerical optimization.png)
SOFT COMPUTING
SOFT COMPUTINGIF2.5
PREAI
ShareSaveShareSaveDeep Brain Stimulation in Persistent Vegetative States: Ethical Issues Governing Decision MakingOAAI
OAAIShareSaveShareSaveShareSave View more