Nature-inspired optimization algorithms in knapsack problem: A review


Meta-heuristic algorithms have become an arising field of research in recent years. Some of these algorithms have proved to be efficient in solving combinatorial optimization problems, particularly knapsack problem. In this paper, four meta-heuristic algorithms are presented particle swarm optimization, firefly algorithm, flower pollination algorithm and monarch butterfly optimization in solving knapsack problem as example of NP-hard combinational optimization problems. Based on twenty 0-1 knapsack problem instances, the computational results demonstrated that the binary flower pollination algorithm has the ability to find the best solutions in reasonable time.