A Discrete Improved Artificial Bee Colony Algorithm for 0–1 Knapsack Problem

The present study integrated a discrete search equation to develop a discrete improved artificial bee colony (DiABC) algorithm. A random binary population was added in the initialization. The current optimal solution was then introduced into the search equations for worker and onlooker bees to effectively enhance the convergence accuracy of the algorithm. And a new selection method on scout bees was proposed. Eighteen benchmark knapsack problems (KPs) experiments were conducted, of which the results validated the effectiveness of the DiABC algorithm in optimizing the KPs.

[1]  Thomas Stützle,et al.  Frankenstein's PSO: A Composite Particle Swarm Optimization Algorithm , 2009, IEEE Transactions on Evolutionary Computation.

[2]  D. FAYARD,et al.  Resolution of the 0–1 knapsack problem: Comparison of methods , 1975, Math. Program..

[3]  Jing J. Liang,et al.  Comprehensive learning particle swarm optimizer for global optimization of multimodal functions , 2006, IEEE Transactions on Evolutionary Computation.

[4]  Dervis Karaboga,et al.  AN IDEA BASED ON HONEY BEE SWARM FOR NUMERICAL OPTIMIZATION , 2005 .

[5]  Yun Shang,et al.  A Note on the Extended Rosenbrock Function , 2006 .

[6]  Shuji Hashimoto,et al.  Landscape analyses and global search of knapsack problems , 2000, Smc 2000 conference proceedings. 2000 ieee international conference on systems, man and cybernetics. 'cybernetics evolving to systems, humans, organizations, and their complex interactions' (cat. no.0.

[7]  Hanxiao Shi,et al.  Solution to 0/1 Knapsack Problem Based on Improved Ant Colony Algorithm , 2006, 2006 IEEE International Conference on Information Acquisition.

[8]  Arthur C. Sanderson,et al.  Adaptive Differential Evolution , 2009 .

[9]  José Neves,et al.  The fully informed particle swarm: simpler, maybe better , 2004, IEEE Transactions on Evolutionary Computation.

[10]  Ali Husseinzadeh Kashan,et al.  DisABC: A new artificial bee colony algorithm for binary optimization , 2012, Appl. Soft Comput..

[11]  Andries Petrus Engelbrecht,et al.  Binary artificial bee colony optimization , 2011, 2011 IEEE Symposium on Swarm Intelligence.

[12]  Zhu Ying,et al.  DNA ligation design and biological realization of knapsack problem , 2009 .

[13]  Ana Maria A. C. Rocha,et al.  A simplified binary artificial fish swarm algorithm for 0-1 quadratic knapsack problems , 2014, J. Comput. Appl. Math..

[14]  P. N. Suganthan,et al.  Differential Evolution Algorithm With Strategy Adaptation for Global Numerical Optimization , 2009, IEEE Transactions on Evolutionary Computation.

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

[16]  G. Dantzig.  Discrete-Variable Extremum Problems , 1957 .

[17]  Zhao Jian-ying.  Nonlinear Reductive Dimension Approximate Algorithm for 0-1 Knapsack Problem , 2007 .

[18]  Sanyang Liu,et al.  A Novel Artificial Bee Colony Algorithm for Function Optimization , 2015 .

[19]  FU Yongjun.  On the Sequential Combination Tree Algorithm for 0-1 Knapsack Problem , 2008 .

[20]  F. Farokhi,et al.  A novel artificial bee colony algorithm for the knapsack problem , 2012, 2012 International Symposium on Innovations in Intelligent Systems and Applications.

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

[22]  Sam Kwong,et al.  Gbest-guided artificial bee colony algorithm for numerical function optimization , 2010, Appl. Math. Comput..

[23]  Lingling Huang,et al.  Enhancing artificial bee colony algorithm using more information-based search equations , 2014, Inf. Sci..

[24]  Sarada Prasad Sarmah,et al.  Shuffled frog leaping algorithm and its application to 0/1 knapsack problem , 2014, Appl. Soft Comput..

[25]  Tinglei Huang,et al.  Genetic Algorithm Based on Greedy Strategy in the 0-1 Knapsack Problem , 2009, 2009 Third International Conference on Genetic and Evolutionary Computing.

[26]  You Wei.  Study of Greedy-policy-based Algorithm for 0/1 Knapsack Problem , 2007 .

[27]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[28]  Jun Zhang,et al.  Orthogonal Learning Particle Swarm Optimization , 2009, IEEE Transactions on Evolutionary Computation.

[29]  Janez Brest,et al.  Self-Adapting Control Parameters in Differential Evolution: A Comparative Study on Numerical Benchmark Problems , 2006, IEEE Transactions on Evolutionary Computation.

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

[31]  Saman K. Halgamuge,et al.  Self-organizing hierarchical particle swarm optimizer with time-varying acceleration coefficients , 2004, IEEE Transactions on Evolutionary Computation.