Abstract
This paper is related to open-dimension problems in the area of cutting and packing. The problem we are interested in considers a set of irregularly shaped items and a two-dimensional (2D) bin in which one side is open. The objective is to pack all items in the bin and, in the case of a bin with one opened side, we also want to minimize the length of such a side. A packing cannot have items overlapping each other and items extrapolating the bin’s dimensions. This problem appears in the metal-mechanic, textile, leather, and other related industries to the cutting of irregular pieces. We propose a variable neighborhood search-based heuristic for such a problem. A solution is coded as a vector of items that gives the sequence in which items will be packed. Neighborhood structures based on swap and insertion movements are considered in the local search phase, while the shaking phase contains a single neighborhood structure based on swap movements. Numerical experiments on benchmark instances show that the heuristic is competitive compared to other literature methods, obtaining equal or better solutions for 90.90% of the instances.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Albano, A., Sapuppo, G.: Optimal allocation of two-dimensional irregular shapes using heuristic search methods. IEEE Trans. Syst. Man Cybern. 10(5), 242–248 (1980)
de Almeida Cunha, J.G., de Lima, V.L., de Queiroz, T.A.: Grids for cutting and packing problems: a study in the 2D knapsack problem. 4OR 18(3), 293–339 (2019). https://doi.org/10.1007/s10288-019-00419-9
Bennell, J.A., Oliveira, J.F.: A tutorial in irregular shape packing problems. J. Oper. Res. Soc. 60, 93–105 (2009)
Carravilla, M.A., Ribeiro, C., Oliveira, J.F., Gomes, A.M.: Solving nesting problems with non-convex polygons by constraint logic programming. Int. Trans. Oper. Res. 10, 651–663 (2003)
Cherri, L.H., Mundim, L.R., Andretta, M., Toledo, F.M., Oliveira, J.F., Carravilla, M.A.: Robust mixed-integer linear programming models for the irregular strip packing problem. Eur. J. Oper. Res. 253(3), 570–583 (2016)
Duarte, A., Pardo, E.G.: Special issue on recent innovations in variable neighborhood search. J. Heuristics 26, 335–338 (2020)
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)
Fischetti, M., Luzzi, I.: Mixed-integer programming models for nesting problems. J. Heuristics 15, 201–226 (2009)
Fujita, K., Akagi, S., Hirokawa, N.: Hybrid approach for optimal nesting using a genetic algorithm and a local minimization algorithm. In: Proceedings of the 19th Annual ASME Design Automation Conference, pp. 477–484. Albuquerque, New Mexico, USA (1993)
Gomes, A.M., Oliveira, J.F.: A 2-exchange heuristic for nesting problems. Eur. J. Oper. Res. 141(2), 359–370 (2002)
Gomes, A.M., Oliveira, J.F.: Solving irregular strip packing problems by hybridising simulated annealing and linear programming. Eur. J. Oper. Res. 171(3), 811–829 (2006)
Hansen, P., Mladenović, N., Pérez, J.M.: Variable neighbourhood search: methods and applications. Ann. Oper. Res. 175(1), 367–407 (2010)
Hansen, P., Mladenović, N., Todosijević, R., Hanafi, S.: Variable neighborhood search: basics and variants. EURO J. Comput. Optim. 5, 423–454 (2017)
Hopper, E.: Mathematical models and heuristic methods for nesting problems. School of Engineering, University of Wales, Cardiff, Doutorado (2000)
Jakobs, S.: On genetic algorithms for the packing of polygons. Eur. J. Oper. Res. 88(1), 165–181 (1996)
Leão, A.A.S., Toledo, F.M.B., Oliveira, J.F., Carravilla, M.A.: A semi-continuous mip model for the irregular strip packing problem. Int. J. Prod. Res. 54(3), 712–721 (2016)
Mundim, L.R., Andretta, M., Queiroz, T.A.: A biased random key genetic algorithm for open dimension nesting problems using no-fit raster. Expert Syst. Appl. 81, 358–371 (2017). https://doi.org/10.1016/j.eswa.2017.03.059
Oliveira, J.F.C., Ferreira, J.A.S.: Algorithms for nesting problems. In: Vidal, R.V.V. (eds.) Applied Simulated Annealing. Lecture Notes in Economics and Mathematical Systems, vol. 396, pp. 255–273. Springer, Berlin, Heidelberg (1993). https://doi.org/10.1007/978-3-642-46787-5_13
Rodrigues, M.O., Toledo, F.M.: A clique covering mip model for the irregular strip packing problem. Comput. Oper. Res. 87, 221–234 (2017)
Scheithauer, G.: Introduction to Cutting and Packing Optimization: Problems, Modeling Approaches, Solution Methods, vol. 263. Springer, Cham (2017)
Souza, Queiroz, L.R., Andretta, M.: Two effective methods for the irregular knapsack problem. Appl. Soft Comput. 95, 106485 (2020)
Souza, Queiroz, L.R., Andretta, M.: A branch-and-cut algorithm for the irregular strip packing problem with uncertain demands. Int. Trans. Oper. Res. 29(6), 3486–3513 (2022)
Toledo, F.M.B., Carravilla, M.A., Ribeiro, C., Oliveira, J.F., Gomes, A.M.: The dotted-board model: a new mip model for nesting irregular shapes. Int. J. Prod. Econ. 145(2), 478–487 (2013)
Acknowledgements
The authors acknowledge the financial support of the National Council for Scientific and Technological Development (CNPq grants numbers 405369/2021-2 and 311185/2020-7) and the State of Goiás Research Foundation (FAPEG).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Queiroz, L.R.d.S., de Queiroz, T.A. (2023). A VNS Based Heuristic for a 2D Open Dimension Problem. In: Sleptchenko, A., Sifaleras, A., Hansen, P. (eds) Variable Neighborhood Search. ICVNS 2022. Lecture Notes in Computer Science, vol 13863. Springer, Cham. https://doi.org/10.1007/978-3-031-34500-5_10
Download citation
DOI: https://doi.org/10.1007/978-3-031-34500-5_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-34499-2
Online ISBN: 978-3-031-34500-5
eBook Packages: Computer ScienceComputer Science (R0)