Evolution of new algorithms for the binary knapsack problem

Due to its NP-hard nature, it is still difficult to find an optimal solution for instances of the binary knapsack problem as small as 100 variables. In this paper, we developed a three-level hyper-heuristic framework to generate algorithms for the problem. From elementary components and multiple sets of problem instances, algorithms are generated. The best algorithms are selected to go through a second step process, where they are evaluated with problem instances that differ in size and difficulty. The problem instances are generated according to methods that are found in the literature. In all of the larger problem instances, the generated algorithms have less than 1 % error with respect to the optimal solution. Additionally, generated algorithms are efficient, taking on average fractions of a second to find a solution for any instance, with a standard deviation of 1 s. In terms of structure, hyper-heuristic algorithms are compact in size compared with those in the literature, allowing an in-depth analysis of their structure and their presentation to the scientific world.

[1]  Mohammad Ali Badamchizadeh,et al.  Hybrid particle swarm optimization transplanted into a hyper-heuristic structure for solving examination timetabling problem , 2012, Swarm Evol. Comput..

[2]  David Pisinger,et al.  Where are the hard knapsack problems? , 2005, Comput. Oper. Res..

[3]  Mazhar Ali,et al.  Hyper-Heuristic Approach For Solving Scheduling Problem: A Case Study , 2011 .

[4]  John R. Koza,et al.  Genetic Programming IV: Routine Human-Competitive Machine Intelligence , 2003 .

[5]  Majid Darehmiraki,et al.  Molecular solution to the 0-1 knapsack problem based on DNA computing , 2007, Appl. Math. Comput..

[6]  Riccardo Poli,et al.  A Field Guide to Genetic Programming , 2008 .

[7]  Min Zhang,et al.  Solution to the 0-1 Knapsack Problem based on DNA Encoding and Computing Method , 2013, J. Comput..

[8]  Egon Balas,et al.  An Algorithm for Large Zero-One Knapsack Problems , 1980, Oper. Res..

[9]  Maria Grazia Speranza,et al.  Kernel search: A general heuristic for the multi-dimensional knapsack problem , 2010, Comput. Oper. Res..

[10]  Daniel Bienstock,et al.  Approximate formulations for 0-1 knapsack sets , 2008, Oper. Res. Lett..

[11]  Paolo Toth,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .

[12]  Graham Kendall,et al.  Automating the Packing Heuristic Design Process with Genetic Programming , 2012, Evolutionary Computation.

[13]  Patrick De Causmaecker,et al.  A hyperheuristic approach to examination timetabling problems: benchmarks and a new problem from practice , 2012, J. Sched..

[14]  Graham Kendall,et al.  A Classification of Hyper-heuristic Approaches , 2010 .

[15]  Carlos Castro,et al.  A Flexible and Adaptive Hyper-heuristic Approach for (Dynamic) Capacitated Vehicle Routing Problems , 2012, Fundam. Informaticae.

[16]  Peter Demeester,et al.  One hyper-heuristic approach to two timetabling problems in health care , 2012, J. Heuristics.

[17]  Lance Fortnow,et al.  The status of the P versus NP problem , 2009, CACM.

[18]  Graham Kendall,et al.  A graph coloring constructive hyper-heuristic for examination timetabling problems , 2012, Applied Intelligence.

[19]  Inderveer Chana,et al.  Bacterial foraging based hyper-heuristic for resource scheduling in grid computing , 2013, Future Gener. Comput. Syst..

[20]  Hassan Taghipour,et al.  Solving the 0/1 Knapsack Problem by a Biomolecular DNA Computer , 2013, Adv. Bioinformatics.

[21]  Stephan M. Winkler,et al.  Genetic Algorithms and Genetic Programming - Modern Concepts and Practical Applications , 2009 .

[22]  Rajeev Kumar,et al.  Assessing solution quality of biobjective 0-1 knapsack problem using evolutionary and heuristic algorithms , 2010, Appl. Soft Comput..

[23]  H. Terashima-Marín,et al.  Building General Hyper-Heuristics for Multi-Objective Cutting Stock Problems , 2012 .

[24]  John R. Koza,et al.  Automated synthesis of analog electrical circuits by means of genetic programming , 1997, IEEE Trans. Evol. Comput..

[25]  Graham Kendall,et al.  Hyper-Heuristics: An Emerging Direction in Modern Search Technology , 2003, Handbook of Metaheuristics.

[26]  John R. Koza,et al.  Genetic programming - on the programming of computers by means of natural selection , 1993, Complex adaptive systems.

[27]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .