Abstract
In this paper, we propose a heuristic for the two-dimensional irregular bin packing problems (2DIRBPP) with limited rotations. To solve the 2DIRBPP, we use the First Fit Decreasing (FFD) strategy to assign the pieces to the bins, then use the Bottom-Left algorithm and the pieces exchange method to place pieces into each bin, and finally perform a local search to improve the solution. The results show that our approach is competitive with all existing approaches on several sets of standard benchmark.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Abeysooriya, R.P., Bennell, J.A., Martinez-Sykora, A.: Jostle heuristics for the 2d-irregular shapes bin packing problems with free rotation. Int. J. Prod. Econ. 195, 12–26 (2018)
Bennell, J.A., Dowsland, K.A., Dowsland, W.B.: The irregular cutting-stock problem–a new procedure for deriving the no-fit polygon. Comput. Oper. Res. 28(3), 271–287 (2001)
Burke, E.K., Hellier, R.S., Kendall, G., Whitwell, G.: Complete and robust no-fit polygon generation for the irregular stock cutting problem. Eur. J. Oper. Res. 179(1), 27–49 (2007)
Elkeran, A.: A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering. Eur. J. Oper. Res. 231(3), 757–769 (2013)
Imamichi, T., Yagiura, M., Nagamochi, H.: An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem. Discrete Optim. 6(4), 345–361 (2009)
Jakobs, S.: On genetic algorithms for the packing of polygons. Eur. J. Oper. Res. 88(1), 165–181 (1996)
Johnson, D.S., Demers, A., Ullman, J.D., Garey, M.R., Graham, R.L.: Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM J. Comput. 3(4), 299–325 (1974)
Leung, S.C., Lin, Y., Zhang, D.: Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem. Comput. Oper. Res. 39(3), 678–686 (2012)
Liu, D., Teng, H.: An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles. Eur. J. Oper. Res. 112(2), 413–420 (1999)
López-Camacho, E., Ochoa, G., Terashima-MarÃn, H., Burke, E.K.: An effective heuristic for the two-dimensional irregular bin packing problem. Ann. Oper. Res. 206(1), 241–264 (2013)
López-Camacho, E., Terashima-Marin, H., Ross, P., Ochoa, G.: A unified hyper-heuristic framework for solving bin packing problems. Expert Syst. Appl. 41(15), 6876–6889 (2014)
Martinez-Sykora, A., Alvarez-Valdés, R., Bennell, J.A., Ruiz, R., Tamarit, J.M.: Matheuristics for the irregular bin packing problem with free rotations. Eur. J. Oper. Res. 258(2), 440–455 (2017)
Terashima-MarÃn, H., Ross, P., FarÃas-Zárate, C., López-Camacho, E., Valenzuela-Rendón, M.: Generalized hyper-heuristics for solving 2D regular and irregular packing problems. Ann. Oper. Res. 179(1), 369–392 (2010)
Zhang, D., Chen, J., Liu, Y., Chen, H.: Discrete no-fit polygon, a simple structure for the 2-D irregular packing problem. J. Softw. 20(6), 1511–1520 (2009)
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
Liu, Q., Zeng, J., Zhang, H., Wei, L. (2020). A Heuristic for the Two-Dimensional Irregular Bin Packing Problem with Limited Rotations. In: Fujita, H., Fournier-Viger, P., Ali, M., Sasaki, J. (eds) Trends in Artificial Intelligence Theory and Applications. Artificial Intelligence Practices. IEA/AIE 2020. Lecture Notes in Computer Science(), vol 12144. Springer, Cham. https://doi.org/10.1007/978-3-030-55789-8_24
Download citation
DOI: https://doi.org/10.1007/978-3-030-55789-8_24
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-55788-1
Online ISBN: 978-3-030-55789-8
eBook Packages: Computer ScienceComputer Science (R0)