Generating single and multiple cooperative heuristics for the one dimensional bin packing problem using a single node genetic programming island model

Novel deterministic heuristics are generated using Single Node Genetic Programming for application to the One Dimensional Bin Packing Problem. First a single deterministic heuristic was evolved that minimised the total number of bins used when applied to a set of 685 training instances. Following this, a set of heuristics were evolved using a form of cooperative co-evolution that collectively minimise the number of bins used across the same set of problems. Results on an unseen test set comprising a further 685 problem instances show that the single evolved heuristic outperforms existing deterministic heuristics described in the literature. The collection of heuristics evolved by cooperative co-evolution outperforms any of the single heuristics, including the newly generated ones.

[1]  Claire Mathieu,et al.  A Self Organizing Bin Packing Heuristic , 1999, ALENEX.

[2]  Ben Paechter,et al.  A Hyper-Heuristic Classifier for One Dimensional Bin Packing Problems: Improving Classification Accuracy by Attribute Evolution , 2012, PPSN.

[3]  Gerhard Wäscher,et al.  The bin-packing problem: A problem generator and some numerical experiments with FFD packing and MTP , 1997 .

[4]  Matthias Fuchs,et al.  High Performance ATP Systems by Combining Several AI Methods , 1997, IJCAI.

[5]  Emanuel Falkenauer,et al.  A hybrid grouping genetic algorithm for bin packing , 1996, J. Heuristics.

[6]  Peter Ross,et al.  Hyper-heuristics: Learning To Combine Simple Heuristics In Bin-packing Problems , 2002, GECCO.

[7]  David Jackson,et al.  A New, Node-Focused Model for Genetic Programming , 2012, EuroGP.

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

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

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

[11]  Graham Kendall,et al.  Evolving Bin Packing Heuristics with Genetic Programming , 2006, PPSN.

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

[13]  David Jackson,et al.  Single Node Genetic Programming on Problems with Side Effects , 2012, PPSN.

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

[15]  Claire Mathieu,et al.  On the Sum-of-Squares algorithm for bin packing , 2002, JACM.

[16]  Ian P. Gent.  Heuristic Solution of Open Bin Packing Problems , 1998, J. Heuristics.

[17]  Michel Gendreau,et al.  Hyper-heuristics: a survey of the state of the art , 2013, J. Oper. Res. Soc..

[18]  Kenneth A. De Jong,et al.  Cooperative Coevolution: An Architecture for Evolving Coadapted Subcomponents , 2000, Evolutionary Computation.

[19]  Frederick Ducatelle,et al.  Ant colony optimization and local search for bin packing and cutting stock problems , 2004, J. Oper. Res. Soc..

[20]  Graham Kendall,et al.  A Hyperheuristic Approach to Scheduling a Sales Summit , 2000, PATAT.

[21]  Armin Scholl,et al.  Bison: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem , 1997, Comput. Oper. Res..

[22]  Peter Ross,et al.  Learning a Procedure That Can Solve Hard Bin-Packing Problems: A New GA-Based Approach to Hyper-heuristics , 2003, GECCO.