An improved monkey algorithm for a 0-1 knapsack problem

The flow chart of CGMA. The 0-1 knapsack problem is a classic combinational optimization problem.The monkey algorithm (MA) is a novel swarm intelligent based algorithm.This paper proposed a binary version of the monkey algorithm for solving 0-1 knapsack problem.The result of the proposed algorithm provides better results in solving the 0-1 knapsack problem compared with the other solving methods. The 0-1 knapsack problem is a classic combinational optimization problem. However, many exiting algorithms have low precision and easily fall into local optimal solutions to solve the 0-1 knapsack problem. In order to overcome these problems, this paper proposes a binary version of the monkey algorithm where the greedy algorithm is used to strengthen the local search ability, the somersault process is modified to avoid falling into local optimal solutions, and the cooperation process is adopted to speed up the convergence rate of the algorithm. To validate the efficiency of the proposed algorithm, experiments are carried out with various data instances of 0-1 knapsack problems and the results are compared with those of five metaheuristic algorithms.

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

[2]  Suzhen Wang,et al.  Improved Simulated Annealing Algorithm Solving for 0/1 Knapsack Problem , 2006, Sixth International Conference on Intelligent Systems Design and Applications.

[3]  GU Qian-qian.  Solving knapsack problem based on discrete particle swarm optimization , 2007 .

[4]  Chen Xi.  Hybrid Algorithm Based on Monkey Algorithm and Simple Method , 2013 .

[5]  Yongquan Zhou,et al.  A Hybrid Monkey Search Algorithm for Clustering Analysis , 2014, TheScientificWorldJournal.

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

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

[8]  Fred W. Glover.  Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems , 2013, Eur. J. Oper. Res..

[9]  Chou-Yuan Lee,et al.  A New Approach for Solving 0/1 Knapsack Problem , 2006, 2006 IEEE International Conference on Systems, Man and Cybernetics.

[10]  Lei Wu,et al.  New upper bounds and exact methods for the knapsack sharing problem , 2014, Appl. Math. Comput..

[11]  Feng-Tse Lin,et al.  Solving the knapsack problem with imprecise weight coefficients using genetic algorithms , 2008, Eur. J. Oper. Res..

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

[13]  Asaf Levin,et al.  Adaptivity in the stochastic blackjack knapsack problem , 2014, Theor. Comput. Sci..

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

[15]  Adil Baykasoglu,et al.  An improved firefly algorithm for solving dynamic multidimensional knapsack problems , 2014, Expert Syst. Appl..

[16]  Francisco J. Rodríguez,et al.  Tabu-enhanced iterated greedy algorithm: A case study in the quadratic multiple knapsack problem , 2014, Eur. J. Oper. Res..

[17]  Sebastian Sitarz.  Multiple criteria dynamic programming and multiple knapsack problem , 2014, Appl. Math. Comput..

[18]  Hongnan Li,et al.  A modified monkey algorithm for optimal sensor placement in structural health monitoring , 2012 .

[19]  Wansheng Tang,et al.  Monkey Algorithm for Global Numerical Optimization , 2008 .

[20]  Tugba Saraç,et al.  Generalized quadratic multiple knapsack problem and two solution approaches , 2014, Comput. Oper. Res..

[21]  Sun Ji-zhou,et al.  Intrusion Detection Technology Based on Monkey Algorithm , 2011 .

[22]  Gaige Wang,et al.  An Effective Hybrid Cuckoo Search Algorithm with Improved Shuffled Frog Leaping Algorithm for 0-1 Knapsack Problems , 2014, Comput. Intell. Neurosci..

[23]  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..

[24]  Yang Xiao-zong.  Virus-evolutionary particle swarm optimization algorithm for knapsack problem , 2009 .

[25]  Lei Fang,et al.  A Quantum-Inspired Artificial Immune System for Multiobjective 0-1 Knapsack Problems , 2010, ISNN.

[26]  J. Spall.  Multivariate stochastic approximation using a simultaneous perturbation gradient approximation , 1992 .

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

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

[29]  Yixin Yu,et al.  Discrete monkey algorithm and its application in transmission network expansion planning , 2010, IEEE PES General Meeting.

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