Solving 0-1 Knapsack Problems by Binary Dragonfly Algorithm

摘要

The 0-1 knapsack problem (0-1KP) is a well-known combinatorial optimization problem. It is an NP-hard problem which plays significant roles in many real life applications. Dragonfly algorithm (DA) a novel swarm intelligence optimization algorithm, inspired by the nature of static and dynamic swarming behaviors of dragonflies. DA has demonstrated excellent performance in solving multimodal continuous problems and engineering optimization problems. This paper proposes a binary version of dragonfly algorithm (BDA) to solve 0-1 knapsack problem. Experimental results have proven the superior performance of BDA compared with other algorithms in literature.