[ACM Press the 13th annual conference companion - Dublin, Ireland (2011.07.12-2011.07.16)] Proceedings of the 13th annual conference companion on Genetic and evolutionary computation - GECCO '11 - A hyper-heuristic for solving one and two-dimensional bin packing problems

✍ Scribed by López-Camacho, Eunice; Terashima-Marín, Hugo; Ross, Peter

• Book ID: 121506642
• Publisher: ACM Press
• Year: 2011
• Weight: 437 KB
• Category: Article
• ISBN: 145030690X
• DOI: 10.1145/2001858.2002003

✦ Synopsis

The idea behind hyper-heuristics is to discover rules that relate different problem states with the best single heuristic to apply. This investigation works towards extending the problem domain in which a given hyper-heuristic can be applied and implements a framework to generate hyperheuristics for a wider range of bin packing problems. We present a GA-based method that produces general hyperheuristics that solve a variety of instances of one-and twodimensional bin packing problem without further parameter tuning. The two-dimensional problem instances considered deal with rectangles, convex and non-convex polygons.