Abstract
We consider the non-guillotine bin packing problem in which a set of items must be packed into the minimum number of identical bins. We present a simple and fast heuristic that iteratively creates a new sequence of items that defines the packing order used to generate the new cutting plan. The new sequences retain, adaptively, characteristics of the previous sequences for search intensification and diversification. Computational experiments of the effectiveness of this approach are presented and discussed.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Wäscher, G., Haußner, H., Schumann, H.: An improved typology of cutting and packing problems. Eur. J. Oper. Res. 183, 1109–1130 (2007)
Berkey, J.O., Wang, P.Y.: Two-dimensional finite bin-packing algorithms. J. Oper. Res. Soc. 38, 423 (1987)
Martello, S., Vigo, D.: Exact solution of the two-dimensional finite bin packing problem. Manag. Sci. 44, 388–399 (1998)
Lodi, A., Martello, S., Vigo, D.: Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems. INFORMS J. Comput. 11, 345–357 (1999)
Boschetti, M.A., Mingozzi, A.: The two-dimensional finite bin packing problem. Part I: new lower bounds for the oriented case. Q. J. Belg. Fr. Ital. Oper. Res. Soc. 1, 27–42 (2003)
Boschetti, M.A., Mingozzi, A.: The two-dimensional finite bin packing problem. Part II: new lower and upper bounds. Q. J. Belg. Fr. Ital. Oper. Res. Soc. 1, 135–147 (2003)
Faroe, O., Pisinger, D., Zachariasen, M.: Guided local search for the three-dimensional bin-packing problem. INFORMS J. Comput. 15, 267–283 (2003)
Voudouris, C., Tsang, E.: Guided local search and its application to the traveling salesman problem. Oper. Res. 113, 469–499 (1999)
Monaci, M., Toth, P.: A set-covering-based heuristic approach for bin-packing problems. Informs J. Comput. 18, 71–85 (2006)
Parreño, F., Alvarez-Valdés, R., Oliveira, J.F., Tamarit, J.M.: A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing. Ann. Oper. Res. 179, 203–220 (2010)
Feo, T., Resende, M.G.C.: Greedy randomized adaptive search procedures. J. Glob. Optim. 6, 109–133 (1995)
Hansen, P., Mladenović, N.: Variable neighborhood search. In: Search Methodologies. Introductory Tutorials in Optimization and Decision Support Techniques, pp. 211–238 (2005)
Blum, C., Schmid, V.: Solving the 2D bin packing problem by means of a hybrid evolutionary algorithm. Procedia Comput. Sci. 18, 899–908 (2013)
Wong, L., Lee, L.S., Serdang, U.P.M.: Heuristic placement routines for two-dimensional bin packing problem. J. Math. Stat. 5, 334–341 (2009)
Martí, R., Resende, M.G.C., Ribeiro, C.C.: Multi-start methods for combinatorial optimization. Eur. J. Oper. Res. 226, 1–8 (2013)
Lesh, N., Marks, J., McMahon, A., Mitzenmacher, M.: New heuristic and interactive approaches to 2D rectangular strip packing. J. Exp. Algorithmics. 10, Article no. 1.2 (2005)
Lai, K.K., Chan, J.W.M.: Developing a simulated annealing algorithm for the cutting stock problem. Comput. Ind. Eng. 32, 115–127 (1997)
Acknowledgement
This project is funded by Portuguese funds through FCT/MCTES (PIDDAC) under the project CIICESI_2017-03.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Oliveira, Ó., Gamboa, D. (2020). Adaptive Sequence-Based Heuristic for the Two-Dimensional Non-guillotine Bin Packing Problem. In: Madureira, A., Abraham, A., Gandhi, N., Varela, M. (eds) Hybrid Intelligent Systems. HIS 2018. Advances in Intelligent Systems and Computing, vol 923. Springer, Cham. https://doi.org/10.1007/978-3-030-14347-3_36
Download citation
DOI: https://doi.org/10.1007/978-3-030-14347-3_36
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-14346-6
Online ISBN: 978-3-030-14347-3
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)