Hybrid Learning Moth Search Algorithm for Solving Multidimensional Knapsack Problems

Hybrid Learning Moth Search Algorithm for Solving Multidimensional Knapsack Problems

The moth search algorithm (MS) is a relatively new metaheuristic optimization algorithm which mimics the phototaxis and Lévy flights of moths. Being an NP-hard problem, the 0–1 multidimensional knapsack problem (MKP) is a classical multi-constraint complicated combinatorial optimization problem with...

Full description

Bibliographic Details
Main Authors: Yanhong Feng, Hongmei Wang, Zhaoquan Cai, Mingliang Li, Xi Li
Format: Article
Language:English
Published: MDPI AG 2023-04-01
Series:Mathematics
Subjects:
combinatorial optimization
multidimensional knapsack problem
metaheuristic
moth search algorithm
Baldwinian learning
global-best harmony search
Online Access:https://www.mdpi.com/2227-7390/11/8/1811

Internet

https://www.mdpi.com/2227-7390/11/8/1811

Similar Items