A variable neighborhood search algorithm for the leather nesting problem

DOI10.1155/2012/254346MaRDI QIDQ1954576zbMATH OpenOpenAlexWikidataFDO

Authors Cláudio Alves, Pedro Brás, Telmo Pinto, José Valério de Carvalho

Publication date 11 June 2013

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1155/2012/254346

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27)

Review text

Summary: The leather nesting problem is a cutting and packing optimization problem that consists in finding the best layout for a set of irregular pieces within a natural leather hide with an irregular surface and contour. In this paper, we address a real application of this problem related to the production of car seats in the automotive industry. The high quality requirements imposed on these products combined with the heterogeneity of the leather hides make the problem very complex to solve in practice. Very few results are reported in the literature for the leather nesting problem. Furthermore, the majority of the approaches impose some additional constraints to the layouts related to the particular application that is considered. In this paper, we describe a variable neighborhood search algorithm for the general leather nesting problem. To evaluate the performance of our approaches, we conducted an extensive set of computational experiments on real instances. The results of these experiments are reported at the end of the paper.

Recommendations

• The nesting problem in the leather manufacturing industry
• Algorithms for nesting with defects
• scientific article; zbMATH DE number 437550
• Heuristic approaches to large-scale periodic packing of irregular shapes on a rectangular sheet
• scientific article; zbMATH DE number 1313602

Cites work

• A maximal-space algorithm for the container loading problem
• An algebra of polygons through the notion of negative shapes
• An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
• An improved typology of cutting and packing problems
• Neighborhood structures for the container loading problem: a VNS implementation
• The irregular cutting-stock problem -- a new procedure for deriving the no-fit polygon.
• The nesting problem in the leather manufacturing industry
• Variable neighborhood search
• Variable neighbourhood search: methods and applications

Cited in

(3)

• A family of heuristic-based inequalities for maximizing overall safety margins in aircraft parking stands arrangement problems
• The nesting problem in the leather manufacturing industry
• An iteratively doubling binary search for the two-dimensional irregular multiple-size bin packing problem raised in the steel industry

This page was built for publication: A variable neighborhood search algorithm for the leather nesting problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1954576)