Summary
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.
This work was partially financed by the Fondecyt Project 1060377.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Alvarez-Valdes, R., Parre\(\tilde{n}\)o, F., Tamarit, J.M.: Reactive grasp for the strip packing problem. In: Proceedings Metaheuristic Conference MIC (2005)
Baker, B.S., Coffman, E.G., Rivest, R.L.: Orthogonal packings in two dimensions. SIAM Journal on Computing 9, 846–855 (1980)
Bortfeldt, A.: A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces. European Journal of Operational Research 172, 814–837 (2006)
Bortfeldt, A., Gehring, H.: New large benchmarks for the two-dimensional strip packing problem with rectangular pieces. In: IEEE Proceedings of the 39th Hawaii International Conference on Systems Sciences (2006)
Burke, E., Kendall, G., Newall, J., Hart, E., Ross, P., Schulenburg, S.: Hyper-heuristics: an emerging direction in modern search technology. Handbook of Metaheuristics 16, 457–474 (2003)
Burke, E., Kendall, G., Whitwell, G.: A new placement heuristic for the orthogonal stock-cutting problem. Operations Research 52, 697–707 (2004)
Burke, E., Kendall, G., Whitwell, G.: Metaheuristic enhancements of the best-fit heuristic for the orthogonal stock cutting problem. Technical report, Univ. of Nottingham, Computer Science Technical Report No. NOTTCS-TR-2006-3 (2006)
Chazelle, B.: The bottom left bin packing heuristic: an efficient implementation. IEEE Transactions on Computers 32, 697–707 (1983)
Cowling, P., Kendall, G., Han, L.: An investigation of a hyperheuristic genetic algorithm applied to a trainer scheduling problem. In: Congress on Evolutionary Computation, CEC 2002, pp. 1185–1190 (2002)
Cowling, P., Kendall, G., Soubeiga, E.: Hyperheuristics: A robust optimisation method applied to nurse scheduling. In: Guervós, J.J.M., Adamidis, P.A., Beyer, H.-G., Fernández-Villacañas, J.-L., Schwefel, H.-P. (eds.) PPSN 2002. LNCS, vol. 2439, pp. 7–11. Springer, Heidelberg (2002)
Hopper, E.: Two-Dimensional Packing Utilising Evolutionary Algorithms and other Meta-Heuristic Methods. PhD. Thesis Cardiff University (2000)
Hopper, E., Turton, B.C.H.: An empirical investigation on metaheuristic and heuristic algorithms for a 2d packing problem. European Journal of Operational Research 128, 34–57 (2001)
Iori, M., Martello, S., Monaci, M.: Metaheuristic algorithms for the strip packing problem, pp. 159–179. Kluwer Academic Publishers, Dordrecht (2003)
Coffmann Jr., E., Garey, D., Tarjan, R.: Performance bounds for level oriented two-dimensional packing algorithms. SIAM Journal on Computing 9(1), 808–826 (1980)
Lesh, N., Marks, J., Mahon, A.Mc., Mitzenmacher, M.: Exhaustive approaches to 2d rectangular perfect packings. Information Processing Letters 90, 7–14 (2004)
Lesh, N., Marks, J., Mahon, A.M., Mitzenmacher, M.: New heuristic and interactive approaches to 2d rectangular strip packing. ACM Journal of Experimental Algorithmics 10, 1–18 (2005)
Lesh, N., Mitzenmacher, M.: Bubble search: A simple heuristic for improving priority-based greedy algorithms. Information Processing Letters 97, 161–169 (2006)
Martello, S., Monaci, M., Vigo, D.: An exact approach to the strip-packing problem. INFORMS Journal of Computing 15, 310–319 (2003)
Mumford-Valenzuela, C., Vick, J., Wang, P.Y.: Heuristics for large strip packing problems with guillotine patterns:An empirical study, pp. 501–522. Kluwer Academic Publishers, Dordrecht (2003)
Neveu, B., Trombettoni, G., Araya, I.: Incremental move for strip-packing. In: Proceedings of ICTAI 2007, Patras, Greece (2007)
Zhang, D., Kang, Y., Deng, A.: A new heuristic recursive algorithm for the strip rectangular packing problem. Computers and Operations Research 33, 2209–2217 (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Araya, I., Neveu, B., Riff, MC. (2008). An Efficient Hyperheuristic for Strip-Packing Problems. In: Cotta, C., Sevaux, M., Sörensen, K. (eds) Adaptive and Multilevel Metaheuristics. Studies in Computational Intelligence, vol 136. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79438-7_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-79438-7_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-79437-0
Online ISBN: 978-3-540-79438-7
eBook Packages: EngineeringEngineering (R0)