An Efficient Hyperheuristic for Strip-Packing Problems

In this paper we introduce a hyperheuristic to solve hard strip packing problems. The hyperheuristic manages a sequence of greedy low-level heuristics, each element of the sequence placing a given number of objects. A low-level solution is built by placing the objects following the sequence of low-level heuristics. The hyperheuristic performs a hill-climbing algorithm on this sequence by testing different moves (adding, removing, replacing a low-level heuristic). The results we obtained are very encouraging and improve the results from the single heuristics tests. Thus, we conclude that the collaboration among heuristics is an interesting approach to solve hard strip packing problems.

[1]  Ansheng Deng,et al.  A new heuristic recursive algorithm for the strip rectangular packing problem , 2006, Comput. Oper. Res..

[2]  Lakhdar Sais,et al.  Light Integration of Path Consistency for Solving CSPs , 2007 .

[3]  Graham Kendall,et al.  A New Placement Heuristic for the Orthogonal Stock-Cutting Problem , 2004, Oper. Res..

[4]  Ramón Alvarez-Valdés,et al.  Reactive GRASP for the strip-packing problem , 2008, Comput. Oper. Res..

[5]  Graham Kendall,et al.  An investigation of a hyperheuristic genetic algorithm applied to a trainer scheduling problem , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[6]  Juan Julián Merelo Guervós,et al.  Parallel Problem Solving from Nature - PPSN IX: 9th International Conference, Reykjavik, Iceland, September 9-13, 2006, Proceedings , 2006, PPSN.

[7]  E. Hopper,et al.  An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem , 2001, Eur. J. Oper. Res..

[8]  Robert E. Tarjan,et al.  Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms , 1980, SIAM J. Comput..

[9]  B. Neveu,et al.  Incremental Move for 2D Strip-Packing , 2007, 19th IEEE International Conference on Tools with Artificial Intelligence(ICTAI 2007).

[10]  Graham Kendall,et al.  Hyperheuristics: A Robust Optimisation Method Applied to Nurse Scheduling , 2002, PPSN.

[11]  Bertrand Neveu.  Incremental Move for Strip-Packing , 2007 .

[12]  Hermann Gehring,et al.  New Large Benchmark Instances for the Two-Dimensional Strip Packing Problem with Rectangular Pieces , 2006, Proceedings of the 39th Annual Hawaii International Conference on System Sciences (HICSS'06).

[13]  Eva Hopper,et al.  Two-dimensional Packing utilising Evolutionary Algorithms and other Meta-Heuristic Methods , 2002 .

[14]  Andreas Bortfeldt,et al.  A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces , 2006, Eur. J. Oper. Res..

[15]  Ronald L. Rivest,et al.  Orthogonal Packings in Two Dimensions , 1980, SIAM J. Comput..

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

[17]  Bernard Chazelle,et al.  The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation , 1983, IEEE Transactions on Computers.

[18]  Manuel Iori,et al.  Metaheuristic Algorithms for the Strip Packing Problem , 2003 .

[19]  Daniele Vigo,et al.  An Exact Approach to the Strip-Packing Problem , 2003, INFORMS J. Comput..

[20]  Pearl Y. Wang,et al.  Heuristics for Large Strip Packing Problems with Guillotine Patterns: an Empirical Study , 2001 .

[21]  Michael Mitzenmacher,et al.  BubbleSearch: A simple heuristic for improving priority-based greedy algorithms , 2006, Inf. Process. Lett..

[22]  Justin Zobel,et al.  Using random sampling to build approximate tries for efficient string sorting , 2004, JEAL.

[23]  Joe Marks,et al.  Exhaustive approaches to 2D rectangular perfect packings , 2004, Inf. Process. Lett..

[24]  Joe Marks,et al.  New heuristic and interactive approaches to 2D rectangular strip packing , 2005, JEAL.