Proposta de abordagem heurística para geração de leiaute de corte irregular bidimensional

• Autor(a) principal: Romanelli, Alexandre
• Data de Publicação: 2013
• Tipo de documento: Dissertação
• Idioma: por
• Título da fonte: LOCUS Repositório Institucional da UFV
• Texto Completo: http://locus.ufv.br/handle/123456789/2656
• topic: Corte de estoque; Heurística; Geometria computacional; Cutting stock; Heuristics; Computational geometry; CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO

The problem addressed in this dissertation consists in providing a layout formed by positi- oning a set of items on the area of a large container object, so that all items are completely positioned in the interior surface of the container, and that there is no overlap between the items. We dealt with a more specific context in which only two dimensions are conside- red for the related objects, and the container is rectangular, supposedly limited only by its width. In this work, we propose a new constructive approach to provide solutions to the cutting and packing problem, formed by combining elements of other techniques for the same problem. The new method includes heuristics for ordering the sequence of items being placed, rules for determining the position that each item should occupy, and a layout compaction technique based on linear programming. We present a detailed description of this approach, as well as some experiments and results. The best results obtained are compared to other construction methods found in literature, overcoming them in 11 out of 14 instances. The contribution of this research is an introduction of a new method for solving cutting and packing problems, enabling the conduction of other works that can explore and adapt the proposed approach for application procedures aiming for better solutions.