An elite opposition-flower pollination algorithm for a 0-1 knapsack problem

The knapsack problem is one of the most studied combinatorial optimisation problems with various practical applications. In this paper, we apply an elite opposition-flower pollination algorithm (EFPA), to solve 0-1 knapsack problem, an NP-hard combinatorial optimisation problem. The performance of the proposed algorithm is tested against a set of benchmarks of knapsack problems. Computational experiments with a set of large-scale instances show that the EFPA can be an efficient alternative for solving 0-1 knapsack problems.

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

[2]  K. Lee,et al.  A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice , 2005 .

[3]  Ioan Cristian Trelea,et al.  The particle swarm optimization algorithm: convergence analysis and parameter selection , 2003, Inf. Process. Lett..

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

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

[6]  Xin-She Yang,et al.  Flower Pollination Algorithm for Global Optimization , 2012, UCNC.

[7]  Gerhard Wäscher,et al.  An improved typology of cutting and packing problems , 2007, Eur. J. Oper. Res..

[8]  Rui Wang,et al.  Elite opposition-based flower pollination algorithm , 2016, Neurocomputing.

[9]  Christopher R. Houck,et al.  A Genetic Algorithm for Function Optimization: A Matlab Implementation , 2001 .

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

[11]  Heitor Silvério Lopes,et al.  Particle Swarm Optimization for the Multidimensional Knapsack Problem , 2007, ICANNGA.

[12]  John E. Beasley,et al.  A Genetic Algorithm for the Multidimensional Knapsack Problem , 1998, J. Heuristics.

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

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

[15]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[16]  George Mavrotas,et al.  Selection among ranked projects under segmentation, policy and logical constraints , 2008, Eur. J. Oper. Res..

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

[18]  Zhang Cui-jun,et al.  Greedy genetic algorithm for solving knapsack problems and its applications , 2007 .

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

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

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

[22]  Xin-She Yang.  Harmony Search as a Metaheuristic Algorithm , 2009 .

[23]  Esra Bas,et al.  A capital budgeting problem for preventing workplace mobbing by using analytic hierarchy process and fuzzy 0-1 bidimensional knapsack model , 2011, Expert Syst. Appl..