Abstract
In this paper we proposed a local search heuristic and a genetic algorithm to solve the two-dimensional irregular multiple bin-size bin packing problem. The problem consists of placing a set of pieces represented as 2D polygons in rectangular bins with different dimensions such that the total area of bins used is minimized. Most packing algorithms available in the literature for 2D irregular bin packing consider single size bins only. However, for many industries the material can be supplied in a number of standard size sheets, for example, metal, foam, plastic and timber sheets. For this problem, the cut plans must decide the set of standard size stock sheets as well as which pieces to cut from each bin and how to arrange them in order to minimise waste material. Moreover, the literature constrains the orientation of pieces to a single or finite set of angles. This is often an artificial constraint that makes the solution space easier to navigate. In this paper we do not restrict the orientation of the pieces. We show that the local search heuristic and the genetic algorithm can address all of these decisions and obtain good solutions, with the local search performing better. We also discuss the affect of different groups of stock sheet sizes.
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
Abeysooriya, R.P., Bennell, J.A., Martinez-Sykora, A.: Jostle heuristic for 2D-irregular shaped packing problems with free rotation. In: 27th European Conference on Operational Research (2015)
Alvarez-Valdes, R., Parreño, F., Tamarit, J.M.: A GRASP/Path Relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems. Computers & Operations Research 40, 3081–3090 (2013)
Babu, A.R., Babu, N.R.: Effective nesting of rectangular parts in multiple rectangular sheets using genetic and heuristic algorithms. International Journal of Production Research 37(7), 1625–1643 (1999)
Babu, A.R., Babu, N.R.: A generic approach for nesting of 2-D parts in 2-D sheets using genetic and heuristic algorithms. Computer-Aided Design 33(12), 879–891 (2001)
Baldacci, R., Boschetti, M.A., Ganovelli, M., Maniezzo, V.: Algorithms for nesting with defects. Discrete Applied Mathematics 163, 17–33 (2014). Part 1
Bennell, J.A., Dowsland, K.A.: Hybridising Tabu Search with Optimisation Techniques for Irregular Stock Cutting. Management Science 47(8), 1160–1172 (2001)
Bennell, J.A., Oliveira, J.F.: A Tutorial in Irregular Shape Packing Problems. The Journal of the Operational Research Society 60, s93–s105 (2009)
Bennell, J.A., Song, X.: A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums. Computers & Operations Research 35(1), 267–281 (2008)
Bennell, J.A., Song, X.: A beam search implementation for the irregular shape packing problem. Journal of Heuristics 16(2), 167–188 (2010)
Dowsland, K.A., Dowsland, W.B., Bennell, J.A.: Jostling for position: local improvement for irregular cutting patterns. Journal of the Operational Research Society 49(6), 647–658 (1998)
Falkenauer, E.: The worth of the uniform [uniform crossover]. In: Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406), vol. 1, p. 782 (1999)
Gonçalves, J.F., Resende, M.G.C.: A biased random key genetic algorithm for 2D and 3D bin packing problems. International Journal of Production Economics 145(2), 500–510 (2013)
Han, W., Bennell, J.A., Zhao, X., Song, X.: Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints. European Journal of Operational Research 230(3), 495–504 (2013)
Lopez-Camacho, E., Ochoa, G., Terashima-Marin, H., Burke, E.K.: An effective heuristic for the two-dimensional irregular bin packing problem. Annals of Operations Research 206(1), 241–264 (2013)
Martinez-Sykora, A., Alvarez-Valdes, R., Bennell, J., Tamarit, J.M.: Constructive procedures to solve 2-dimensional bin packing problems with irregular pieces and guillotine cuts. Omega 52, 15–32 (2015)
Martinez-Sykora, A., Alvarez-Valdes, R., Bennell, J.A., Ruiz, R., Tamarit, J.M.: Matheuristics for the irregular bin packing problem with free rotations. European Journal of Operational Research 258(2), 440–455 (2017)
Oliveira, J.F., Gomes, A.M., Ferreira, J.S.: TOPOS – A new constructive algorithm for nesting problems. OR-Spektrum 22(2), 263–284 (2000)
Ortmann, F.G., Ntene, N., van Vuuren, J.H.: New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems. European Journal of Operational Research 203(2), 306–315 (2010)
Pisinger, D., Sigurd, M.: The two-dimensional bin packing problem with variable bin sizes and costs. Discrete Optimization 2(2), 154–167 (2005)
Song, X., Bennell, J.A.: Column generation and sequential heuristic procedure for solving an irregular shape cutting stock problem. Journal of the Operational Research Society 65(7), 1037–1052 (2014)
Wei, L., Oon, W., Zhu, W., Lim, A.: A goal-driven approach to the 2D bin packing and variable-sized bin packing problems. European Journal of Operational Research 224, 110–121 (2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Abeysooriya, R.P., Bennell, J.A., Martinez-Sykora, A. (2017). Efficient Local Search Heuristics for Packing Irregular Shapes in Two-Dimensional Heterogeneous Bins. In: Bektaş, T., Coniglio, S., Martinez-Sykora, A., Voß, S. (eds) Computational Logistics. ICCL 2017. Lecture Notes in Computer Science(), vol 10572. Springer, Cham. https://doi.org/10.1007/978-3-319-68496-3_37
Download citation
DOI: https://doi.org/10.1007/978-3-319-68496-3_37
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-68495-6
Online ISBN: 978-3-319-68496-3
eBook Packages: Computer ScienceComputer Science (R0)