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.

[1]  Ma Liang.  Artificial glowworm swarm optimization algorithm for 0-1 knapsack problem , 2013 .

[2]  Abdesslem Layeb,et al.  A hybrid quantum inspired harmony search algorithm for 0-1 optimization problems , 2013, J. Comput. Appl. Math..

[3]  Xin Chen,et al.  An improved monkey algorithm for a 0-1 knapsack problem , 2016, Appl. Soft Comput..

[4]  Chaokun Yan,et al.  A Hybrid Algorithm Based on Tabu Search and Chemical Reaction Optimization for 0-1 Knapsack Problem , 2015, ICSI.

[5]  Anand Jayant Kulkarni,et al.  Solving 0–1 Knapsack Problem using Cohort Intelligence Algorithm , 2016, Int. J. Mach. Learn. Cybern..

[6]  De-peng Du,et al.  Greedy Strategy Based Self-adaption Ant Colony Algorithm for 0/1 Knapsack Problem , 2015 .

[7]  Yongquan Zhou,et al.  A Complex-valued Encoding Bat Algorithm for Solving 0–1 Knapsack Problem , 2015, Neural Processing Letters.

[8]  Sen Zhang,et al.  A complex-valued encoding wind driven optimization for the 0-1 knapsack problem , 2017, Applied Intelligence.

[9]  R. S. Pavithr,et al.  Quantum Inspired Social Evolution (QSE) algorithm for 0-1 knapsack problem , 2016, Swarm Evol. Comput..

[10]  Salim Chikhi,et al.  Solving 0-1 knapsack problems by a discrete binary version of cuckoo search algorithm , 2012, Int. J. Bio Inspired Comput..

[11]  Hedieh Sajedi,et al.  Cognitive discrete gravitational search algorithm for solving 0-1 knapsack problem , 2015 .

[12]  Paolo Toth,et al.  New trends in exact algorithms for the 0-1 knapsack problem , 2000, Eur. J. Oper. Res..

[13]  Rajat Kumar Pal,et al.  An Ant colony optimization approach for binary knapsack problem under fuzziness , 2013, Appl. Math. Comput..

[14]  Seyedali Mirjalili,et al.  Dragonfly algorithm: a new meta-heuristic optimization technique for solving single-objective, discrete, and multi-objective problems , 2015, Neural Computing and Applications.

[15]  Jianchen Wan,et al.  Improved hybrid adaptive genetic algorithm for solving knapsack problem , 2011, 2011 2nd International Conference on Intelligent Control and Information Processing.

[16]  Hui Cheng,et al.  Solving 0-1 knapsack problem by greedy degree and expectation efficiency , 2016, Appl. Soft Comput..

[17]  Mohammed Azmi Al-Betar,et al.  Taming the 0/1 knapsack problem with monogamous pairs genetic algorithm , 2016, Expert Syst. Appl..

[18]  Min Kong,et al.  Apply the Particle Swarm Optimization to the Multidimensional Knapsack Problem , 2006, ICAISC.

[19]  Jianhua Wu,et al.  Solving 0-1 knapsack problem by a novel global harmony search algorithm , 2011, Appl. Soft Comput..

[20]  Anass Nagih,et al.  0–1 Knapsack Problems , 2014 .

[21]  Tung Khac Truong,et al.  A New Hybrid Particle Swarm Optimization and Greedy for 0-1 Knapsack Problem , 2016 .

[22]  Ke Jia,et al.  An Improved Hybrid Encoding Cuckoo Search Algorithm for 0-1 Knapsack Problems , 2014, Comput. Intell. Neurosci..

[23]  Maw-Sheng Chern,et al.  A binary particle swarm optimization based on the surrogate information with proportional acceleration coefficients for the 0-1 multidimensional knapsack problem , 2016 .

[24]  Megha Gupta.  A Fast and Efficient Genetic Algorithm to Solve 0-1 Knapsack Problem , 2013 .

[25]  Steven Li,et al.  A simplified binary harmony search algorithm for large scale 0-1 knapsack problems , 2015, Expert Syst. Appl..

[26]  Kusum Deep,et al.  A Modified Binary Particle Swarm Optimization for Knapsack Problems , 2012, Appl. Math. Comput..

[27]  Longquan Yong,et al.  A Novel Harmony Search Algorithm Based on Teaching-Learning Strategies for 0-1 Knapsack Problems , 2014, TheScientificWorldJournal.

[28]  Yan Yang,et al.  Artificial Glowworm Swarm Optimization Algorithm for Solving 0-1 Knapsack Problem , 2010 .

[29]  Ruichun He,et al.  A Novel Discrete Global-Best Harmony Search Algorithm for Solving 0-1 Knapsack Problems , 2014 .

[30]  Kenli Li,et al.  Solving 0 - 1 knapsack problem by artificial chemical reaction optimization algorithm with a greedy strategy , 2015, J. Intell. Fuzzy Syst..

[31]  Abdesslem Layeb,et al.  A novel quantum inspired cuckoo search for knapsack problems , 2011, Int. J. Bio Inspired Comput..

[32]  Zhao Fang,et al.  Solving 0-1 Knapsack Problem Based on Immune Clonal Algorithm and Ant Colony Algorithm , 2013 .

[33]  Andrew B. Kahng,et al.  The Knapsack Problem , 2016 .