Publication:
A new mixed-integer programming model for irregular strip packing based on vertical slices with a reproducible survey

Loading...
Thumbnail Image
Official URL
Full text at PDC
Publication Date
2022
Advisors (or tutors)
Editors
Journal Title
Journal ISSN
Volume Title
Publisher
Citations
Google Scholar
Research Projects
Organizational Units
Journal Issue
Abstract
The irregular strip-packing problem, also known as nesting or marker making, is defined as the automatic computation of a non-overlapping placement of a set of non-convex polygons onto a rectangular strip of fixed width and unbounded length, such that the strip length is minimized. Nesting methods based on heuristics are a mature technology, and currently, the only practical solution to this problem. However, recent performance gains of the Mixed-Integer Programming (MIP) solvers, together with the known limitations of the heuristics methods, have encouraged the exploration of exact optimization models for nesting during the last decade. Despite the research effort, the current family of exact MIP models for nesting cannot efficiently solve both large problem instances and instances containing polygons with complex geometries. In order to improve the efficiency of the current MIP models, this work introduces a new family of continuous MIP models based on a novel formulation of the NoFit-Polygon Covering Model (NFP-CM), called NFP-CM based on Vertical Slices (NFP-CM-VS). Our new family of MIP models is based on a new convex decomposition of the feasible space of relative placements between pieces into vertical slices, together with a new family of valid inequalities, symmetry breakings, and variable eliminations derived from the former convex decomposition. Our experiments show that our new NFP-CM-VS models outperform the current state-of-the-art MIP models. Finally, we provide a detailed reproducibility protocol and dataset based on our Java software library as supplementary material to allow the exact replication of our models, experiments, and results.
Description
Keywords
Citation
[1] Adamowicz, M., Albano, A., 1976a. Nesting two-dimensional shapes in rectangular modules. Comput. Aided Des. Appl. 8, 27–33. [2] Adamowicz, M., Albano, A., 1976b. A solution of the rectangular Cutting-Stock problem. IEEE Trans. Syst. Man Cybern. SMC-6, 302–310. [3] Agarwal, P.K., Flato, E., Halperin, D., 2002. Polygon decomposition for efficient construction of Minkowski sums. Computational geometry: theory and applications 21, 39–61. [4] Al Theeb, N.A., Hayajneh, M.T., Jaradat, M.Y., 2021. New strategy to improve the dotted board model for solving two dimensional cutting and packing problems. Computers & Industrial Engineering 159, 107467. [5] Albano, A., Sapuppo, G., 1980. Optimal allocation of Two-Dimensional irregular shapes using heuristic search methods. Systems, Man and Cybernetics, IEEE Transactions on 10, 242–248. [6] Alvarez-Valdes, R., Martinez, A., Tamarit, J.M., 2013. A branch & bound algorithm for cutting and packing irregularly shaped pieces. Int. J. Prod. Econ. 145, 463–477. [7] Álvarez-Valdés, R., Parreño, F., Tamarit, J.M., 2009. A branch and bound algorithm for the strip packing problem. OR Spectrum. Quantitative Approaches in Management 31, 431–459. [8] Alves, C., Brás, P., Valério de Carvalho, J., Pinto, T., 2012. New constructive algorithms for leather nesting in the automotive industry. Computers & operations research 39, 1487–1505. [9] Amaro Júnior, B., Pinheiro, P.R., Coelho, P.V., 2017. A parallel biased Random-Key genetic algorithm with multiple populations applied to irregular strip packing problems. Math. Probl. Eng. 2017. [10] Annamalai Vasantha, G.V., Jagadeesan, A.P., Corney, J.R., Lynn, A., Agrawal, A., 2016. Crowdsourcing solutions to 2D irregular strip packing problems from internet workers. Int. J. Prod. Res. 54, 4104–4125. [11] Art, Jr, R.C., 1966. An approach to the two dimensional irregular cutting stock problem. Ph.D. thesis. Massachusetts Institute of Technology. [12] Bennell, J.A., Oliveira, J.F., 2008. The geometry of nesting problems: A tutorial. Eur. J. Oper. Res. 184, 397–415. [13] Bennell, J.A., Oliveira, J.F., 2009. A tutorial in irregular shape packing problems. J. Oper. Res. Soc. , S93–S105. [14] Bennell, J.A., Oliveira, J.F., Wäscher, G., 2013. Cutting and packing. International Journal of Production Economics 145, 449–450. [15] de Berg, M., Van Kreveld, M., Overmars, M., Schwarzköpf, O., 1997. Computational Geometry: Algorithms and Applications. Springer-Verlag. [16] Carravilla, M.A., Ribeiro, C., 2005. CP and MIP in the resolution of hard combinatorial problems: A case study with nesting problems, in: Proceedings of the CSCLP 2005 Joint ERCIM/CoLogNET InternationalWorkshop on Constraint Solving and Constraint Logic Programming, Citeseer, Uppsala, Sweden. pp. 113–127. [17] Carravilla, M.A., Ribeiro, C., Oliveira, J.F., 2003. Solving nesting problems with non-convex polygons by constraint logic programming. Int. Trans. Oper. Res. 10, 651–663. [18] Cheok, B.T., Nee, A.Y.C., 1991. Algorithms for nesting of ship/offshore structural plates. American Society of Mechanical Engineers, Design Engineering Division (Publication) DE 32, 221–226. [19] Chernov, N., Stoyan, Y., Romanova, T., 2010. Mathematical model and efficient algorithms for object packing problem. Comput. Geom. 43, 535–553. [20] Chernov, N., Stoyan, Y., Romanova, T., Pankratov, A., 2012. Phi-Functions for 2D Objects Formed by Line Segments and Circular Arcs. Advances in Operations Research 2012. [21] Cherri, L.H., Carravilla, M.A., Ribeiro, C., Toledo, F.M.B., 2019. Optimality in nesting problems: New constraint programming models and a new global constraint for non-overlap. Operations Research Perspectives 6, 100125. [22] Cherri, L.H., Carravilla, M.A., Toledo, F.M.B., 2016a. A MODEL-BASED HEURISTIC FOR THE IRREGULAR STRIP PACKING PROBLEM. Pesquisa Operacional 36, 447–468. [23] Cherri, L.H., Cherri, A.C., Carravilla, M.A., Oliveira, J.F., Toledo, F.M.B., Vianna, A.C.G., 2018a. An innovative data structure to handle the geometry of nesting problems. International Journal of Production Research 56, 7085–7102. [24] Cherri, L.H., Cherri, A.C., Soler, E.M., 2018b. Mixed integer quadratically-constrained programming model to solve the irregular strip packing problem with continuous rotations. J. Global Optimiz. 72, 89–107. [25] Cherri, L.H., Mundim, L.R., Andretta, M., Toledo, F.M.B., Oliveira, J.F., Carravilla, M.A., 2016b. Robust mixed-integer linear programming models for the irregular strip packing problem. European Journal of Operational Research 253, 570–583. [26] Codato, G., Fischetti, M., 2006. Combinatorial Benders’ Cuts for Mixed-Integer Linear Programming. Operations research 54, 756–766. [27] Conte, A., Grossi, R., Marino, A., 2020. Large-scale clique cover of real-world networks. Information and Computation 270, 104464. [28] Cuninghame-Green, R., 1989. Geometry, shoemaking and the milk tray problem. New scientist 123, 50–53. [29] Daniels, K., Li, Z., Milenkovic, V., 1994. Multiple containment methods. Technical Report Technical Report TR-12-94. Harvard Computer Science Group. [30] Dean, H.T., 2002. Minimizing waste in the 2-dimensional cutting stock problem. Ph.D. thesis. Department of Mechanical Engineering, University of Canterbury. Christchurch, New Zealand. [31] Dolan, E.D., Moré, J.J., 2002. Benchmarking optimization software with performance profiles. Mathematical Programming. A Publication of the Mathematical Programming Society 91, 201–213. [32] Dowsland, K.A., Dowsland, W.B., 1992. Packing problems. Eur. J. Oper. Res. 56, 2–14. [33] Dowsland, K.A., Dowsland, W.B., 1995. Solution approaches to irregular nesting problems. Eur. J. Oper. Res. 84, 506–521. [34] Dowsland, K.A., Vaid, S., Dowsland, W.B., 2002. An algorithm for polygon placement using a bottom-left strategy. European Journal of Operational Research 141, 371–381. [35] Dyckhoff, H., 1990. A typology of cutting and packing problems. Eur. J. Oper. Res. 44, 145–159. [36] Elamvazuthi, I., Kamaruddin, S., Azmi, M.S., 2009. Automation of nesting and cutting processes of leather furniture production: a case study. International Journal of Mechanical & Mechatronics Engineering IJMME 9. [37] Elkeran, A., 2013. A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering. Eur. J. Oper. Res. 231, 757–769. [38] Fernández, J., Cánovas, L., Pelegrín, B., 2000. Algorithms for the decomposition of a polygon into convex polygons. European Journal of Operational Research 121, 330–342. [39] Fischetti, M., Luzzi, I., 2009. Mixed-integer programming models for nesting problems. Journal of Heuristics 15, 201–226. [40] Fowler, R.J., Paterson, M.S., Tanimoto, S.L., 1981. Optimal packing and covering in the plane are NP-complete. Inf. Process. Lett. 12, 133–137. [41] Gilmore, P.C., Gomory, R.E., 1965. Multistage cutting stock problems of two and more dimensions. Oper. Res. 13, 94–120. [42] Gomes, A.M., Oliveira, J.F., 2002. A 2-exchange heuristic for nesting problems. Eur. J. Oper. Res. 141, 359–370. [43] Greene, D.H., 1983. The decomposition of polygons into convex parts, in: Preparata, F. (Ed.), Computational Geometry. JAI Press, Greenwich, Connecticut (USA).. volume 1 of Adv. Comput. Res., pp. 235–259. [44] Han, W., Bennell, J.A., Zhao, X., Song, X., 2013. Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints. Eur. J. Oper. Res. 230, 495–504. [45] Heistermann, J., Lengauer, T., 1995. The nesting problem in the leather manufacturing industry. Ann. Oper. Res. . [46] Hopper, E., Turton, B.C.H., 2001. A review of the application of Meta-Heuristic algorithms to 2D strip packing problems. Artificial Intelligence Review 16, 257–300. [47] Iori, M., de Lima, V.L., Martello, S., Miyazawa, F.K., Monaci, M., 2021. Exact solution techniques for two-dimensional cutting and packing. European Journal of Operational Research 289, 399–415. [48] Jones, D.R., 2014. A fully general, exact algorithm for nesting irregular shapes. J. Global Optimiz. 59, 367–404. [49] Kallrath, J., 2009. Cutting circles and polygons from area-minimizing rectangles. Journal of Global Optimization 43, 299–328. [50] Lastra-Díaz, J.J., Ortuño, M.T., 2022. Reproducibility dataset for a new mixed-integer programming model for irregular strip packing based on vertical slices. Mendeley Data, V1, doi:10.17632/m8nzsk5c9v.1. http://dx.doi.org/10.17632/m8nzsk5c9v.1. [51] Leao, A.A.S., Toledo, F.M.B., 2021. Enhanced solution for the irregular strip packing problem: valid inequalities and branching priorities, in: LIII Simpósio Brasileiro de Pesquisa Operacional Joao Pessoa, pp. 1–12. [52] Leao, A.A.S., Toledo, F.M.B., Oliveira, J.F., Carravilla, M.A., 2016. A semi-continuous MIP model for the irregular strip packing problem. International Journal of Production Research 54, 712–721. [53] Leao, A.A.S., Toledo, F.M.B., Oliveira, J.F., Carravilla, M.A., Álvarez-Valdés, R., 2020. Irregular packing problems: A review of mathematical models. European Journal of Operational Research 282, 803–822. [54] Li, Z., 1994. Compaction algorithms for non-convex polygons and their applications. Ph.D. thesis. Harvard University. http://nrs.harvard.edu/urn-3:HUL.InstRepos:25619464. [55] Li, Z., Milenkovic, V., 1993. A compaction algorithm for non-convex polygons and its application, in: Proceedings of the Ninth Annual Symposium on Computational Geometry, ACM, New York, NY, USA. pp. 153–162. [56] Li, Z., Milenkovic, V., 1995. Compaction and separation algorithms for non-convex polygons and their applications. Eur. J. Oper. Res. 84, 539–561. [57] Lodi, A., Martello, S., Vigo, D., 2002. Recent advances on two-dimensional bin packing problems. Discrete Appl. Math. 123, 379–396. [58] Milenkovic, V., Daniels, K., Li, Z., 1991. Automatic marker making, in: Proceedings of the Third Canadian Conference on Computational Geometry, nereida.deioc.ull.es. pp. 243–246. [59] Moore, R.E., 1966. Interval analysis. Prentice Hall. [60] Moore, R.E., Kearfott, R.B., Cloud, M.J., 2009. Introduction to INTERVAL ANALYSIS. volume 2. Society for Industrial and Applied Mathematics (SIAM). [61] Mundim, L.R., Andretta, M., Carravilla, M.A., Oliveira, J.F., 2018. A general heuristic for two-dimensional nesting problems with limited-size containers. Int. J. Prod. Res. 56, 709–732. [62] Mundim, L.R., Andretta, M., de Queiroz, T.A., 2017. A biased random key genetic algorithm for open dimension nesting problems using no-fit raster. Expert Syst. Appl. 81, 358–371. [63] Pankratov, A., Romanova, T., Shekhovtsov, S., Grebennik, I., Pankratova, J., 2020. Packing Irregular Polygons using Quasi Phi-functions, in: 2020 10th International Conference on Advanced Computer Information Technologies (ACIT), pp. 1–5. [64] Peralta, J., Andretta, M., Oliveira, J.F., 2018. SOLVING IRREGULAR STRIP PACKING PROBLEMS WITH FREE ROTATIONS USING SEPARATION LINES. Pesqui. Oper. 38, 195–214. [65] Pinheiro, P.R., Amaro Júnior, B., Saraiva, R.D., 2016. A random-key genetic algorithm for solving the nesting problem. Int. J. Comput. Integr. Manuf. 29, 1159–1165. [66] Puri, A., 2013. Efficacy of Pattern Making Software in Product Development. International Journal of Advanced Quality Management 1, 21–39. [67] Ribeiro, C., Carravilla, M.A., 2004. A global constraint for nesting problems, in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Springer Berlin Heidelberg. pp. 256–270. [68] Ribeiro, C., Carravilla, M.A., 2009. A global constraint for nesting problems. Artificial Intelligence Review 30, 99. [69] Ribeiro, C., Carravilla, M.A., Oliveira, J.F., 1999. Applying constraint logic programming to the resolution of nesting problems. Pesquisa Operacional 19, 239–247. [70] Riff, M.C., Bonnaire, X., Neveu, B., 2009. A revision of recent approaches for two-dimensional strip-packing problems. Engineering applications of artificial intelligence 22, 823–827. [71] Rocha, P., Gomes, A.M., Rodrigues, R., Toledo, F.M.B., Andretta, M., 2016. Constraint Aggregation in Non-linear Programming Models for Nesting Problems, in: Computational Management Science, Springer International Publishing. pp. 175–180. [72] Rocha, P., Rodrigues, R., Gomes, A.M., Toledo, F.M.B., Andretta, M., 2014. Circle Covering Representation for Nesting problems with continuous rotations. IFAC Proceedings Volumes. Proc. of the 19th IFAC World Congress 47, 5235–5240. [73] Rodrigues, M.O., Cherri, L.H., Mundim, L.R., 2017. MIP models for the irregular strip packing problem: new symmetry breaking constraints. ITM Web of Conferences 14, 00005. [74] Rodrigues, M.O., Toledo, F.M.B., 2017. A clique covering MIP model for the irregular strip packing problem. Comput. Oper. Res. 87, 221–234. [75] Romanova, T., Stoyan, Y., Pankratov, A., Litvinchev, I., Marmolejo, J.A., 2020. Decomposition Algorithm for Irregular Placement Problems, in: Intelligent Computing and Optimization, Springer International Publishing. pp. 214–221. [76] Santoro, M.C., Lemos, F.K., 2015. Irregular packing: MILP model based on a polygonal enclosure. Ann. Oper. Res. 235, 693–707. [77] Sato, A.K., Martins, T.C., Gomes, A.M., Tsuzuki, M.S.G., 2019. Raster penetration map applied to the irregular packing problem. European Journal of Operational Research 279, 657–671. [78] Sato, A.K., Martins, T.d.C., Tsuzuki, M.d.S.G., 2016a. A pairwise exact placement algorithm for the irregular nesting problem. International Journal of Computer Integrated Manufacturing 29, 1177–1189. [79] Sato, A.K., de Sales Guerra Tsuzuki, M., de Castro Martins, T., Gomes, A.M., 2016b. Study of the grid size impact on a raster based strip packing problem solution. IFAC-PapersOnLine 49, 143–148. [80] Sawaya, N.W., Grossmann, I.E., 2005. A cutting plane method for solving linear generalized disjunctive programming problems. Computers & chemical engineering 29, 1891–1913. [81] Rodrigues de Souza, L., Andretta, M., 2020. Modelo de programaçao estocástica para um problema de corte de itens irregulares, in: LII Simpósio Brasileiro de Oesquisa Operacional. [82] Rodrigues de Souza, L., Andretta, M., 2022. A branch-and-cut algorithm for the irregular strip packing problem with uncertain demands. International transactions in operational research: a journal of The International Federation of Operational Research Societies . [83] Stoyan, Y., Pankratov, A., Romanova, T., 2016a. Cutting and packing problems for irregular objects with continuous rotations: mathematical modelling and non-linear optimization. The Journal of the Operational Research Society 67, 786–800. [84] Stoyan, Y., Pankratov, A., Romanova, T., 2016b. Quasi-phi-functions and optimal packing of ellipses. Journal of Global Optimization 65, 283–307. [85] Stoyan, Y., Pankratov, A., Romanova, T., 2017. Placement Problems for Irregular Objects: Mathematical Modeling, Optimization and Applications, in: Butenko, S., Pardalos, P.M., Shylo, V. (Eds.), Optimization Methods and Applications : In Honor of Ivan V. Sergienko’s 80th Birthday. Springer International Publishing, Cham, pp. 521–559. [86] Stoyan, Y., Romanova, T., 2013. Mathematical Models of Placement Optimisation: Two- and Three-Dimensional Problems and Applications, in: Fasano, G., Pintér, J.D. (Eds.), Modeling and Optimization in Space Engineering. Springer New York, New York, NY, pp. 363–388. [87] Stoyan, Y., Romanova, T., Pankratov, A., Chugay, A., 2015. Optimized Object Packings Using Quasi-Phi-Functions, in: Fasano, G., Pintér, J.D. (Eds.), Optimized Packings with Applications. Springer International Publishing, Cham, pp. 265–293. [88] Stoyan, Y.G., Novozhilova, M.V., Kartashov, A.V., 1996. Mathematical model and method of searching for a local extremum for the nonconvex oriented polygons allocation problem. European Journal of Operational Research 92, 193–210. [89] Stoyan, Y.G., Zlotnik, M.V., Chugay, A.M., 2012. Solving an optimization packing problem of circles and non-convex polygons with rotations into a multiply connected region. The Journal of the Operational Research Society 63, 379–391. [90] Sweeney, P.E., Paternoster, E.R., 1992. Cutting and packing problems: A categorized, Application-Orientated research bibliography. J. Oper.Res. Soc. 43, 691–706. [91] Toledo, F.M.B., Carravilla, M.A., Ribeiro, C., Oliveira, J.F., Gomes, A.M., 2013. The Dotted-Board model: A new MIP model for nesting irregular shapes. Int. J. Prod. Econ. 145, 478–487. [92] Wang, A., Hanselman, C.L., Gounaris, C.E., 2018. A customized branch-and-bound approach for irregular shape nesting. J. Global Optimiz. 71, 935–955. [93] Wang, P.Y., Wäscher, G., 2002. Cutting and packing. European Journal of Operational Research 141, 239–240. [94] Wäscher, G., Haußner, H., Schumann, H., 2007. An improved typology of cutting and packing problems. Eur. J. Oper. Res. 183, 1109–1130. [95] Whelan, P.F., Batchelor, B.G., 1993. Automated packing systems: Review of industrial implementations. Mach. Vis. Appl.
Collections