Meta-heuristic Optimization Algorithms in Multidimensional Knapsack Problem using bat algorithm: A subject review

The multi-dimensional investor or backpack problem is an important and well-known difficult constrained combinatorial optimization problem in operations research and optimization. Nowadays, algorithms inspired by nature have become extremely important in solving many mathematical problems, including the investors portfolio problem. In order to reach the best solutions, this research reviewed the bat algorithm and the updates that occurred to it in solving this problem.